PtrHash minimal perfect hash function
☆88Sep 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
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
- Fast and compact locality-preserving minimal perfect hashing for k-mer sets.☆43Nov 18, 2023Updated 2 years ago
- Rust implementations of succinct data structures☆69Feb 18, 2026Updated 2 weeks ago
- Cache-friendly, Parallel, and Samplesort-based Constructor for Suffix Arrays and LCP Arrays☆17Jun 23, 2025Updated 8 months ago
- Iterate over minimizers of a DNA sequence☆31Jul 12, 2024Updated last year
- A SIMD-accelerated library to compute random minimizers☆39Updated this week
- Reference implementations of minimizer schemes to go with the mod-minimizers paper.☆28Apr 24, 2025Updated 10 months ago
- An ε-copy serialization/deserialization framework for Rust☆172Feb 20, 2026Updated last week
- ☆24Apr 2, 2021Updated 4 years ago
- A (Minimal) Perfect Hash Function based on irregular cuckoo hashing, retrieval, and overloading.☆21Sep 30, 2025Updated 5 months ago
- ☆18Dec 26, 2025Updated 2 months ago
- Fast, Cache-Efficient, and Scalable Queries on Pangenomes☆36Nov 7, 2025Updated 3 months ago
- Rust library for processing sequencing reads.☆25Sep 2, 2024Updated last year
- Fast approximate string searching☆100Updated this week
- 📖 🧬 SSHash is a compressed, associative, exact, and weighted dictionary for k-mers.☆93Feb 24, 2026Updated last week
- ntHash implementation in Rust☆36Jul 12, 2024Updated last year
- Pairwise nucleotide alignment benchmark of Rust bindings☆31Jul 27, 2023Updated 2 years ago
- Mapping sequencing data to De Bruijn graphs, fast☆30Updated this week
- Compute bottom-s sketches and s-buckets sketches, using simd-minimizers crate.☆20Dec 3, 2025Updated 3 months ago
- Bloom filter implementation in Nimrod☆16May 26, 2023Updated 2 years ago
- Minimum plain text representation of kmer sets☆16Jan 30, 2025Updated last year
- ☆21Dec 26, 2025Updated 2 months ago
- A minimal copy fastq and fasta reader built for parallel support and paired end processing☆42Jan 9, 2026Updated last month
- Implementation of a Backpack Quotient Filter☆13Jul 7, 2025Updated 7 months ago
- Bitpacked sequence trait and implementation☆16Updated this week
- FMSI is a highly memory efficient exact k-mer set index based on masked superstrings and the masked Burrows-Wheeler transform☆23Nov 20, 2025Updated 3 months ago
- Rust bindings to minimap2 library☆109Feb 22, 2026Updated last week
- A command line utilty for working with BINSEQ files☆35Updated this week
- Parallel Construction of Suffix Arrays in Rust☆26May 2, 2025Updated 10 months ago
- Compacted and colored de Bruijn graph construction and querying☆92Updated this week
- A small, auxiliary index to massively improve parallel fastq parsing☆31Feb 12, 2026Updated 2 weeks ago
- Rust implementation of the Haskell Rampart library that determines how intervals relate to each other.☆11Apr 21, 2022Updated 3 years ago
- De Bruijn graphs in Rust☆71Jul 22, 2024Updated last year
- Collection of succinct data structures in Rust☆104Aug 1, 2025Updated 7 months ago
- ⚡️ 🧬 Fulgor is a fast and space-efficient colored de Bruijn graph index.☆59Feb 24, 2026Updated last week
- Generate kmers/minimizers/hashes/MinHash signatures, including with multiple kmer sizes.☆24Jan 9, 2021Updated 5 years ago
- Fast viral consensus genome reconstruction☆25Feb 5, 2026Updated 3 weeks ago
- ✈️ PTHash is a fast and compact minimal perfect hash function.☆251Feb 24, 2026Updated last week