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:
- DartMinHash: Fast Sketching for Weighted Sets☆12Updated last month
- ☆20Updated 5 years ago
- Fast and accurate set similarity estimation via containment min hash☆42Updated last year
- Minhash Index Extended to Knead Kmer Intersection☆11Updated 5 years ago
- Sequence Distance Graph framework: graph + reads + mapping + analysis☆25Updated 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
- Simple and fast MinHash implementation in C with Python wrapper☆13Updated 5 months ago
- ☆10Updated 3 years ago
- A graph-inspired data structure for determining likely chains of sequences from breadcrumbs of evidence☆17Updated 4 years ago
- deBGR: An Efficient and Near-Exact Representation of the Weighted de Bruijn Graph☆31Updated 5 years ago
- Implicit Interval Tree with Interpolation Index☆42Updated 3 years ago
- Python and Rust library for loading, saving, and manipulating taxonomic trees☆49Updated this week
- ☆12Updated 6 years ago
- dynamic-updateable-index☆11Updated 10 years ago
- Fast approximation of similarity for sets of very different sizes☆20Updated 3 years ago
- SIMD-parallel BLAST X-drop DP on sequence graphs☆24Updated last year
- ☆13Updated 10 years ago
- Code accompanying the publication for compressed graph annotation☆13Updated 6 years ago
- Rust implementation of probminhash, superminhash and hyperloglog sketching algorithms☆31Updated 7 months ago
- Practical Dynamic de Bruijn Graphs☆18Updated 5 years ago
- FMSI is a highly memory efficient exact k-mer set index based on masked superstrings and the masked Burrows-Wheeler transform☆23Updated 2 months ago
- Sequence Bloom Trees with All/Some split☆11Updated 7 years ago
- Fast, Cache-Efficient, and Scalable Queries on Pangenomes☆35Updated 2 months ago
- Refinements of the WFA alignment algorithm with better complexity☆26Updated 3 years ago
- Pairwise nucleotide alignment benchmark of Rust bindings☆30Updated 2 years ago
- Next Index to Query Kmer Intersection☆17Updated 2 years ago
- toolkit for file system virtualisation of random access compressed FASTA, FAI, DICT & TWOBIT files☆22Updated last year
- ProphAsm – a rapid computation of simplitigs directly from k-mer sets☆25Updated 2 years ago
- 📖 🧬 SSHash is a compressed, associative, exact, and weighted dictionary for k-mers.☆90Updated last month
- vector illustrations of BWT based searching on small strings☆16Updated 6 years ago