tobc / dartminhashLinks
DartMinHash: Fast Sketching for Weighted Sets
☆13Updated 4 years ago
Alternatives and similar repositories for dartminhash
Users that are interested in dartminhash are comparing it to the libraries listed below
Sorting:
- Implementation of a Backpack Quotient Filter☆12Updated last month
- ☆10Updated 3 years ago
- ☆20Updated 5 years ago
- ProbMinHash – A Class of Locality-Sensitive Hash Algorithms for the (Probability) Jaccard Similarity☆43Updated 4 years ago
- Wavelet tree based on a fixed block boosting technique☆16Updated 4 years ago
- An experimental tool to find approximate max-cuts in a large graph☆11Updated 4 years ago
- Fast and cache-efficient full-text pangenome index☆29Updated last week
- Implementation of eBWT using Prefix-free parse (PFP)☆14Updated last month
- ☆14Updated 5 years ago
- ☆25Updated 4 years ago
- Practical Dynamic de Bruijn Graphs☆18Updated 4 years ago
- Cache-friendly, Parallel, and Samplesort-based Constructor for Suffix Arrays and LCP Arrays☆13Updated 2 months ago
- vector illustrations of BWT based searching on small strings☆16Updated 6 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
- Refinements of the WFA alignment algorithm with better complexity☆26Updated 3 years ago
- Minhash Index Extended to Knead Kmer Intersection☆11Updated 5 years ago
- COBS - Compact Bit-Sliced Signature Index (for Genomic k-Mer Data or q-Grams)☆84Updated last year
- A tool for merging large BWTs☆26Updated 4 years ago
- BagMinHash - Minwise Hashing Algorithm for Weighted Sets☆26Updated 4 years ago
- Code for the paper Aligning Distant Sequences to Graphs using Long Seed Sketches.☆13Updated 2 years ago
- Code for the paper Succinct k-mer Set Representations Using Subset Rank Queries on the Spectral Burrows-Wheeler Transform (SBWT)☆24Updated 5 months ago
- Optimal distance lower bound k-mer sampling.☆12Updated last year
- Simple and fast MinHash implementation in C with Python wrapper☆13Updated last month
- ProphAsm – a rapid computation of simplitigs directly from k-mer sets☆26Updated 2 years ago
- LogLog space version of MinHash by combining ideas from HyperLogLog and b-bit MinHash☆57Updated 5 years ago
- Reference implementations of minimizer schemes to go with the mod-minimizers paper.☆25Updated 4 months ago
- SIMD-parallel BLAST X-drop DP on sequence graphs☆25Updated last year
- An optimal space run-length Burrows-Wheeler transform full-text index☆66Updated 2 years ago
- FMSI is a highly memory efficient exact k-mer set index based on masked superstrings and the masked Burrows-Wheeler transform☆20Updated last month