oertl / probminhashLinks
ProbMinHash – A Class of Locality-Sensitive Hash Algorithms for the (Probability) Jaccard Similarity
☆43Updated 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
- 📖 🧬 SSHash is a compressed, associative, exact, and weighted dictionary for k-mers.☆88Updated this week
- BagMinHash - Minwise Hashing Algorithm for Weighted Sets☆26Updated 5 years ago
- SetSketch: Filling the Gap between MinHash and HyperLogLog☆49Updated 4 years ago
- An optimal space run-length Burrows-Wheeler transform full-text index☆67Updated 2 years ago
- Wavelet tree based on a fixed block boosting technique☆16Updated 4 years ago
- Implementation of a Backpack Quotient Filter☆12Updated last month
- Fast and compact locality-preserving minimal perfect hashing for k-mer sets.☆43Updated last year
- Implementation of eBWT using Prefix-free parse (PFP)☆14Updated last month
- ☆20Updated 5 years ago
- FM-Index full-text index implementation using RRR Wavelet trees (libcds) and fast suffix sorting (libdivsufsort) including experimental r…☆107Updated 10 years ago
- Simple and fast MinHash implementation in C with Python wrapper☆13Updated last month
- A tool for merging large BWTs☆26Updated 4 years ago
- ☆10Updated 3 years ago
- Smith-Waterman database searches with inter-sequence SIMD parallelisation☆60Updated last year
- dynamic-updateable-index☆11Updated 9 years ago
- LogLog space version of MinHash by combining ideas from HyperLogLog and b-bit MinHash☆57Updated 5 years ago
- FM-index representation of a de Bruijn graph☆27Updated 8 years ago
- Ultra fast MSD radix sorter☆11Updated 5 years ago
- A fast, AVX2 and ARM Neon accelerated FM index library☆34Updated 8 months ago
- Fast and cache-efficient full-text pangenome index☆29Updated 2 weeks ago
- C++ Implementations of sketch data structures with SIMD Parallelism, including Python bindings☆155Updated last year
- Online construction of run-length BWT (RLBWT) and r-index. Plus, online LZ77 parsing based on RLBWT.☆15Updated 7 years ago
- ☆10Updated last year
- Efficient construction of the BWT using string compression☆18Updated 2 months ago
- An experimental tool to find approximate max-cuts in a large graph☆11Updated 4 years ago
- ☆14Updated 5 years ago
- Mantis: A Fast, Small, and Exact Large-Scale Sequence-Search Index☆81Updated last year
- Practical Dynamic de Bruijn Graphs☆18Updated 4 years ago