✈️ PTHash is a fast and compact minimal perfect hash function.
☆270Jul 27, 2026Updated 3 months ago
Alternatives and similar repositories for pthash
Users that are interested in pthash are comparing it to the libraries listed below. We may earn a commission when you buy through links labeled 'Ad' on this page.
Sorting:
- A Benchmark of Minimal Perfect Hash Function Algorithms.☆39Dec 20, 2022Updated 3 years ago
- 📖 🧬 SSHash is a compressed, associative, exact, and weighted dictionary for k-mers.☆108Updated this week
- Implementation of the u-index☆12Jul 19, 2025Updated last year
- ⚙️🛠️ Essential C++ utilities.☆15Aug 22, 2026Updated 2 months ago
- Fast and compact locality-preserving minimal perfect hashing for k-mer sets.☆44Nov 18, 2023Updated 2 years ago
- Deploy to Railway using AI coding agents - Free Credits Offer • AdUse Claude Code, Codex, OpenCode, and more. Autonomous software development now has the infrastructure to match with Railway.
- PtrHash minimal perfect hash function☆109Oct 21, 2026Updated last week
- A (Minimal) Perfect Hash Function based on irregular cuckoo hashing, retrieval, and overloading.☆20Sep 30, 2025Updated last year
- Benchmark data structures for kmer sets.☆13Aug 29, 2026Updated 2 months ago
- ⚡️ 🧬 Fulgor is a fast and space-efficient colored de Bruijn graph index.☆59Sep 18, 2026Updated last month
- Bloom-filter based minimal perfect hash function library☆281Jul 16, 2025Updated last year
- Bumped Ribbon Retrieval and Approximate Membership Query☆52Sep 13, 2026Updated last month
- ☆11Dec 9, 2022Updated 3 years ago
- Fast and scalable minimal perfect hashing for massive key sets☆155Jul 8, 2024Updated 2 years ago
- ☆14Jul 30, 2026Updated 2 months ago
- Deploy to Railway using AI coding agents - Free Credits Offer • AdUse Claude Code, Codex, OpenCode, and more. Autonomous software development now has the infrastructure to match with Railway.
- Towards Optimal-Space Minimal Perfect Hashing Beyond Brute-Force☆15Mar 31, 2025Updated last year
- 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
- Flash Perfect Hash Table: an implementation of a dynamic perfect hash table, extremely fast for lookup☆55Aug 16, 2026Updated 2 months ago
- Optimal distance lower bound k-mer sampling.☆12Jun 19, 2024Updated 2 years ago
- Rust libraries and programs focused on succinct data structures☆173Updated this week
- Prefix Filter: Practically and Theoretically Better Than Bloom.☆50Sep 12, 2022Updated 4 years ago
- COllapsed and COmpressed trie: a data-aware compressed string dictionary☆36Apr 9, 2026Updated 6 months ago
- Virtual Tagger Plugin is a Cutter plugin that significantly improves handling and analysis of vtables and virtual functions☆16Mar 23, 2023Updated 3 years ago
- A small, auxiliary index to massively improve parallel fastq parsing☆32Mar 6, 2026Updated 7 months ago
- Bare Metal GPUs on DigitalOcean Gradient AI • AdPurpose-built for serious AI teams training foundational models, running large-scale inference, and pushing the boundaries of what's possible.
- a toolset for fast DNA read set matching and assembly using a new type of reduced kmer☆36Aug 4, 2021Updated 5 years ago
- a GFA toolkit☆13Oct 4, 2024Updated 2 years ago
- FMSI is a highly memory efficient exact k-mer set index based on masked superstrings and the masked Burrows-Wheeler transform☆25Nov 20, 2025Updated 11 months ago
- Learned Monotone Minimal Perfect Hashing☆32Sep 13, 2026Updated last month
- COBS - Compact Bit-Sliced Signature Index (for Genomic k-Mer Data or q-Grams)☆88Jan 25, 2024Updated 2 years ago
- Implementation of eBWT using Prefix-free parse (PFP)☆14Jul 14, 2025Updated last year
- Minimum plain text representation of kmer sets☆20Jan 30, 2025Updated last year
- De Bruijn graph representation in low memory☆36Jul 6, 2024Updated 2 years ago
- C++20 [Minimal] Static Perfect Hash library☆266Jul 20, 2025Updated last year
- GPUs on demand by Runpod - Special Offer Available • AdRun AI, ML, and HPC workloads on powerful cloud GPUs—without limits or wasted spend. Deploy GPUs in under a minute and pay by the second.
- C implementation of the Landau-Vishkin algorithm☆36Apr 8, 2022Updated 4 years ago
- A blend of the compact and sparse hash table implementations.☆15Aug 20, 2021Updated 5 years ago
- the we-flyin WFA-guided ultralong tiling sequence aligner☆10May 13, 2021Updated 5 years ago
- Generate kmers/minimizers/hashes/MinHash signatures, including with multiple kmer sizes.☆24Jan 9, 2021Updated 5 years ago
- Collection of succinct data structures in Rust☆108Updated this week
- ☆13Sep 25, 2023Updated 3 years ago
- FISK: Fast Iteration of Spaced K-mers☆13Updated this week