yunwilliamyu / hyperminhashLinks
LogLog space version of MinHash by combining ideas from HyperLogLog and b-bit MinHash
☆57Updated 5 years ago
Alternatives and similar repositories for hyperminhash
Users that are interested in hyperminhash are comparing it to the libraries listed below
Sorting:
- ☆20Updated 4 years ago
- Fast and accurate set similarity estimation via containment min hash☆42Updated last year
- Sequence Distance Graph framework: graph + reads + mapping + analysis☆26Updated 3 years ago
- ☆12Updated 5 years ago
- Minhash Index Extended to Knead Kmer Intersection☆11Updated 5 years ago
- A graph-inspired data structure for determining likely chains of sequences from breadcrumbs of evidence☆17Updated 4 years ago
- Fast approximation of similarity for sets of very different sizes☆21Updated 3 years ago
- deBGR: An Efficient and Near-Exact Representation of the Weighted de Bruijn Graph☆30Updated 4 years ago
- DartMinHash: Fast Sketching for Weighted Sets☆13Updated 4 years ago
- Python and Rust library for loading, saving, and manipulating taxonomic trees☆37Updated last month
- toolkit for file system virtualisation of random access compressed FASTA, FAI, DICT & TWOBIT files☆22Updated 11 months ago
- ☆24Updated last year
- 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
- ☆10Updated 3 years ago
- Next Index to Query Kmer Intersection☆16Updated 2 years ago
- Implicit Interval Tree with Interpolation Index☆41Updated 3 years ago
- Practical Dynamic de Bruijn Graphs☆18Updated 4 years ago
- A fast, AVX2 and ARM Neon accelerated FM index library☆32Updated 7 months ago
- Fast and cache-efficient full-text pangenome index☆29Updated last week
- De Bruijn graph representation in low memory☆36Updated last year
- A fast constructor of the compressed de Bruijn graph from many genomes☆41Updated 5 months ago
- ☆14Updated 9 years ago
- Bonsai: Fast, flexible taxonomic analysis and classification☆71Updated last year
- ProbMinHash – A Class of Locality-Sensitive Hash Algorithms for the (Probability) Jaccard Similarity☆42Updated 4 years ago
- Space-efficient pseudoalignment with a colored de Bruijn graph☆53Updated 4 months ago
- Simple and fast MinHash implementation in C with Python wrapper☆13Updated 5 years ago
- SIMD-parallel BLAST X-drop DP on sequence graphs☆25Updated last year
- dynamic-updateable-index☆11Updated 9 years ago
- FM-index representation of a de Bruijn graph☆27Updated 7 years ago
- Mantis: A Fast, Small, and Exact Large-Scale Sequence-Search Index☆81Updated last year