✈️ PTHash is a fast and compact minimal perfect hash function.
☆252Mar 9, 2026Updated last week
Alternatives and similar repositories for pthash
Users that are interested in pthash are comparing it to the libraries listed below
Sorting:
- A Benchmark of Minimal Perfect Hash Function Algorithms.☆38Dec 20, 2022Updated 3 years ago
- 📖 🧬 SSHash is a compressed, associative, exact, and weighted dictionary for k-mers.☆94Updated this week
- Fast and compact locality-preserving minimal perfect hashing for k-mer sets.☆44Nov 18, 2023Updated 2 years ago
- ⚙️🛠️ Essential C++ utilities.☆14Mar 9, 2026Updated last week
- A (Minimal) Perfect Hash Function based on irregular cuckoo hashing, retrieval, and overloading.☆21Sep 30, 2025Updated 5 months ago
- ☆11Dec 9, 2022Updated 3 years ago
- Bloom-filter based minimal perfect hash function library☆276Jul 16, 2025Updated 8 months ago
- Optimal distance lower bound k-mer sampling.☆12Jun 19, 2024Updated last year
- PtrHash minimal perfect hash function☆88Sep 2, 2025Updated 6 months ago
- Fast and scalable minimal perfect hashing for massive key sets☆149Jul 8, 2024Updated last year
- 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
- Virtual Tagger Plugin is a Cutter plugin that significantly improves handling and analysis of vtables and virtual functions☆16Mar 23, 2023Updated 2 years ago
- Generate kmers/minimizers/hashes/MinHash signatures, including with multiple kmer sizes.☆24Jan 9, 2021Updated 5 years ago
- Prefix Filter: Practically and Theoretically Better Than Bloom.☆49Sep 12, 2022Updated 3 years ago
- Bumped Ribbon Retrieval and Approximate Membership Query☆51Jun 16, 2025Updated 9 months ago
- A small, auxiliary index to massively improve parallel fastq parsing☆31Mar 6, 2026Updated 2 weeks ago
- ⚡️ 🧬 Fulgor is a fast and space-efficient colored de Bruijn graph index.☆60Updated this week
- Rust libraries and programs focused on succinct data structures☆158Updated this week
- A LaTeX package for drawing genetic construct pictograms using TikZ.☆11Jan 26, 2022Updated 4 years ago
- COBS - Compact Bit-Sliced Signature Index (for Genomic k-Mer Data or q-Grams)☆88Jan 25, 2024Updated 2 years ago
- Next Index to Query Kmer Intersection☆17Feb 1, 2023Updated 3 years ago
- Proof-of-concept implementation of GWFA for sequence-to-graph alignment☆56May 29, 2024Updated last year
- A minimal copy fastq and fasta reader built for parallel support and paired end processing☆42Jan 9, 2026Updated 2 months ago
- the we-flyin WFA-guided ultralong tiling sequence aligner☆10May 13, 2021Updated 4 years ago
- Rust implementations of succinct data structures☆69Updated this week
- Collection of succinct data structures in Rust☆104Mar 4, 2026Updated 2 weeks ago
- ☆13Sep 25, 2023Updated 2 years ago
- 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
- ProphAsm – a rapid computation of simplitigs directly from k-mer sets☆25Feb 17, 2023Updated 3 years ago
- Iterate over minimizers of a DNA sequence☆32Jul 12, 2024Updated last year
- Fast and Memory Efficient Genome Sketching via HyperLogLog, HyperMinHash and UltraLogLog☆20Jan 22, 2026Updated last month
- De Bruijn graph representation in low memory☆35Jul 6, 2024Updated last year
- a toolset for fast DNA read set matching and assembly using a new type of reduced kmer☆37Aug 4, 2021Updated 4 years ago
- Computes a constexpr (minimal) perfect hash function☆34Aug 20, 2019Updated 6 years ago
- Refinements of the WFA alignment algorithm with better complexity☆26Mar 31, 2022Updated 3 years ago
- C implementation of the Landau-Vishkin algorithm☆35Apr 8, 2022Updated 3 years ago
- Dashing 2 is a fast toolkit for k-mer and minimizer encoding, sketching, comparison, and indexing.☆70Jun 17, 2024Updated last year
- Fast approximate string searching☆114Updated this week
- In-place Parallel Super Scalar Radix Sort (IPS²Ra)☆36Jan 15, 2025Updated last year