egonelbre / fm-indexLinks
Educational implementation of BWT and FM-index
☆58Updated 6 years ago
Alternatives and similar repositories for fm-index
Users that are interested in fm-index are comparing it to the libraries listed below
Sorting:
- A fast, AVX2 and ARM Neon accelerated FM index library☆32Updated 5 months ago
- Incremental construction of FM-index for DNA sequences☆70Updated 11 months ago
- Compressing next-generation sequencing data with extreme prejudice.☆80Updated 3 years ago
- BWT-based index for graphs☆71Updated 2 months ago
- Cosmo is a fast, low-memory DNA assembler using a Succinct (variable order) de Bruijn Graph.☆51Updated last year
- Software accompanying "HINGE: Long-Read Assembly Achieves Optimal Repeat Resolution"☆64Updated 4 years ago
- Substring index for paths in a graph☆60Updated last month
- Fast and memory-efficient sequencing error corrector☆93Updated last year
- A repository for generating strobemers and evalaution☆78Updated last year
- A C++ header-only library for reading Oxford Nanopore Fast5 files☆53Updated 2 years ago
- Efficient, parallel compression for terabyte-scale data☆46Updated 3 weeks ago
- Fast and accurate set similarity estimation via containment min hash☆42Updated 10 months ago
- An efficient index for the colored, compacted, de Bruijn graph☆110Updated 7 months ago
- ⚡️ 🧬 Fulgor is a fast and space-efficient colored de Bruijn graph index.☆50Updated this week
- Streaming algorithm for computing kmer statistics for massive genomics datasets☆54Updated 5 years ago
- An Oxford Nanopore Basecaller☆71Updated 3 years ago
- Mantis: A Fast, Small, and Exact Large-Scale Sequence-Search Index☆81Updated last year
- FMtree: A fast locating algorithm of FM-indexes for genomic data☆18Updated 7 years ago
- a toolset for fast DNA read set matching and assembly using a new type of reduced kmer☆37Updated 3 years ago
- Code accompanying the publication for compressed graph annotation☆13Updated 6 years ago
- Smith-Waterman database searches with inter-sequence SIMD parallelisation☆59Updated last year
- Squeakr: An Exact and Approximate k -mer Counting System☆85Updated 3 months ago
- Bonsai: Fast, flexible taxonomic analysis and classification☆70Updated last year
- deBGR: An Efficient and Near-Exact Representation of the Weighted de Bruijn Graph☆30Updated 4 years ago
- Estimating k-mer coverage histogram of genomics data☆78Updated last year
- MinHash Alignment Process (MHAP, pronounced MAP): locality-sensitive hashing to detect long-read overlaps and utilities☆96Updated 2 years ago
- Proof-of-concept implementation of GWFA for sequence-to-graph alignment☆57Updated last year
- A fast constructor of the compressed de Bruijn graph from many genomes☆40Updated 4 months ago
- ☆28Updated last month
- Core library of the Genome Analysis Toolbox with de-Bruijn graph☆63Updated 4 months ago