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:
- A fast constructor of the compressed de Bruijn graph from many genomes☆42Updated 7 months ago
- Practical Dynamic de Bruijn Graphs☆18Updated 4 years ago
- Cosmo is a fast, low-memory DNA assembler using a Succinct (variable order) de Bruijn Graph.☆52Updated last year
- Mantis: A Fast, Small, and Exact Large-Scale Sequence-Search Index☆82Updated last year
- A tool for merging large BWTs☆26Updated 4 years ago
- SIMD-parallel BLAST X-drop DP on sequence graphs☆24Updated last year
- Incremental construction of FM-index for DNA sequences☆72Updated last year
- Pan-genome Seed Index☆20Updated 6 months ago
- a toolset for fast DNA read set matching and assembly using a new type of reduced kmer☆37Updated 4 years ago
- Fast and cache-efficient full-text pangenome index☆29Updated last week
- FM-index representation of a de Bruijn graph☆27Updated 8 years ago
- A hash map using the BooPHF perfect hash function☆13Updated 8 years ago
- Squeakr: An Exact and Approximate k -mer Counting System☆85Updated 6 months ago
- BWT-based index for graphs☆72Updated 6 months ago
- vector illustrations of BWT based searching on small strings☆16Updated 6 years ago
- Streaming algorithm for computing kmer statistics for massive genomics datasets☆54Updated 5 years ago
- ☆24Updated 4 years ago
- De Bruijn graph representation in low memory☆35Updated last year
- Fast and compact locality-preserving minimal perfect hashing for k-mer sets.☆43Updated last year
- COBS - Compact Bit-Sliced Signature Index (for Genomic k-Mer Data or q-Grams)☆83Updated last year
- Layout module for raw de novo genome assembly of long uncorrected reads.☆21Updated 4 years ago
- efficient alignment of strings to partially ordered string graphs☆33Updated 3 years ago
- An optimal space run-length Burrows-Wheeler transform full-text index☆27Updated 3 years ago
- ☆13Updated 9 years ago
- Run-length compressed BWT with LZ77 sampled suffix array☆11Updated 3 years ago
- Implicit Interval Tree with Interpolation Index☆41Updated 3 years ago
- ☆24Updated 3 weeks ago
- An experimental tool to find approximate max-cuts in a large graph☆10Updated 4 years ago
- Read alignment with a multi-genome reference☆22Updated 5 years ago
- ☆73Updated 6 years ago