dynatrace-research / set-sketch-paperLinks
SetSketch: Filling the Gap between MinHash and HyperLogLog
☆48Updated 4 years ago
Alternatives and similar repositories for set-sketch-paper
Users that are interested in set-sketch-paper are comparing it to the libraries listed below
Sorting:
- C++ Implementations of sketch data structures with SIMD Parallelism, including Python bindings☆154Updated last year
- An optimal space run-length Burrows-Wheeler transform full-text index☆65Updated 2 years ago
- Dynamic succinct/compressed data structures☆111Updated 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
- ProbMinHash – A Class of Locality-Sensitive Hash Algorithms for the (Probability) Jaccard Similarity☆44Updated 5 years ago
- COBS - Compact Bit-Sliced Signature Index (for Genomic k-Mer Data or q-Grams)☆83Updated last year
- Parallel Suffix Array, LCP Array, and Suffix Tree Construction☆51Updated 6 years ago
- 🔶 Compressed bitvector/container supporting efficient random access and rank queries☆46Updated last year
- Compact Tree Representation☆16Updated 8 years ago
- Wavelet tree based on a fixed block boosting technique☆16Updated 4 years ago
- C++ Implementation of Zip Trees☆14Updated 2 years ago
- Online construction of run-length BWT (RLBWT) and r-index. Plus, online LZ77 parsing based on RLBWT.☆14Updated 7 years ago
- Succinct Data Structure Library 3.0☆95Updated 2 months ago
- 📖 🧬 SSHash is a compressed, associative, exact, and weighted dictionary for k-mers.☆89Updated this week
- Implementation of a Backpack Quotient Filter☆13Updated 3 months ago
- Parallel Wavelet Tree and Wavelet Matrix Construction☆25Updated 2 years ago
- DartMinHash: Fast Sketching for Weighted Sets☆12Updated 4 years ago
- Ultra fast MSD radix sorter☆11Updated 5 years ago
- Prefix Filter: Practically and Theoretically Better Than Bloom.☆48Updated 3 years ago
- A cheatsheet for most common Stringology tasks☆14Updated 4 years ago
- Rust implementation of probminhash, superminhash and hyperloglog sketching algorithms☆30Updated 4 months ago
- BagMinHash - Minwise Hashing Algorithm for Weighted Sets☆26Updated 5 years ago
- Bloom-filter based minimal perfect hash function library☆266Updated 3 months ago
- In-place Parallel Super Scalar Radix Sort (IPS²Ra)☆34Updated 9 months ago
- TreeMinHash: Fast Sketching for Weighted Jaccard Similarity Estimation☆16Updated 2 months ago
- An efficient external-memory algorithm for the construction of minimal perfect hash functions☆64Updated last year
- BWT Text Indexing Library: a set of tools to work with BWT-based text indexes☆25Updated 3 years ago
- ☆20Updated 5 years ago
- A General-Purpose Counting Filter: Counting Quotient Filter☆128Updated 2 years ago
- Implementation of eBWT using Prefix-free parse (PFP)☆14Updated 3 months ago