dkoslicki / MinHashMetagenomicsLinks
Fast approximation of similarity for sets of very different sizes
☆20Updated 3 years ago
Alternatives and similar repositories for MinHashMetagenomics
Users that are interested in MinHashMetagenomics are comparing it to the libraries listed below
Sorting:
- This repo is deprecated. Please use gfatools instead.☆15Updated 7 years ago
- SIMD-parallel BLAST X-drop DP on sequence graphs☆24Updated last year
- ☆13Updated 9 years ago
- ☆12Updated 6 years ago
- A fast constructor of the compressed de Bruijn graph from many genomes☆42Updated last month
- a toolset for fast DNA read set matching and assembly using a new type of reduced kmer☆37Updated 4 years ago
- Generate kmers/minimizers/hashes/MinHash signatures, including with multiple kmer sizes.☆24Updated 5 years ago
- ☆10Updated last year
- Fast and accurate set similarity estimation via containment min hash☆42Updated last year
- ☆24Updated 4 months ago
- ☆28Updated 9 months ago
- Code for the paper Aligning Distant Sequences to Graphs using Long Seed Sketches.☆13Updated 3 years ago
- ☆24Updated 4 years ago
- Fast and precise comparison of genomes and metagenomes (in the order of terabytes) on a typical personal laptop☆71Updated 5 months ago
- deBGR: An Efficient and Near-Exact Representation of the Weighted de Bruijn Graph☆31Updated 4 years ago
- Practical Dynamic de Bruijn Graphs☆18Updated 5 years ago
- An integrated high performance bioinformatics toolkit☆23Updated 6 years ago
- Sequence Bloom Trees with All/Some split☆11Updated 7 years ago
- ProphAsm – a rapid computation of simplitigs directly from k-mer sets☆25Updated 2 years ago
- A versatile pairwise aligner for genomic and spliced nucleotide sequences☆23Updated 3 months ago
- Minhash Index Extended to Knead Kmer Intersection☆11Updated 5 years ago
- MetaCarvel: A scaffolder for metagenomes☆14Updated last year
- RabbitMash: an efficient highly optimized implementation of Mash.☆20Updated 2 years ago
- ☆15Updated 3 years ago
- Linear-time, low-memory construction of variation graphs☆20Updated 5 years ago
- Next Index to Query Kmer Intersection☆17Updated 2 years ago
- Cosmo is a fast, low-memory DNA assembler using a Succinct (variable order) de Bruijn Graph.☆53Updated last year
- Classify sequencing reads using MinHash.☆48Updated 5 years ago
- Space-efficient pseudoalignment with a colored de Bruijn graph☆52Updated 9 months ago
- Proof-of-concept implementation of GWFA for sequence-to-graph alignment☆56Updated last year