A fast and space-efficient pre-filter for querying very large collections of nucleotide sequences.
-
Updated
Dec 21, 2025 - C++
#
set-membership
Here are 10 public repositories matching this topic...
Optimized implementation of Cuckoo Filter: Practically Better Than Bloom.
-
Updated
Dec 2, 2025 - Go
A pure-Rust implementation of Bulletproofs using Ristretto.
-
Updated
Jan 1, 2021 - Rust
Haskell Implementation of Cuckoo Filters
-
Updated
Oct 21, 2021 - Haskell
This repo is for Distributed Set-Based Observers Using Diffusion Strategy
intersection strip zonotope set-membership zonotope-intersection set-based-estimation overapproximating intersection-of-zonotopes
-
Updated
Dec 17, 2020 - MATLAB
Comparison between different methods to simplify sequence data
-
Updated
Aug 24, 2023 - C++
Fast Bloom filter using 128-bit MurmurHash3 with double hashing using Kirsch-Mitzenmacher technique. Optimal parameters auto-calculated. Works in Node.js and browsers.
nodejs typescript bloom-filter space-efficient set-membership probabilistic-data-structure hash-function murmur-hash
-
Updated
Dec 15, 2025 - TypeScript
Cuckoo Filter is a thread safe probability filter that performs set membership tests.
-
Updated
Apr 30, 2019 - Java
Using OpenEvolve to optimize randomize algorithms for set membership and tasks in similar vein
-
Updated
Nov 15, 2025 - Python
ZK set membership proofs by Groth and Kohlweiss (eprint 2014/764)
-
Updated
Nov 20, 2025 - Rust
Improve this page
Add a description, image, and links to the set-membership topic page so that developers can more easily learn about it.
Add this topic to your repo
To associate your repository with the set-membership topic, visit your repo's landing page and select "manage topics."