An efficient external-memory algorithm for the construction of minimal perfect hash functions
☆66May 29, 2024Updated last year
Alternatives and similar repositories for emphf
Users that are interested in emphf are comparing it to the libraries listed below
Sorting:
- Implementation of the data structures described in the paper "Fast Compressed Tries using Path Decomposition".☆58Jan 27, 2023Updated 3 years ago
- A collection of succinct data structures☆213Jan 3, 2024Updated 2 years ago
- Run-length compressed BWT with LZ77 sampled suffix array☆10Apr 25, 2022Updated 3 years ago
- FOundation of stXXl and thriLL☆14Jan 24, 2024Updated 2 years ago
- C Minimal Perfect Hashing Library☆88Mar 2, 2017Updated 8 years ago
- Bloom-filter based minimal perfect hash function library☆276Jul 16, 2025Updated 7 months ago
- Dynamic succinct/compressed data structures☆116Dec 17, 2025Updated 2 months ago
- NetBSD cdb (constant database) library☆14May 24, 2019Updated 6 years ago
- Tiny perfect hash library for C, C++, and Lua☆171Feb 19, 2019Updated 7 years ago
- MAW: a suite on the computation and application of Minimal Absent Words☆16Nov 1, 2021Updated 4 years ago
- ☆14Feb 7, 2020Updated 6 years ago
- Zero-inflated mixture model for single-cell data.☆14Feb 16, 2016Updated 10 years ago
- Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences☆15Aug 7, 2018Updated 7 years ago
- Compact tries for fixed-width keys☆26Jun 4, 2018Updated 7 years ago
- A library of inverted index data structures☆151Dec 15, 2022Updated 3 years ago
- Implementation of the JSON semi-index described in the paper "Semi-Indexing Semi-Structured Data in Tiny Space"☆58Dec 7, 2012Updated 13 years ago
- This repository is retired software☆14Oct 29, 2015Updated 10 years ago
- Highly optimized implementation of tiered vectors, a data structure for maintaining a sequence of n elements supporting access in time O(…☆50Apr 19, 2024Updated last year
- Sux4J is an effort to bring succinct data structures to Java.☆171Jun 22, 2025Updated 8 months ago
- Morally-correct string and stream interpolation for Go.☆24Apr 23, 2016Updated 9 years ago
- haesni is a small hash function using aes-ni for fast string hashing☆19Oct 6, 2018Updated 7 years ago
- Compact Data Structures Library☆128Sep 4, 2014Updated 11 years ago
- Succinct Data Structure Library☆109Sep 26, 2013Updated 12 years ago
- Code used for the experiments in the paper "Partitioned Elias-Fano Indexes"☆40Jan 31, 2015Updated 11 years ago
- Wiki form of BLAST documentation from NCBI☆16Feb 21, 2017Updated 9 years ago
- Fast Hash Functions Using AES Intrinsics☆85Aug 12, 2019Updated 6 years ago
- LLVM-jitted bitmaps☆27Apr 23, 2020Updated 5 years ago
- C++ library for analysing and storing large-scale cohorts of sequence variant data☆17Aug 27, 2019Updated 6 years ago
- Support for ternary logic in SSE, XOP, AVX2 and x86 programs☆31Jan 5, 2025Updated last year
- Compressed Bloom Filters (Golomb-compressed sequences, with indices)☆17May 19, 2013Updated 12 years ago
- Genevieve client: using GenNotes, report ClinVar for individual genomes & add consensus notes☆10Aug 2, 2016Updated 9 years ago
- An optimal space run-length Burrows-Wheeler transform full-text index☆68May 31, 2023Updated 2 years ago
- LSM-trie☆115Mar 22, 2021Updated 4 years ago
- Metrics gathering thingy☆11Jul 17, 2019Updated 6 years ago
- SUPBUB is a tool that, in linear time, finds out superbubbles(special graph-structures) in a directed graph.☆12Sep 19, 2019Updated 6 years ago
- A splaytree ADT written in C with a BSD license☆18Jun 18, 2020Updated 5 years ago
- Feed-forward Bloom filters☆53Jun 7, 2011Updated 14 years ago
- Implementation of eBWT using Prefix-free parse (PFP)☆14Jul 14, 2025Updated 7 months ago
- BlastGraph is a new tool for computing intensive approximate pattern matching in a sequence graph or a de-Bruijn graph. Given an oriented…☆12May 9, 2013Updated 12 years ago