Long Reads Mapping Algorithms
-
Updated
Mar 14, 2018 - C++
Long Reads Mapping Algorithms
local sensitive hash, Traveling Salesman Problem, Kevin Bacon Game, Genetic Algorithm
similarity search and clustering algorithms for time-series represented as euclidean polygonal curves
ANN - Approximate Nearest Neighbors Index with Locality Sensitive Hashing and Hyper Cube projections for vectors and multi-dimensional data.
HSEARCH: fast and accurate protein sequence motif search and clustering
approximation algorithms for exact nearest neighbors search and clustering on multi-dimensional vectors
C++ implementation of Locality-Sensitive Hashing over txt documents, using Jaccard Similarity.
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.
Point-to-Hyperplane NNS Beyond the Unit Hypersphere (SIGMOD 2021)
TreeMinHash: Fast Sketching for Weighted Jaccard Similarity Estimation
Query-Aware LSH for Approximate NNS (In-Memory Version of QALSH)
A fast high dimensional near neighbor search algorithm based on group testing and locality sensitive hashing
Generate kmers/minimizers/hashes/MinHash signatures, including with multiple kmer sizes.
BagMinHash - Minwise Hashing Algorithm for Weighted Sets
Query-Aware LSH for Approximate NNS (PVLDB 2015 and VLDBJ 2017)
Software for exploration of gene expression data from single-cell RNA sequencing.
ProbMinHash – A Class of Locality-Sensitive Hash Algorithms for the (Probability) Jaccard Similarity
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."