BFT specifications

Information


Unique identifier OMICS_12030
Name BFT
Alternative name Bloom Filter Trie
Software type Package/Module
Interface Command line interface
Restrictions to use None
Operating system Unix/Linux, Mac OS
License MIT License
Computer skills Advanced
Version 0.6
Stability Stable
Requirements
Judy Arrays, Jemalloc
Maintained Yes

Versioning


No version available

Documentation


Maintainer


  • person_outline Guillaume Holley

Publication for Bloom Filter Trie

BFT citation

library_books

A representation of a compressed de Bruijn graph for pan genome analysis that enables search

2016
PMCID: 4950428
PMID: 27437028
DOI: 10.1186/s13015-016-0083-7

[…] in the string. Therefore, algorithms that construct de Bruijn graphs for assembly (see e.g. [–] and references therein) can not be used for our problem and vice versa.Recently, [] suggested to use a Bloom Filter Trie for pan-genome storage: They use a colored de Bruijn graph, where each stored k-mer has a color, but the condition for an edge is the same as in sequence assembly, i.e., the presence […]

BFT institution(s)
Genome Informatics, Faculty of Technology, Bielefeld University, Bielefeld, Germany; Center for Biotechnology, Bielefeld University, Bielefeld, Germany; International Research Training Group 1906, Bielefeld University, Bielefeld, Germany
BFT funding source(s)
The International DFG Research Training Group GRK 1906/1

BFT reviews

star_border star_border star_border star_border star_border
star star star star star

Be the first to review BFT