oertl / probminhashLinks
ProbMinHash – A Class of Locality-Sensitive Hash Algorithms for the (Probability) Jaccard Similarity
☆44Updated 5 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☆12Updated last month
- COBS - Compact Bit-Sliced Signature Index (for Genomic k-Mer Data or q-Grams)☆88Updated 2 years ago
- BagMinHash - Minwise Hashing Algorithm for Weighted Sets☆26Updated 5 years ago
- 📖 🧬 SSHash is a compressed, associative, exact, and weighted dictionary for k-mers.☆92Updated last week
- SetSketch: Filling the Gap between MinHash and HyperLogLog☆48Updated 4 years ago
- ☆20Updated 5 years ago
- An optimal space run-length Burrows-Wheeler transform full-text index☆67Updated 2 years ago
- Implementation of a Backpack Quotient Filter☆13Updated 6 months ago
- Simple and fast MinHash implementation in C with Python wrapper☆13Updated 6 months ago
- 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 2 years ago
- A fast, AVX2 and ARM Neon accelerated FM index library☆36Updated last year
- Fast, Cache-Efficient, and Scalable Queries on Pangenomes☆36Updated 2 months ago
- ☆10Updated 3 years ago
- ☆10Updated last year
- Refinements of the WFA alignment algorithm with better complexity☆26Updated 3 years ago
- ☆14Updated 6 years ago
- Minhash Index Extended to Knead Kmer Intersection☆11Updated 5 years ago
- An experimental tool to find approximate max-cuts in a large graph☆10Updated 4 years ago
- Sequence Distance Graph framework: graph + reads + mapping + analysis☆25Updated 3 years ago
- FMSI is a highly memory efficient exact k-mer set index based on masked superstrings and the masked Burrows-Wheeler transform☆23Updated 2 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
- Code for the paper Aligning Distant Sequences to Graphs using Long Seed Sketches.☆13Updated 3 years ago
- Implicit Interval Tree with Interpolation Index☆42Updated 3 years ago
- Implementation of eBWT using Prefix-free parse (PFP)☆14Updated 6 months ago
- ☆24Updated 4 years ago
- Mantis: A Fast, Small, and Exact Large-Scale Sequence-Search Index☆85Updated last year
- Optimal distance lower bound k-mer sampling.☆12Updated last year
- FM-Index full-text index implementation using RRR Wavelet trees (libcds) and fast suffix sorting (libdivsufsort) including experimental r…☆108Updated 11 years ago
- Practical Dynamic de Bruijn Graphs☆18Updated 5 years ago