Prefix Filter: Practically and Theoretically Better Than Bloom.
☆48Sep 12, 2022Updated 3 years ago
Alternatives and similar repositories for Prefix-Filter
Users that are interested in Prefix-Filter are comparing it to the libraries listed below
Sorting:
- A fast approximate membership query data structure☆12Jul 16, 2024Updated last year
- A SIMD-based C++ library providing rank/select queries over mutable bitmaps.☆36Jan 8, 2023Updated 3 years ago
- ☆20Aug 18, 2020Updated 5 years ago
- ☆16Mar 16, 2021Updated 4 years ago
- Static Huffman coding☆10Apr 3, 2017Updated 8 years ago
- Optimal distance lower bound k-mer sampling.☆12Jun 19, 2024Updated last year
- Bumped Ribbon Retrieval and Approximate Membership Query☆51Jun 16, 2025Updated 8 months ago
- High-speed Bloom filters and taffy filters for C, C++, and Java☆35Aug 9, 2023Updated 2 years ago
- Simulate mutations in genomes☆15Jun 15, 2020Updated 5 years ago
- 📖 🧬 SSHash is a compressed, associative, exact, and weighted dictionary for k-mers.☆93Updated this week
- Code for the paper Succinct k-mer Set Representations Using Subset Rank Queries on the Spectral Burrows-Wheeler Transform (SBWT)☆24Mar 13, 2025Updated 11 months ago
- BC-Tree and Ball-Tree for Point-to-Hyperplane NNS (ICDE 2023)☆18Aug 4, 2023Updated 2 years ago
- ☆18Nov 21, 2024Updated last year
- Validation of sycnmers compared to minimizers☆11May 10, 2025Updated 9 months ago
- Artisanal 🤣 bioinformatics tools and pipelines in Scala☆20Jan 28, 2020Updated 6 years ago
- A four-dimensional Analysis of Partitioned Approximate Filters☆11Aug 6, 2025Updated 6 months ago
- Fast Approximate Membership Filters (C++)☆289Aug 29, 2025Updated 6 months ago
- Fast, Cache-Efficient, and Scalable Queries on Pangenomes☆36Nov 7, 2025Updated 3 months ago
- A reimplementation of the WaveFront Alignment algorithm at low memory☆50May 22, 2024Updated last year
- Iterate k-min-mers from a DNA sequence in Rust☆13Apr 8, 2024Updated last year
- Bit packed vector of integral values☆29Jan 28, 2025Updated last year
- ☆14Feb 19, 2026Updated last week
- A (Minimal) Perfect Hash Function based on irregular cuckoo hashing, retrieval, and overloading.☆21Sep 30, 2025Updated 5 months ago
- ProphAsm – a rapid computation of simplitigs directly from k-mer sets☆25Feb 17, 2023Updated 3 years ago
- Reference implementations of minimizer schemes to go with the mod-minimizers paper.☆28Apr 24, 2025Updated 10 months ago
- Fast and compact locality-preserving minimal perfect hashing for k-mer sets.☆43Nov 18, 2023Updated 2 years ago
- COllapsed and COmpressed trie: a data-aware compressed string dictionary☆36Feb 15, 2025Updated last year
- A minimal copy fastq and fasta reader built for parallel support and paired end processing☆42Jan 9, 2026Updated last month
- TSXor: A Simple Time Series Compression Algorithm☆53Feb 19, 2025Updated last year
- Benchmarking Bloom, Cuckoo, Morton, and PD based filter.☆15Mar 19, 2022Updated 3 years ago
- A Benchmark of Minimal Perfect Hash Function Algorithms.☆38Dec 20, 2022Updated 3 years ago
- ⚡️ 🧬 Fulgor is a fast and space-efficient colored de Bruijn graph index.☆59Updated this week
- Minimum plain text representation of kmer sets☆16Jan 30, 2025Updated last year
- ☆21Dec 26, 2025Updated 2 months ago
- RemixDB: A read- and write-optimized concurrent KV store. Fast point and range queries. Extremely low write-amplification.☆102Mar 30, 2023Updated 2 years ago
- FMSI is a highly memory efficient exact k-mer set index based on masked superstrings and the masked Burrows-Wheeler transform☆23Nov 20, 2025Updated 3 months ago
- C implementation of a compressed trie lookup map☆23May 14, 2019Updated 6 years ago
- simd enabled column imprints☆11Feb 12, 2018Updated 8 years ago
- ✈️ PTHash is a fast and compact minimal perfect hash function.☆251Nov 10, 2025Updated 3 months ago