GuillaumeHolley / BloomFilterTrieLinks
An alignment-free, reference-free and incremental data structure for colored de Bruijn graph with application to pan-genome indexing.
☆43Updated 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
- efficient alignment of strings to partially ordered string graphs☆33Updated 3 years ago
- A fast constructor of the compressed de Bruijn graph from many genomes☆40Updated 4 months ago
- Mantis: A Fast, Small, and Exact Large-Scale Sequence-Search Index☆81Updated last year
- FM-index representation of a de Bruijn graph☆27Updated 7 years ago
- Practical Dynamic de Bruijn Graphs☆18Updated 4 years ago
- Relative data structures based on the BWT☆12Updated 7 years ago
- Squeakr: An Exact and Approximate k -mer Counting System☆85Updated 3 months ago
- A tool for merging large BWTs☆26Updated 4 years ago
- a toolset for fast DNA read set matching and assembly using a new type of reduced kmer☆37Updated 3 years ago
- succinct labeled graphs with collections and paths☆15Updated 6 years ago
- An experimental tool to find approximate max-cuts in a large graph☆11Updated 4 years ago
- Streaming algorithm for computing kmer statistics for massive genomics datasets☆54Updated 5 years ago
- BWT-based index for graphs☆71Updated 2 months ago
- dynamic-updateable-index☆11Updated 9 years ago
- A hash map using the BooPHF perfect hash function☆12Updated 8 years ago
- SIMD-parallel BLAST X-drop DP on sequence graphs☆25Updated last year
- utilities for indexing and sequence extraction from FASTA files☆59Updated 4 years ago
- Smith-Waterman database searches with inter-sequence SIMD parallelisation☆59Updated last year
- Substring index for paths in a graph☆60Updated last month
- Read alignment with a multi-genome reference☆22Updated 5 years ago
- COBS - Compact Bit-Sliced Signature Index (for Genomic k-Mer Data or q-Grams)☆84Updated last year
- ☆28Updated last month
- 📖 🧬 SSHash is a compressed, associative, exact, and weighted dictionary for k-mers.☆84Updated this week
- Efficient construction of the BWT using string compression☆18Updated last week
- vector illustrations of BWT based searching on small strings☆16Updated 6 years ago
- Self-contained, multi-threaded fasta/q parser☆43Updated 8 months ago
- SAPLING: Suffix Array Piecewise Linear INdex for Genomics☆25Updated 4 years ago
- MinHash Alignment Process (MHAP, pronounced MAP): locality-sensitive hashing to detect long-read overlaps and utilities☆96Updated 2 years ago
- An integrated high performance bioinformatics toolkit☆23Updated 6 years ago