oertl / probminhashLinks
ProbMinHash – A Class of Locality-Sensitive Hash Algorithms for the (Probability) Jaccard Similarity
☆42Updated 4 years ago
Alternatives and similar repositories for probminhash
Users that are interested in probminhash are comparing it to the libraries listed below
Sorting:
- DartMinHash: Fast Sketching for Weighted Sets☆13Updated 4 years ago
- COBS - Compact Bit-Sliced Signature Index (for Genomic k-Mer Data or q-Grams)☆84Updated last year
- SetSketch: Filling the Gap between MinHash and HyperLogLog☆49Updated 3 years ago
- 📖 🧬 SSHash is a compressed, associative, exact, and weighted dictionary for k-mers.☆88Updated last week
- BagMinHash - Minwise Hashing Algorithm for Weighted Sets☆26Updated 4 years ago
- An optimal space run-length Burrows-Wheeler transform full-text index☆66Updated 2 years ago
- ☆20Updated 4 years ago
- Simple and fast MinHash implementation in C with Python wrapper☆13Updated 5 years ago
- Implementation of a Backpack Quotient Filter☆12Updated last week
- Wavelet tree based on a fixed block boosting technique☆16Updated 4 years ago
- Fast and compact locality-preserving minimal perfect hashing for k-mer sets.☆43Updated last year
- Smith-Waterman database searches with inter-sequence SIMD parallelisation☆60Updated last year
- FM-Index full-text index implementation using RRR Wavelet trees (libcds) and fast suffix sorting (libdivsufsort) including experimental r…☆107Updated 10 years ago
- Mantis: A Fast, Small, and Exact Large-Scale Sequence-Search Index☆81Updated last year
- Ultra fast MSD radix sorter☆11Updated 5 years ago
- TreeMinHash: Fast Sketching for Weighted Jaccard Similarity Estimation☆14Updated 2 years ago
- C++ Implementations of sketch data structures with SIMD Parallelism, including Python bindings☆155Updated 11 months ago
- ☆10Updated last year
- A tool for merging large BWTs☆26Updated 4 years ago
- Dynamic succinct/compressed data structures☆112Updated last year
- Implementation of eBWT using Prefix-free parse (PFP)☆14Updated 10 months ago
- BlastGraph is a new tool for computing intensive approximate pattern matching in a sequence graph or a de-Bruijn graph. Given an oriented…☆12Updated 12 years ago
- dynamic-updateable-index☆11Updated 9 years ago
- ☆14Updated 5 years ago
- LogLog space version of MinHash by combining ideas from HyperLogLog and b-bit MinHash☆56Updated 5 years ago
- ☆10Updated 4 years ago
- Source code for the Shifted Hamming Distance (SHD) filtering mechanism for sequence alignment. Described in the Bioinformatics journal pa…☆35Updated 5 years ago
- An experimental tool to find approximate max-cuts in a large graph☆11Updated 4 years ago
- External memory suffix array construction using inducing☆11Updated 4 years ago
- memory mapped multimap, multiset, and implicit interval tree based on an in-place parallel sort☆27Updated 4 years ago