tobc / dartminhashLinks
DartMinHash: Fast Sketching for Weighted Sets
☆12Updated 4 years ago
Alternatives and similar repositories for dartminhash
Users that are interested in dartminhash are comparing it to the libraries listed below
Sorting:
- ProbMinHash – A Class of Locality-Sensitive Hash Algorithms for the (Probability) Jaccard Similarity☆44Updated 4 years ago
- Implementation of a Backpack Quotient Filter☆13Updated 2 months ago
- ☆10Updated 3 years ago
- ☆20Updated 5 years ago
- Implementation of eBWT using Prefix-free parse (PFP)☆14Updated 2 months ago
- Wavelet tree based on a fixed block boosting technique☆16Updated 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
- ☆24Updated 4 years ago
- An experimental tool to find approximate max-cuts in a large graph☆10Updated 4 years ago
- BagMinHash - Minwise Hashing Algorithm for Weighted Sets☆26Updated 5 years ago
- Practical Dynamic de Bruijn Graphs☆18Updated 5 years ago
- Fast and cache-efficient full-text pangenome index☆29Updated this week
- ☆14Updated 5 years ago
- Minhash Index Extended to Knead Kmer Intersection☆11Updated 5 years ago
- Cache-friendly, Parallel, and Samplesort-based Constructor for Suffix Arrays and LCP Arrays☆15Updated 3 months ago
- Code for the paper Aligning Distant Sequences to Graphs using Long Seed Sketches.☆13Updated 2 years ago
- vector illustrations of BWT based searching on small strings☆16Updated 6 years ago
- LogLog space version of MinHash by combining ideas from HyperLogLog and b-bit MinHash☆56Updated 5 years ago
- Fast and compact locality-preserving minimal perfect hashing for k-mer sets.☆43Updated last year
- Sequence Distance Graph framework: graph + reads + mapping + analysis☆26Updated 3 years ago
- A tool for merging large BWTs☆25Updated 4 years ago
- Refinements of the WFA alignment algorithm with better complexity☆26Updated 3 years ago
- A cheatsheet for most common Stringology tasks☆14Updated 4 years ago
- Code for the paper Succinct k-mer Set Representations Using Subset Rank Queries on the Spectral Burrows-Wheeler Transform (SBWT)☆24Updated 6 months ago
- ☆10Updated last year
- ☆23Updated last year
- Online construction of run-length BWT (RLBWT) and r-index. Plus, online LZ77 parsing based on RLBWT.☆14Updated 7 years ago
- COBS - Compact Bit-Sliced Signature Index (for Genomic k-Mer Data or q-Grams)☆83Updated last year
- Simple and fast MinHash implementation in C with Python wrapper☆13Updated 2 months ago
- Johns Hopkins University student-led genomics paper discussion group☆13Updated 5 years ago