oertl / bagminhashLinks
BagMinHash - Minwise Hashing Algorithm for Weighted Sets
☆26Updated 5 years ago
Alternatives and similar repositories for bagminhash
Users that are interested in bagminhash are comparing it to the libraries listed below
Sorting:
- ProbMinHash – A Class of Locality-Sensitive Hash Algorithms for the (Probability) Jaccard Similarity☆44Updated 5 years ago
- ☆20Updated 5 years ago
- DartMinHash: Fast Sketching for Weighted Sets☆12Updated last month
- BlastGraph is a new tool for computing intensive approximate pattern matching in a sequence graph or a de-Bruijn graph. Given an oriented…☆12Updated 12 years ago
- SetSketch: Filling the Gap between MinHash and HyperLogLog☆48Updated 4 years ago
- LogLog space version of MinHash by combining ideas from HyperLogLog and b-bit MinHash☆57Updated 5 years ago
- dynamic-updateable-index☆11Updated 10 years ago
- ☆10Updated 3 years ago
- COBS - Compact Bit-Sliced Signature Index (for Genomic k-Mer Data or q-Grams)☆88Updated last year
- TreeMinHash: Fast Sketching for Weighted Jaccard Similarity Estimation☆17Updated 5 months ago
- Wavelet tree based on a fixed block boosting technique☆16Updated 4 years ago
- Simple and fast MinHash implementation in C with Python wrapper☆13Updated 5 months ago
- Performs memory-efficient reservoir sampling on very large input files delimited by newlines☆69Updated 5 years ago
- Mantis: A Fast, Small, and Exact Large-Scale Sequence-Search Index☆84Updated last year
- ☆14Updated 5 years ago
- Relative data structures based on the BWT☆12Updated 7 years ago
- An optimal space run-length Burrows-Wheeler transform full-text index☆66Updated 2 years ago
- Practical Dynamic de Bruijn Graphs☆18Updated 5 years ago
- Implementation of a Backpack Quotient Filter☆13Updated 6 months ago
- C++ Implementations of sketch data structures with SIMD Parallelism, including Python bindings☆157Updated last year
- Run-length compressed BWT with LZ77 sampled suffix array☆10Updated 3 years ago
- Sequence Distance Graph framework: graph + reads + mapping + analysis☆25Updated 3 years ago
- Fast and accurate set similarity estimation via containment min hash☆42Updated last year
- A tool for merging large BWTs☆24Updated 5 years ago
- A fast, AVX2 and ARM Neon accelerated FM index library☆36Updated last year
- An experimental tool to find approximate max-cuts in a large graph☆10Updated 4 years ago
- Fast and compact locality-preserving minimal perfect hashing for k-mer sets.☆43Updated 2 years ago
- Implementation for sGLMM (Sparse graph-structured linear mixed model)☆15Updated 2 years ago
- Minhash Index Extended to Knead Kmer Intersection☆11Updated 5 years ago
- Smith-Waterman database searches with inter-sequence SIMD parallelisation☆60Updated 2 years ago