bloom-filters
JS implementation of probabilistic data structures: Bloom Filter (and its derived), HyperLogLog, Count-Min Sketch, Top-K and MinHash
JS implementation of probabilistic data structures: Bloom Filter (and its derived), HyperLogLog, Count-Min Sketch, Top-K and MinHash
Find similar documents quickly
Locality-Sensitive Hashing implementation in node.js for fast and scalable approximate nearest neighbors search
Command Line tool that compares two text files using minhash
tools for comparing biological sequences with k-mer sketches
A small toolbox for working with ECFP.
MinHash and LSH in JavaScript (Datasketch implementation)