oertl / treeminhashLinks
TreeMinHash: Fast Sketching for Weighted Jaccard Similarity Estimation
☆14Updated 2 years ago
Alternatives and similar repositories for treeminhash
Users that are interested in treeminhash are comparing it to the libraries listed below
Sorting:
- BagMinHash - Minwise Hashing Algorithm for Weighted Sets☆26Updated 4 years ago
- ProbMinHash – A Class of Locality-Sensitive Hash Algorithms for the (Probability) Jaccard Similarity☆42Updated 4 years ago
- DartMinHash: Fast Sketching for Weighted Sets☆13Updated 4 years ago
- SetSketch: Filling the Gap between MinHash and HyperLogLog☆49Updated 3 years ago
- External memory suffix array construction using inducing☆11Updated 4 years ago
- A locality-sensitive hashing library☆46Updated 11 years ago
- Parameterless and Universal FInding of Nearest Neighbors☆60Updated 2 months ago
- Implementation of QuadSketch algorithm☆11Updated 2 years ago
- SRS - Fast Approximate Nearest Neighbor Search in High Dimensional Euclidean Space With a Tiny Index☆55Updated 10 years ago
- A fast high dimensional near neighbor search algorithm based on group testing and locality sensitive hashing☆23Updated last year
- This program implements the following graph reordering technique: Laxman Dhulipala, Igor Kabiljo, Brian Karrer, Giuseppe Ottaviano, Serg…☆10Updated 6 years ago
- Optimal partitioning of Variable-Byte codes for better compression and fast decoding.☆17Updated 3 years ago
- To Index or Not to Index: Optimizing Exact Maximum Inner Product Search☆26Updated 6 years ago
- Online construction of run-length BWT (RLBWT) and r-index. Plus, online LZ77 parsing based on RLBWT.☆15Updated 7 years ago
- Compact Tree Representation☆16Updated 8 years ago
- An efficient external-memory algorithm for the construction of minimal perfect hash functions☆63Updated last year
- High Dimensional Approximate Near(est) Neighbor☆33Updated 7 years ago
- Code used for the experiments in the paper "Partitioned Elias-Fano Indexes"☆40Updated 10 years ago
- C library to compute the Hamming weight of arrays☆46Updated 6 years ago
- 🔶 Compressed bitvector/container supporting efficient random access and rank queries☆43Updated 9 months ago
- Source code for the Shifted Hamming Distance (SHD) filtering mechanism for sequence alignment. Described in the Bioinformatics journal pa…☆35Updated 5 years ago
- 🌳 A compressed rank/select dictionary exploiting approximate linearity and repetitiveness.☆11Updated 2 years ago
- Implementation of many similarity join algorithms.☆15Updated 11 years ago
- A fast approximate membership query data structure☆11Updated 10 months ago
- A C++ library implementing fast language models estimation using the 1-Sort algorithm.☆17Updated 2 years ago
- A C++ library to benchmark inverted indexes.☆20Updated 4 years ago
- A SIMD-based C++ library providing rank/select queries over mutable bitmaps.☆35Updated 2 years ago
- Interleaving bits from two sources using SIMD instructions.☆14Updated 7 years ago
- Fast implementations of the scancount algorithm: C++ header-only library☆26Updated 5 years ago
- ☆20Updated 4 years ago