oertl / probminhash
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
- DartMinHash: Fast Sketching for Weighted Sets☆13Updated 4 years ago
- SetSketch: Filling the Gap between MinHash and HyperLogLog☆49Updated 3 years ago
- BagMinHash - Minwise Hashing Algorithm for Weighted Sets☆26Updated 4 years ago
- TreeMinHash: Fast Sketching for Weighted Jaccard Similarity Estimation☆14Updated 2 years ago
- COBS - Compact Bit-Sliced Signature Index (for Genomic k-Mer Data or q-Grams)☆84Updated last year
- Simple and fast MinHash implementation in C with Python wrapper☆13Updated 4 years ago
- Wavelet tree based on a fixed block boosting technique☆16Updated 3 years ago
- Implementation of a Backpack Quotient Filter☆11Updated 7 months ago
- A compressed, associative, exact, and weighted dictionary for k-mers.☆84Updated 5 months ago
- Fast and compact locality-preserving minimal perfect hashing for k-mer sets.☆43Updated last year
- BWT Text Indexing Library: a set of tools to work with BWT-based text indexes☆25Updated 2 years 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 11 years ago
- An optimal space run-length Burrows-Wheeler transform full-text index☆62Updated last year
- Rust implementation of probminhash, superminhash and hyperloglog sketching algorithms☆30Updated 6 months ago
- ☆20Updated 4 years ago
- Parallel Suffix Array, LCP Array, and Suffix Tree Construction☆49Updated 5 years ago
- 🔶 Compressed bitvector/container supporting efficient random access and rank queries☆43Updated 6 months ago
- Run-length compressed BWT with LZ77 sampled suffix array☆10Updated 2 years ago
- C++ Implementations of sketch data structures with SIMD Parallelism, including Python bindings☆153Updated 7 months ago
- Fast and cache-efficient full-text pangenome index☆27Updated 2 weeks ago
- Bit packed vector of integral values☆27Updated last month
- Online construction of run-length BWT (RLBWT) and r-index. Plus, online LZ77 parsing based on RLBWT.☆15Updated 6 years ago
- ☆13Updated 5 years ago
- FM-Index full-text index implementation using RRR Wavelet trees (libcds) and fast suffix sorting (libdivsufsort) including experimental r…☆105Updated 10 years ago
- memory mapped multimap, multiset, and implicit interval tree based on an in-place parallel sort☆27Updated 4 years ago
- Relative data structures based on the BWT☆12Updated 6 years ago
- Compact Tree Representation☆16Updated 8 years ago
- ☆12Updated last year
- ☆10Updated last year
- R-Index-F Library for Pattern Matching☆13Updated 7 months ago