MinHash, LSH, LSH Forest, Weighted MinHash, HyperLogLog, HyperLogLog++, LSH Ensemble and HNSW
-
Updated
Aug 9, 2026 - Python
MinHash, LSH, LSH Forest, Weighted MinHash, HyperLogLog, HyperLogLog++, LSH Ensemble and HNSW
Quickly search, compare, and analyze genomic and metagenomic data sets.
JS implementation of probabilistic data structures: Bloom Filter (and its derived), HyperLogLog, Count-Min Sketch, Top-K and MinHash
High-performance MinHash implementation in Rust with Python bindings for efficient similarity estimation and deduplication of large datasets
Locality Sensitive Hashing using MinHash in Python/Cython to detect near duplicate text documents
Dynatrace hash library for Java
C++ Implementations of sketch data structures with SIMD Parallelism, including Python bindings
Sketching Algorithms for Clojure (bloom filter, min-hash, hyper-loglog, count-min sketch)
Weighted MinHash implementation on CUDA (multi-gpu).
Detect and visualize text reuse
Locality Sensitive Hashing
A Clojure library for querying large data-sets on similarity
Elasticsearch plugin for b-bit minhash algorism
A resistome profiler for Graphing Resistance Out Of meTagenomes
Quickly estimate the similarity between many sets
SetSketch: Filling the Gap between MinHash and HyperLogLog
ProbMinHash – A Class of Locality-Sensitive Hash Algorithms for the (Probability) Jaccard Similarity
Genomic neighbor typing of bacterial pathogens using MinHash 🐀
To associate your repository with the minhash topic, visit your repo's landing page and select "manage topics."