dnbaker / sketchLinks
C++ Implementations of sketch data structures with SIMD Parallelism, including Python bindings
☆155Updated 11 months ago
Alternatives and similar repositories for sketch
Users that are interested in sketch are comparing it to the libraries listed below
Sorting:
- SetSketch: Filling the Gap between MinHash and HyperLogLog☆49Updated 3 years ago
- Succinct Data Structure Library 3.0☆94Updated 2 months ago
- Dynamic succinct/compressed data structures☆112Updated last year
- COBS - Compact Bit-Sliced Signature Index (for Genomic k-Mer Data or q-Grams)☆84Updated last year
- An optimal space run-length Burrows-Wheeler transform full-text index☆65Updated 2 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
- Parallel Suffix Array, LCP Array, and Suffix Tree Construction☆49Updated 5 years ago
- 📖 🧬 SSHash is a compressed, associative, exact, and weighted dictionary for k-mers.☆88Updated this week
- A General-Purpose Counting Filter: Counting Quotient Filter☆127Updated last year
- 🔶 Compressed bitvector/container supporting efficient random access and rank queries☆43Updated 10 months ago
- Bloom-filter based minimal perfect hash function library☆265Updated 2 years ago
- compressed, queryable variation graphs☆11Updated 10 years ago
- Mantis: A Fast, Small, and Exact Large-Scale Sequence-Search Index☆81Updated last year
- Paper about the estimation of cardinalities from HyperLogLog sketches☆62Updated 4 years ago
- A tool for merging large BWTs☆26Updated 4 years ago
- Parallel Wavelet Tree and Wavelet Matrix Construction☆26Updated 2 years ago
- BWT Text Indexing Library: a set of tools to work with BWT-based text indexes☆25Updated 3 years ago
- Succinct Data Structure Library☆106Updated 11 years ago
- Prefix Filter: Practically and Theoretically Better Than Bloom.☆48Updated 2 years ago
- ProbMinHash – A Class of Locality-Sensitive Hash Algorithms for the (Probability) Jaccard Similarity☆42Updated 4 years ago
- An efficient external-memory algorithm for the construction of minimal perfect hash functions☆64Updated last year
- Compact Data Structures Library☆126Updated 10 years ago
- Wavelet tree based on a fixed block boosting technique☆16Updated 4 years ago
- DartMinHash: Fast Sketching for Weighted Sets☆13Updated 4 years ago
- In-place Parallel Super Scalar Radix Sort (IPS²Ra)☆32Updated 5 months ago
- Relative data structures based on the BWT☆12Updated 7 years ago
- BagMinHash - Minwise Hashing Algorithm for Weighted Sets☆26Updated 4 years ago
- Compact Data Structures Library☆100Updated 3 years ago
- External memory suffix array construction using inducing☆11Updated 4 years ago
- An alignment-free, reference-free and incremental data structure for colored de Bruijn graph with application to pan-genome indexing.☆44Updated 3 years ago