oertl / bagminhash
BagMinHash - Minwise Hashing Algorithm for Weighted Sets
☆26Updated 4 years ago
Alternatives and similar repositories for bagminhash
Users that are interested in bagminhash are comparing it to the libraries listed below
Sorting:
- DartMinHash: Fast Sketching for Weighted Sets☆13Updated 4 years ago
- ProbMinHash – A Class of Locality-Sensitive Hash Algorithms for the (Probability) Jaccard Similarity☆42Updated 4 years ago
- TreeMinHash: Fast Sketching for Weighted Jaccard Similarity Estimation☆14Updated 2 years ago
- ☆20Updated 4 years ago
- SetSketch: Filling the Gap between MinHash and HyperLogLog☆49Updated 3 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
- COBS - Compact Bit-Sliced Signature Index (for Genomic k-Mer Data or q-Grams)☆84Updated last year
- External memory suffix array construction using inducing☆11Updated 4 years ago
- Simple and fast MinHash implementation in C with Python wrapper☆13Updated 4 years ago
- Implementation of QuadSketch algorithm☆11Updated 2 years ago
- Prefix Filter: Practically and Theoretically Better Than Bloom.☆48Updated 2 years ago
- Parameterless and Universal FInding of Nearest Neighbors☆60Updated 2 months ago
- Minhash and maxhash library in Python, combining flexibility, expressivity, and performance.☆21Updated 5 months ago
- ☆18Updated 6 years ago
- Run-length compressed BWT with LZ77 sampled suffix array☆10Updated 3 years ago
- dynamic-updateable-index☆11Updated 9 years ago
- An alignment-free, reference-free and incremental data structure for colored de Bruijn graph with application to pan-genome indexing.☆43Updated 3 years ago
- Relative data structures based on the BWT☆12Updated 7 years ago
- C++ Implementations of sketch data structures with SIMD Parallelism, including Python bindings☆152Updated 9 months ago
- FM-index representation of a de Bruijn graph☆27Updated 7 years ago
- ☆12Updated last year
- Wavelet tree based on a fixed block boosting technique☆16Updated 4 years ago
- Compact Tree Representation☆16Updated 8 years ago
- Sequence Distance Graph framework: graph + reads + mapping + analysis☆25Updated 2 years ago
- An efficient external-memory algorithm for the construction of minimal perfect hash functions☆63Updated 11 months ago
- Online material and code base for the article Coordinates and Intervals in Graph Based Reference Genomes☆11Updated 8 years ago
- Minhash Index Extended to Knead Kmer Intersection☆11Updated 5 years ago
- A locality-sensitive hashing library☆46Updated 11 years ago
- Count-Min sketch-based approximate counting library☆45Updated this week
- Performs memory-efficient reservoir sampling on very large input files delimited by newlines☆69Updated 5 years ago