✈️ PTHash is a fast and compact minimal perfect hash function.
☆264Jul 27, 2026Updated last month
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
- Fast and compact locality-preserving minimal perfect hashing for k-mer sets.☆44Nov 18, 2023Updated 2 years ago
- ⚙️🛠️ Essential C++ utilities.☆14Aug 22, 2026Updated last week
- A (Minimal) Perfect Hash Function based on irregular cuckoo hashing, retrieval, and overloading.☆20Sep 30, 2025Updated 11 months ago
- Managed Database hosting by DigitalOcean • AdPostgreSQL, MySQL, MongoDB, Kafka, Valkey, and OpenSearch available. Automatically scale up storage and focus on building your apps.
- Towards Optimal-Space Minimal Perfect Hashing Beyond Brute-Force☆15Mar 31, 2025Updated last year
- PtrHash minimal perfect hash function☆101Updated this week
- ☆11Dec 9, 2022Updated 3 years ago
- Optimal distance lower bound k-mer sampling.☆12Jun 19, 2024Updated 2 years ago
- Bloom-filter based minimal perfect hash function library☆281Jul 16, 2025Updated last year
- Fast and scalable minimal perfect hashing for massive key sets☆154Jul 8, 2024Updated 2 years ago
- Prefix Filter: Practically and Theoretically Better Than Bloom.☆50Sep 12, 2022Updated 3 years 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
- Generate kmers/minimizers/hashes/MinHash signatures, including with multiple kmer sizes.☆24Jan 9, 2021Updated 5 years ago
- Deploy on Railway without the complexity - Free Credits Offer • AdConnect your repo and Railway handles the rest with instant previews. Quickly provision container image services, databases, and storage volumes.
- A small, auxiliary index to massively improve parallel fastq parsing☆32Mar 6, 2026Updated 5 months ago
- Bumped Ribbon Retrieval and Approximate Membership Query☆52Jun 16, 2025Updated last year
- FMSI is a highly memory efficient exact k-mer set index based on masked superstrings and the masked Burrows-Wheeler transform☆25Nov 20, 2025Updated 9 months ago
- ⚡️ 🧬 Fulgor is a fast and space-efficient colored de Bruijn graph index.☆60Aug 13, 2026Updated 2 weeks ago
- Rust libraries and programs focused on succinct data structures☆172Updated this week
- A LaTeX package for drawing genetic construct pictograms using TikZ.☆12Jan 26, 2022Updated 4 years ago
- COBS - Compact Bit-Sliced Signature Index (for Genomic k-Mer Data or q-Grams)☆89Jan 25, 2024Updated 2 years ago
- Proof-of-concept implementation of GWFA for sequence-to-graph alignment☆57May 29, 2024Updated 2 years ago
- Next Index to Query Kmer Intersection☆17Feb 1, 2023Updated 3 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.
- the we-flyin WFA-guided ultralong tiling sequence aligner☆10May 13, 2021Updated 5 years ago
- Collection of succinct data structures in Rust☆106Updated this week
- ☆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
- Rust implementations of succinct data structures☆73Aug 20, 2026Updated last week
- Iterate over minimizers of a DNA sequence☆33Jul 12, 2024Updated 2 years ago
- SAPLING: Suffix Array Piecewise Linear INdex for Genomics☆26Sep 1, 2020Updated 5 years ago
- Fast and Memory Efficient Genome Sketching via HyperLogLog, HyperMinHash, UltraLogLog and ExaLogLog☆22Aug 19, 2026Updated last week
- Simple, predictable pricing with DigitalOcean hosting • AdAlways know what you'll pay with monthly caps and flat pricing. Enterprise-grade infrastructure trusted by 600k+ customers.
- a toolset for fast DNA read set matching and assembly using a new type of reduced kmer☆36Aug 4, 2021Updated 5 years ago
- De Bruijn graph representation in low memory☆36Jul 6, 2024Updated 2 years ago
- Computes a constexpr (minimal) perfect hash function☆36Jul 12, 2026Updated last month
- Refinements of the WFA alignment algorithm with better complexity☆26Mar 31, 2022Updated 4 years ago
- C implementation of the Landau-Vishkin algorithm☆36Apr 8, 2022Updated 4 years ago
- ☆20Apr 30, 2026Updated 4 months ago
- Flash Perfect Hash Table: an implementation of a dynamic perfect hash table, extremely fast for lookup☆55Aug 16, 2026Updated 2 weeks ago