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 7 months ago
- Incremental construction of FM-index for DNA sequences☆71Updated last year
- Fast and accurate set similarity estimation via containment min hash☆42Updated last year
- BWT-based index for graphs☆71Updated 4 months ago
- MinHash Alignment Process (MHAP, pronounced MAP): locality-sensitive hashing to detect long-read overlaps and utilities☆96Updated 3 years ago
- deBGR: An Efficient and Near-Exact Representation of the Weighted de Bruijn Graph☆30Updated 4 years ago
- Arioc: GPU-accelerated DNA short-read alignment☆70Updated 2 months ago
- Efficient, parallel compression for terabyte-scale data☆47Updated 2 months ago
- Proof-of-concept implementation of GWFA for sequence-to-graph alignment☆57Updated last year
- Building the compacted de Bruijn graph efficiently from references or reads.☆89Updated 2 months ago
- Software accompanying "HINGE: Long-Read Assembly Achieves Optimal Repeat Resolution"☆64Updated 4 years ago
- A simple Partial Order Aligner based on Lee, Grasso and Sharlow (2002), for education/demonstration purposes☆74Updated last year
- Python bindings to bwa mem☆32Updated 5 years ago
- A C++ header-only library for reading Oxford Nanopore Fast5 files☆53Updated 3 years ago
- A fast constructor of the compressed de Bruijn graph from many genomes☆41Updated 5 months ago
- deSALT - De Bruijn graph-based Spliced Aligner for Long Transcriptome reads☆44Updated 2 years ago
- An Oxford Nanopore Basecaller☆71Updated 3 years ago
- FMtree: A fast locating algorithm of FM-indexes for genomic data☆18Updated 7 years ago
- Scripts for implementing read until and other examples.☆31Updated 5 years ago
- ☆49Updated 2 years ago
- Enhanced Artificial Genome Engine: next generation sequencing reads simulator☆33Updated 5 years ago
- Cosmo is a fast, low-memory DNA assembler using a Succinct (variable order) de Bruijn Graph.☆52Updated last year
- ☆59Updated last year
- URMAP ultra-fast read mapper☆39Updated 5 years ago
- Symmetric DUST for finding low-complexity regions in DNA sequences☆43Updated last year
- Core library of the Genome Analysis Toolbox with de-Bruijn graph☆63Updated 5 months ago
- tools for error correction and working with long read data☆44Updated 10 years ago
- Fast and memory-efficient sequencing error corrector☆93Updated last year
- REINDEER REad Index for abuNDancE quERy☆57Updated 2 weeks ago
- Streaming algorithm for computing kmer statistics for massive genomics datasets☆54Updated 5 years ago