Bloom-filter based minimal perfect hash function library
☆280Jul 16, 2025Updated 11 months ago
Alternatives and similar repositories for BBHash
Users that are interested in BBHash 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 hash map using the BooPHF perfect hash function☆13Sep 25, 2016Updated 9 years ago
- SIMD-parallel BLAST X-drop DP on sequence graphs☆24May 30, 2024Updated 2 years ago
- Sequence Bloom Trees with All/Some split☆11Oct 30, 2018Updated 7 years ago
- Self-contained, multi-threaded fasta/q parser☆50Mar 10, 2026Updated 3 months ago
- semi-reference-based short read compression☆11Mar 5, 2019Updated 7 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.
- Fast and compact locality-preserving minimal perfect hashing for k-mer sets.☆44Nov 18, 2023Updated 2 years ago
- COBS - Compact Bit-Sliced Signature Index (for Genomic k-Mer Data or q-Grams)☆89Jan 25, 2024Updated 2 years ago
- ☆24Apr 2, 2021Updated 5 years ago
- Squeakr: An Exact and Approximate k -mer Counting System☆86Feb 23, 2025Updated last year
- Generate kmers/minimizers/hashes/MinHash signatures, including with multiple kmer sizes.☆24Jan 9, 2021Updated 5 years ago
- Simple succinct data structures (in Rust)☆55Apr 18, 2026Updated 2 months ago
- a toolset for fast DNA read set matching and assembly using a new type of reduced kmer☆36Aug 4, 2021Updated 4 years ago
- An efficient external-memory algorithm for the construction of minimal perfect hash functions☆66May 29, 2024Updated 2 years ago
- Dynamic succinct/compressed data structures☆118Dec 17, 2025Updated 6 months ago
- GPU virtual machines on DigitalOcean Gradient AI • AdGet to production fast with high-performance AMD and NVIDIA GPUs you can spin up in seconds. The definition of operational simplicity.
- Practical Dynamic de Bruijn Graphs☆18Oct 1, 2020Updated 5 years ago
- A tool for merging large BWTs☆23Nov 26, 2020Updated 5 years ago
- Refinements of the WFA alignment algorithm with better complexity☆26Mar 31, 2022Updated 4 years ago
- Next Index to Query Kmer Intersection☆17Feb 1, 2023Updated 3 years ago
- ✈️ PTHash is a fast and compact minimal perfect hash function.☆261May 6, 2026Updated last month
- Classify sequencing reads using MinHash.☆48Apr 6, 2020Updated 6 years ago
- A SIMD-based C++ library providing rank/select queries over mutable bitmaps.☆36Jan 8, 2023Updated 3 years ago
- Mantis: A Fast, Small, and Exact Large-Scale Sequence-Search Index☆87Mar 7, 2024Updated 2 years ago
- 📖 🧬 SSHash is a compressed, associative, exact, and weighted dictionary for k-mers.☆103May 6, 2026Updated last month
- 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 succinct colored dBG representation☆12Sep 11, 2018Updated 7 years ago
- LogLog space version of MinHash by combining ideas from HyperLogLog and b-bit MinHash☆57Feb 19, 2020Updated 6 years ago
- Contains the description of a file format to store kmers and associated values☆34Aug 17, 2022Updated 3 years ago
- Cache-friendly, Parallel, and Samplesort-based Constructor for Suffix Arrays and LCP Arrays☆19Jun 23, 2025Updated last year
- vector illustrations of BWT based searching on small strings☆16Apr 29, 2019Updated 7 years ago
- Implicit Interval Tree with Interpolation Index☆43Jul 13, 2022Updated 3 years ago
- Ococo: the first online variant and consensus caller. Call genomic consensus directly from an unsorted SAM/BAM stream.☆46Jan 18, 2019Updated 7 years ago
- Code accompanying the publication for compressed graph annotation☆13Feb 14, 2019Updated 7 years ago
- Optimal distance lower bound k-mer sampling.☆12Jun 19, 2024Updated 2 years ago
- GPU virtual machines on DigitalOcean Gradient AI • AdGet to production fast with high-performance AMD and NVIDIA GPUs you can spin up in seconds. The definition of operational simplicity.
- An efficient index for the colored, compacted, de Bruijn graph☆112Jun 19, 2026Updated last week
- BWT-based index for graphs☆73Mar 12, 2025Updated last year
- FM-index representation of a de Bruijn graph☆26Aug 7, 2017Updated 8 years ago
- Low memory multithreaded hash table☆24Mar 23, 2015Updated 11 years ago
- dynamic-updateable-index☆11Nov 10, 2015Updated 10 years ago
- A reimplementation of the WaveFront Alignment algorithm at low memory☆51May 22, 2024Updated 2 years ago
- Suite of universal indexes for Highly Repetitive Document Collections☆24May 14, 2020Updated 6 years ago