Rust implementation of probminhash, superminhash and hyperloglog sketching algorithms
☆31Jan 22, 2026Updated last month
Alternatives and similar repositories for probminhash
Users that are interested in probminhash are comparing it to the libraries listed below
Sorting:
- Fast and Memory Efficient Genome Sketching via HyperLogLog, HyperMinHash and UltraLogLog☆19Jan 22, 2026Updated last month
- Optimal distance lower bound k-mer sampling.☆12Jun 19, 2024Updated last year
- Parallel Construction of Suffix Arrays in Rust☆26May 2, 2025Updated 10 months ago
- Rust library for processing sequencing reads.☆25Sep 2, 2024Updated last year
- Basecalling configuration prediction through FASTQ files☆33Nov 24, 2025Updated 3 months ago
- A minimal copy fastq and fasta reader built for parallel support and paired end processing☆42Jan 9, 2026Updated last month
- Fast and exact gap-affine partial order alignment☆59Feb 3, 2026Updated last month
- De Bruijn graph construction for large k.☆17Aug 31, 2021Updated 4 years ago
- Simple and transparent support for compressed files.☆81Feb 27, 2026Updated last week
- A command line tool (in Kotlin/JVM) for intuitively visualizing BAM alignments. (Currently unmaintained)☆11Jan 7, 2024Updated 2 years ago
- Just another minhash implementation.☆12Feb 25, 2026Updated last week
- Fast Approximate Pattern Matching using Search Schemes☆16Jan 14, 2026Updated last month
- Fast approximate string searching☆100Updated this week
- MEM mapper prototype☆13Nov 28, 2020Updated 5 years ago
- Mapping NCBI Genbank accession to GTDB accession☆14Feb 13, 2021Updated 5 years ago
- ☆14Feb 19, 2026Updated 2 weeks ago
- mreps: software for tandem repeat identification in DNA☆15Nov 13, 2019Updated 6 years ago
- ProphAsm – a rapid computation of simplitigs directly from k-mer sets☆25Feb 17, 2023Updated 3 years ago
- ☆18Dec 26, 2025Updated 2 months ago
- Reference implementations of minimizer schemes to go with the mod-minimizers paper.☆28Apr 24, 2025Updated 10 months ago
- A graph aligner☆30Sep 17, 2024Updated last year
- A Rust library providing fully dynamic sets of k-mers with high locality☆47Feb 12, 2026Updated 3 weeks ago
- Refinements of the WFA alignment algorithm with better complexity☆26Mar 31, 2022Updated 3 years ago
- ☆16Jan 10, 2022Updated 4 years ago
- Fast sequence distance estimates☆26Jan 29, 2026Updated last month
- ☆14Oct 14, 2020Updated 5 years ago
- Shared k-mer content between two genomes☆19Jun 21, 2023Updated 2 years ago
- PAF (pairwise alignment format) validator based on extended CIGAR strings☆15Aug 10, 2025Updated 6 months ago
- Bidirectional WFA (Paper)☆49May 20, 2024Updated last year
- vector illustrations of BWT based searching on small strings☆16Apr 29, 2019Updated 6 years ago
- A pipeline for making SWIft Genomes in a Graph (SWIGG) using k-mers☆22Nov 22, 2019Updated 6 years ago
- GFA parser in Rust☆30May 26, 2023Updated 2 years ago
- Iterate over minimizers of a DNA sequence☆31Jul 12, 2024Updated last year
- nPoRe: n-Polymer Realigner for improved pileup-based variant calling☆18Jul 11, 2022Updated 3 years ago
- Compute bottom-s sketches and s-buckets sketches, using simd-minimizers crate.☆20Dec 3, 2025Updated 3 months ago
- A Go implementation of the strobemers (https://github.com/ksahlin/strobemers)☆14Apr 23, 2021Updated 4 years ago
- ☆18Nov 21, 2024Updated last year
- Wavefront alignment algorithm (WFA) in Golang☆32Jul 26, 2025Updated 7 months ago
- A SIMD-accelerated library to compute random minimizers☆39Feb 27, 2026Updated last week