✈️ PTHash is a fast and compact minimal perfect hash function.
☆264Jul 27, 2026Updated 2 weeks 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
- Fast and compact locality-preserving minimal perfect hashing for k-mer sets.☆44Nov 18, 2023Updated 2 years ago
- ⚙️🛠️ Essential C++ utilities.☆14Mar 9, 2026Updated 5 months ago
- A (Minimal) Perfect Hash Function based on irregular cuckoo hashing, retrieval, and overloading.☆20Sep 30, 2025Updated 10 months ago
- Serverless GPU API endpoints on Runpod - Get Bonus Credits • AdSkip the infrastructure headaches. Auto-scaling, pay-as-you-go, no-ops approach lets you focus on innovating your application.
- Towards Optimal-Space Minimal Perfect Hashing Beyond Brute-Force☆15Mar 31, 2025Updated last year
- PtrHash minimal perfect hash function☆101Jul 15, 2026Updated 3 weeks ago
- ☆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
- 1-Click AI Models by DigitalOcean Gradient • AdDeploy popular AI models on DigitalOcean Gradient GPU virtual machines with just a single click. Zero configuration with optimized deployments.
- A small, auxiliary index to massively improve parallel fastq parsing☆32Mar 6, 2026Updated 5 months ago
- Bumped Ribbon Retrieval and Approximate Membership Query☆51Jun 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 8 months ago
- ⚡️ 🧬 Fulgor is a fast and space-efficient colored de Bruijn graph index.☆60Updated this week
- A LaTeX package for drawing genetic construct pictograms using TikZ.☆11Jan 26, 2022Updated 4 years ago
- Rust libraries and programs focused on succinct data structures☆171Jul 29, 2026Updated last week
- 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
- Serverless GPU API endpoints on Runpod - Get Bonus Credits • AdSkip the infrastructure headaches. Auto-scaling, pay-as-you-go, no-ops approach lets you focus on innovating your application.
- the we-flyin WFA-guided ultralong tiling sequence aligner☆10May 13, 2021Updated 5 years ago
- Collection of succinct data structures in Rust☆105Jul 24, 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
- Rust implementations of succinct data structures☆73Jul 30, 2026Updated last week
- Iterate over minimizers of a DNA sequence☆33Jul 12, 2024Updated 2 years ago
- SAPLING: Suffix Array Piecewise Linear INdex for Genomics☆25Sep 1, 2020Updated 5 years ago
- Fast and Memory Efficient Genome Sketching via HyperLogLog, HyperMinHash, UltraLogLog and ExaLogLog☆22Jul 29, 2026Updated last week
- 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
- De Bruijn graph representation in low memory☆36Jul 6, 2024Updated 2 years ago
- Computes a constexpr (minimal) perfect hash function☆35Jul 12, 2026Updated 3 weeks ago
- 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 3 months ago
- Flash Perfect Hash Table: an implementation of a dynamic perfect hash table, extremely fast for lookup☆55Aug 17, 2023Updated 2 years ago