A Benchmark of Minimal Perfect Hash Function Algorithms.
☆39Dec 20, 2022Updated 3 years ago
Alternatives and similar repositories for mphf_benchmark
Users that are interested in mphf_benchmark are comparing it to the libraries listed below. We may earn a commission when you buy through links labeled 'Ad' on this page.
Sorting:
- ✈️ PTHash is a fast and compact minimal perfect hash function.☆270Jul 27, 2026Updated 3 months ago
- Implementation of the u-index☆12Jul 19, 2025Updated last year
- Optimal distance lower bound k-mer sampling.☆12Jun 19, 2024Updated 2 years ago
- Fast Approximate Pattern Matching using Search Schemes☆20Jul 11, 2026Updated 3 months ago
- ☆14Jul 30, 2026Updated 3 months ago
- Virtual machines for every use case on DigitalOcean • AdGet dependable uptime with 99.99% SLA, simple security tools, and predictable monthly pricing with DigitalOcean's virtual machines, called Droplets.
- Rust libraries and programs focused on succinct data structures☆173Updated this week
- A (Minimal) Perfect Hash Function based on irregular cuckoo hashing, retrieval, and overloading.☆20Sep 30, 2025Updated last year
- Hardware go brrr bounded context suffix array construction algorithm☆20Nov 1, 2023Updated 3 years ago
- Benchmark data structures for kmer sets.☆13Aug 29, 2026Updated 2 months ago
- A small, auxiliary index to massively improve parallel fastq parsing☆32Mar 6, 2026Updated 7 months ago
- Fast and compact locality-preserving minimal perfect hashing for k-mer sets.☆44Nov 18, 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
- Prefix Filter: Practically and Theoretically Better Than Bloom.☆50Sep 12, 2022Updated 4 years ago
- Rust implementations of succinct data structures☆80Updated this week
- 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 SIMD-based C++ library providing rank/select queries over mutable bitmaps.☆36Jan 8, 2023Updated 3 years ago
- kmer-counter☆19Updated this week
- Reference implementations of minimizer schemes to go with the mod-minimizers paper.☆29Jul 12, 2026Updated 3 months ago
- 📖 🧬 SSHash is a compressed, associative, exact, and weighted dictionary for k-mers.☆108Oct 24, 2026Updated last week
- 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
- Collection of succinct data structures in Rust☆108Oct 25, 2026Updated last week
- Bumped Ribbon Retrieval and Approximate Membership Query☆52Sep 13, 2026Updated last month
- Learned Monotone Minimal Perfect Hashing☆32Sep 13, 2026Updated last month
- Bitpacked sequence trait and implementation☆19Oct 26, 2026Updated last week
- 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.
- Iterate over minimizers of a DNA sequence☆34Jul 12, 2024Updated 2 years ago
- An efficient minimal perfect hash function generator for small sets☆12Dec 12, 2020Updated 5 years ago
- String map implementation through Fast Succinct Trie☆24Jul 9, 2021Updated 5 years ago
- Static Huffman coding☆10Apr 3, 2017Updated 9 years ago
- DartMinHash: Fast Sketching for Weighted Sets☆12Dec 8, 2025Updated 10 months ago
- Compressed, associative, and exact hash table for k-mers☆11Oct 15, 2026Updated 2 weeks ago
- A cheatsheet for most common Stringology tasks☆14Apr 14, 2021Updated 5 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
- Managed Kubernetes at scale on DigitalOcean • AdDigitalOcean Kubernetes includes the control plane, bandwidth allowance, container registry, automatic updates, and more for free.
- Cache-friendly, Parallel, and Samplesort-based Constructor for Suffix Arrays and LCP Arrays☆20Jun 23, 2025Updated last year
- A C++ library implementing fast language models estimation using the 1-Sort algorithm.☆16May 18, 2023Updated 3 years ago
- COllapsed and COmpressed trie: a data-aware compressed string dictionary☆36Apr 9, 2026Updated 6 months ago
- Contains the description of a file format to store kmers and associated values☆34Aug 17, 2022Updated 4 years ago
- Bloom-filter based minimal perfect hash function library☆281Jul 16, 2025Updated last year
- ☆15Updated this week
- ☆15Oct 22, 2026Updated last week