GuillaumeHolley / BloomFilterTrieLinks
An alignment-free, reference-free and incremental data structure for colored de Bruijn graph with application to pan-genome indexing.
☆44Updated 3 years ago
Alternatives and similar repositories for BloomFilterTrie
Users that are interested in BloomFilterTrie are comparing it to the libraries listed below
Sorting:
- Cosmo is a fast, low-memory DNA assembler using a Succinct (variable order) de Bruijn Graph.☆51Updated last year
- A fast constructor of the compressed de Bruijn graph from many genomes☆41Updated 4 months ago
- Mantis: A Fast, Small, and Exact Large-Scale Sequence-Search Index☆81Updated last year
- Streaming algorithm for computing kmer statistics for massive genomics datasets☆54Updated 5 years ago
- FM-index representation of a de Bruijn graph☆27Updated 7 years ago
- Practical Dynamic de Bruijn Graphs☆18Updated 4 years ago
- efficient alignment of strings to partially ordered string graphs☆33Updated 3 years ago
- succinct labeled graphs with collections and paths☆15Updated 6 years ago
- Relative data structures based on the BWT☆12Updated 7 years ago
- Squeakr: An Exact and Approximate k -mer Counting System☆85Updated 4 months ago
- Smith-Waterman database searches with inter-sequence SIMD parallelisation☆59Updated last year
- A tool for merging large BWTs☆26Updated 4 years ago
- BWT Text Indexing Library: a set of tools to work with BWT-based text indexes☆25Updated 3 years ago
- Fast and cache-efficient full-text pangenome index☆29Updated last week
- Incremental construction of FM-index for DNA sequences☆70Updated last year
- Read alignment with a multi-genome reference☆22Updated 5 years ago
- vector illustrations of BWT based searching on small strings☆16Updated 6 years ago
- BWT-based index for graphs☆71Updated 3 months ago
- Efficient construction of the BWT using string compression☆18Updated 3 weeks ago
- SIMD-parallel BLAST X-drop DP on sequence graphs☆25Updated last year
- dynamic-updateable-index☆11Updated 9 years ago
- a toolset for fast DNA read set matching and assembly using a new type of reduced kmer☆37Updated 3 years ago
- An experimental tool to find approximate max-cuts in a large graph☆11Updated 4 years ago
- COBS - Compact Bit-Sliced Signature Index (for Genomic k-Mer Data or q-Grams)☆84Updated last year
- deBGR: An Efficient and Near-Exact Representation of the Weighted de Bruijn Graph☆30Updated 4 years ago
- A hash map using the BooPHF perfect hash function☆12Updated 8 years ago
- BlastGraph is a new tool for computing intensive approximate pattern matching in a sequence graph or a de-Bruijn graph. Given an oriented…☆12Updated 12 years ago
- A Bayesian method for doing transcriptome assembly from RNA-seq data☆25Updated 10 years ago
- Fast and compact locality-preserving minimal perfect hashing for k-mer sets.☆43Updated last year
- Implicit Interval Tree with Interpolation Index☆41Updated 2 years ago