Bloomfiltertrie
Revision as of 14:25, 13 September 2019 by Maxprok (talk | contribs) (Created page with "Category:SoftwareCategory:Phylogenetics {|<!--CONFIGURATION: REQUIRED--> |{{#vardefine:app|bloomfiltertrie}} |{{#vardefine:url|https://github.com/GuillaumeHolley/Bloom...")
Description
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.
System Variables
- HPC_{{#uppercase:bloomfiltertrie}}_DIR - installation directory
- HPC_{{#uppercase:bloomfiltertrie}}_BIN - executable directory
Citation
If you publish research that uses bloomfiltertrie you have to cite it as follows:
@article{holley2016bft,
title="{Bloom Filter Trie: an alignment-free and reference-free data structure for pan-genome storage}",
author={Holley, Guillaume and Wittler, Roland and Stoye, Jens},
journal={Algorithms Mol. Biol.},
volume={11},
pages={3},
year={2016}
}