similarity search and clustering algorithms for time-series represented as euclidean polygonal curves
-
Updated
May 28, 2023 - C++
similarity search and clustering algorithms for time-series represented as euclidean polygonal curves
HSEARCH: fast and accurate protein sequence motif search and clustering
Long Reads Mapping Algorithms
approximation algorithms for exact nearest neighbors search and clustering on multi-dimensional vectors
local sensitive hash, Traveling Salesman Problem, Kevin Bacon Game, Genetic Algorithm
Point-to-Hyperplane NNS Beyond the Unit Hypersphere (SIGMOD 2021)
ANN - Approximate Nearest Neighbors Index with Locality Sensitive Hashing and Hyper Cube projections for vectors and multi-dimensional data.
C++ implementation of Locality-Sensitive Hashing over txt documents, using Jaccard Similarity.
Query-Aware LSH for Approximate NNS (In-Memory Version of QALSH)
Nearest neighbor search. Methods: LSH, hypercube, and exhaustive search. C++
C++ program that, given a vectorised dataset and query set, performs locality sensitive hashing, finding either Nearest Neighbour (NN) or Neighbours in specified range of points in query set, using either Euclidian distance or Cosine Similarity.
Generate kmers/minimizers/hashes/MinHash signatures, including with multiple kmer sizes.
Software for exploration of gene expression data from single-cell RNA sequencing.
A fast high dimensional near neighbor search algorithm based on group testing and locality sensitive hashing
TreeMinHash: Fast Sketching for Weighted Jaccard Similarity Estimation
ProbMinHash – A Class of Locality-Sensitive Hash Algorithms for the (Probability) Jaccard Similarity
SetSketch: Filling the Gap between MinHash and HyperLogLog
BagMinHash - Minwise Hashing Algorithm for Weighted Sets
Add a description, image, and links to the locality-sensitive-hashing topic page so that developers can more easily learn about it.
To associate your repository with the locality-sensitive-hashing topic, visit your repo's landing page and select "manage topics."