Code for the paper Succinct k-mer Set Representations Using Subset Rank Queries on the Spectral Burrows-Wheeler Transform (SBWT)
☆24Mar 13, 2025Updated last year
Alternatives and similar repositories for SBWT
Users that are interested in SBWT are comparing it to the libraries listed below
Sorting:
- Optimal distance lower bound k-mer sampling.☆12Jun 19, 2024Updated last year
- Compacted and colored de Bruijn graph construction and querying☆94Mar 6, 2026Updated 2 weeks ago
- ⚡️ 🧬 Fulgor is a fast and space-efficient colored de Bruijn graph index.☆60Updated this week
- Fast sequence distance estimates☆27Mar 10, 2026Updated last week
- Cache-friendly, Parallel, and Samplesort-based Constructor for Suffix Arrays and LCP Arrays☆17Jun 23, 2025Updated 8 months ago
- Space-efficient pseudoalignment with a colored de Bruijn graph☆52Mar 13, 2025Updated last year
- Fast and compact locality-preserving minimal perfect hashing for k-mer sets.☆44Nov 18, 2023Updated 2 years ago
- Minimum Bait Cover Toolkit Syotti.☆13Jan 22, 2025Updated last year
- mSWEEP High-resolution sweep metagenomics using fast probabilistic inference☆15Nov 19, 2025Updated 4 months ago
- ☆21Dec 26, 2025Updated 2 months ago
- ☆15Mar 11, 2026Updated last week
- A minimal copy fastq and fasta reader built for parallel support and paired end processing☆42Jan 9, 2026Updated 2 months ago
- Fast Approximate Pattern Matching using Search Schemes☆16Jan 14, 2026Updated 2 months ago
- Dashing 2 is a fast toolkit for k-mer and minimizer encoding, sketching, comparison, and indexing.☆70Jun 17, 2024Updated last year
- ProphAsm – a rapid computation of simplitigs directly from k-mer sets☆25Feb 17, 2023Updated 3 years ago
- Reference implementations of minimizer schemes to go with the mod-minimizers paper.☆29Apr 24, 2025Updated 10 months ago
- Hardware go brrr bounded context suffix array construction algorithm☆19Nov 1, 2023Updated 2 years ago
- Implementation of eBWT using Prefix-free parse (PFP)☆14Jul 14, 2025Updated 8 months ago
- Fast and Memory Efficient Genome Sketching via HyperLogLog, HyperMinHash and UltraLogLog☆20Jan 22, 2026Updated last month
- ☆15Nov 30, 2023Updated 2 years ago
- ☆19May 10, 2023Updated 2 years ago
- De Bruijn graph representation in low memory☆35Jul 6, 2024Updated last year
- Fast FASTA/Q parser and writer (C++ re-implementation of kseq library)☆57Mar 4, 2024Updated 2 years ago
- A small, auxiliary index to massively improve parallel fastq parsing☆31Mar 6, 2026Updated 2 weeks ago
- Iterate over minimizers of a DNA sequence☆32Jul 12, 2024Updated last year
- ☆24Apr 2, 2021Updated 4 years ago
- GBZ file format for pangenome graphs☆46Updated this week
- COBS - Compact Bit-Sliced Signature Index (for Genomic k-Mer Data or q-Grams)☆20Nov 24, 2024Updated last year
- A Rust library providing fully dynamic sets of k-mers with high locality☆47Feb 12, 2026Updated last month
- Minimum plain text representation of kmer sets☆16Jan 30, 2025Updated last year
- Static Huffman coding☆10Apr 3, 2017Updated 8 years ago
- A bit-packed k-mer representation (and relevant utilities) for rust☆47Jun 26, 2024Updated last year
- Iterate k-min-mers from a DNA sequence in Rust☆13Apr 8, 2024Updated last year
- Simple succinct data structures (in Rust)☆54Feb 12, 2026Updated last month
- A versatile pairwise aligner for genomic and spliced nucleotide sequences☆24Sep 12, 2025Updated 6 months ago
- Fast, Cache-Efficient, and Scalable Queries on Pangenomes☆38Mar 9, 2026Updated last week
- Minhash Index Extended to Knead Kmer Intersection☆11Mar 18, 2020Updated 6 years ago
- ☆20Aug 18, 2020Updated 5 years ago
- Mapping sequencing data to De Bruijn graphs, fast☆32Updated this week