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☆43Updated 4 years ago
- ☆20Updated 5 years ago
- DartMinHash: Fast Sketching for Weighted Sets☆13Updated 4 years ago
- 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
- TreeMinHash: Fast Sketching for Weighted Jaccard Similarity Estimation☆14Updated last month
- SetSketch: Filling the Gap between MinHash and HyperLogLog☆49Updated 4 years ago
- Run-length compressed BWT with LZ77 sampled suffix array☆11Updated 3 years ago
- dynamic-updateable-index☆11Updated 9 years ago
- FM-index representation of a de Bruijn graph☆27Updated 8 years ago
- COBS - Compact Bit-Sliced Signature Index (for Genomic k-Mer Data or q-Grams)☆84Updated last year
- Simple and fast MinHash implementation in C with Python wrapper☆13Updated last month
- ☆10Updated 3 years ago
- Performs memory-efficient reservoir sampling on very large input files delimited by newlines☆69Updated 5 years ago
- An optimal space run-length Burrows-Wheeler transform full-text index☆67Updated 2 years ago
- Online material and code base for the article Coordinates and Intervals in Graph Based Reference Genomes☆11Updated 8 years ago
- Wavelet tree based on a fixed block boosting technique☆16Updated 4 years ago
- Mantis: A Fast, Small, and Exact Large-Scale Sequence-Search Index☆81Updated last year
- Relative data structures based on the BWT☆12Updated 7 years ago
- ☆14Updated 5 years ago
- C++ Implementations of sketch data structures with SIMD Parallelism, including Python bindings☆155Updated last year
- Minhash Index Extended to Knead Kmer Intersection☆11Updated 5 years ago
- Sequence Distance Graph framework: graph + reads + mapping + analysis☆26Updated 3 years ago
- Practical Dynamic de Bruijn Graphs☆18Updated 4 years ago
- LogLog space version of MinHash by combining ideas from HyperLogLog and b-bit MinHash☆57Updated 5 years ago
- An experimental tool to find approximate max-cuts in a large graph☆11Updated 4 years ago
- A fast, AVX2 and ARM Neon accelerated FM index library☆34Updated 8 months ago
- FM-Index full-text index implementation using RRR Wavelet trees (libcds) and fast suffix sorting (libdivsufsort) including experimental r…☆107Updated 10 years ago
- Implementation of a Backpack Quotient Filter☆12Updated last month
- A tool for merging large BWTs☆26Updated 4 years ago
- Ultra fast MSD radix sorter☆11Updated 5 years ago