Skip to content

bloomfiltertrie

Description

bloomfiltertrie website

This repository contains the source code of the Bloom Filter Trie (BFT) library. The BFT is an alignment-free, reference-free and incremental succinct data structure for colored de Bruijn graphs. It is based on the burst trie and use Bloom filters for efficient trie and graph traversals. The data structure indexes k-mers and their colors based on a new representation of trie vertices that compress and index shared substrings. A typical application of the BFT is pan-genome indexing.

Environment Modules

Run module spider bloomfiltertrie to find out what environment modules are available for this application.

Environment Variables

  • HPC_BFT_DIR - installation directory
  • HPC_BFT_BIN - executable directory

Categories

phylogenetics