PtrHash minimal perfect hash function
☆89Sep 2, 2025Updated 6 months ago
Alternatives and similar repositories for PtrHash
Users that are interested in PtrHash are comparing it to the libraries listed below. We may earn a commission when you buy through links labeled 'Ad' on this page.
Sorting:
- Optimal distance lower bound k-mer sampling.☆12Jun 19, 2024Updated last year
- Fast and Memory Efficient Genome Sketching via HyperLogLog, HyperMinHash and UltraLogLog☆20Jan 22, 2026Updated 2 months ago
- Rust implementations of succinct data structures☆69Updated this week
- Fast and compact locality-preserving minimal perfect hashing for k-mer sets.☆44Nov 18, 2023Updated 2 years ago
- An ε-copy serialization/deserialization framework for Rust☆173Mar 17, 2026Updated last week
- Cache-friendly, Parallel, and Samplesort-based Constructor for Suffix Arrays and LCP Arrays☆17Jun 23, 2025Updated 9 months ago
- Iterate over minimizers of a DNA sequence☆32Jul 12, 2024Updated last year
- A SIMD-accelerated library to compute random minimizers☆39Mar 1, 2026Updated 3 weeks ago
- A (Minimal) Perfect Hash Function based on irregular cuckoo hashing, retrieval, and overloading.☆21Sep 30, 2025Updated 5 months ago
- ☆24Apr 2, 2021Updated 4 years ago
- Reference implementations of minimizer schemes to go with the mod-minimizers paper.☆29Apr 24, 2025Updated 11 months ago
- FMSI is a highly memory efficient exact k-mer set index based on masked superstrings and the masked Burrows-Wheeler transform☆24Nov 20, 2025Updated 4 months ago
- Pairwise nucleotide alignment benchmark of Rust bindings☆31Jul 27, 2023Updated 2 years ago
- Compute bottom-s sketches and s-buckets sketches, using simd-minimizers crate.☆21Dec 3, 2025Updated 3 months ago
- Fast approximate string searching☆114Updated this week
- ☆18Dec 26, 2025Updated 2 months ago
- A command line utilty for working with BINSEQ files☆36Feb 28, 2026Updated 3 weeks ago
- Fast, Cache-Efficient, and Scalable Queries on Pangenomes☆38Mar 9, 2026Updated 2 weeks ago
- Mapping sequencing data to De Bruijn graphs, fast☆32Updated this week
- A small, auxiliary index to massively improve parallel fastq parsing☆31Mar 6, 2026Updated 2 weeks ago
- Implementation of a Backpack Quotient Filter☆13Jul 7, 2025Updated 8 months ago
- Rust library for processing sequencing reads.☆25Sep 2, 2024Updated last year
- ntHash implementation in Rust☆36Jul 12, 2024Updated last year
- Collection of succinct data structures in Rust☆104Mar 4, 2026Updated 2 weeks ago
- De Bruijn graphs in Rust☆71Jul 22, 2024Updated last year
- A minimal copy fastq and fasta reader built for parallel support and paired end processing☆42Jan 9, 2026Updated 2 months ago
- Rust bindings to minimap2 library☆109Mar 2, 2026Updated 3 weeks ago
- Bloom filter implementation in Nimrod☆16May 26, 2023Updated 2 years ago
- ☆21Dec 26, 2025Updated 2 months ago
- 📖 🧬 SSHash is a compressed, associative, exact, and weighted dictionary for k-mers.☆94Mar 17, 2026Updated last week
- A Rust implementation of the Quad Wavelet Tree☆51Jan 31, 2026Updated last month
- ⚡️ 🧬 Fulgor is a fast and space-efficient colored de Bruijn graph index.☆60Updated this week
- Rust implementation of the Haskell Rampart library that determines how intervals relate to each other.☆11Apr 21, 2022Updated 3 years ago
- Parallel Construction of Suffix Arrays in Rust☆26May 2, 2025Updated 10 months ago
- Minimum plain text representation of kmer sets☆16Jan 30, 2025Updated last year
- High throughput suffix array searching☆156Apr 22, 2025Updated 11 months ago
- Compacted and colored de Bruijn graph construction and querying☆94Mar 6, 2026Updated 2 weeks ago
- Portable Crystal binary distributions for Linux on x86_64☆15Mar 22, 2021Updated 5 years ago
- ✈️ PTHash is a fast and compact minimal perfect hash function.☆252Mar 9, 2026Updated 2 weeks ago