Kingsford-Group / miniceptionLinks
☆14Updated 5 years ago
Alternatives and similar repositories for miniception
Users that are interested in miniception are comparing it to the libraries listed below
Sorting:
- ProphAsm – a rapid computation of simplitigs directly from k-mer sets☆25Updated 2 years ago
- ☆24Updated last month
- An experimental tool to find approximate max-cuts in a large graph☆10Updated 4 years ago
- SAPLING: Suffix Array Piecewise Linear INdex for Genomics☆25Updated 5 years ago
- This repo is deprecated. Please use gfatools instead.☆15Updated 7 years ago
- FMSI is a highly memory efficient exact k-mer set index based on masked superstrings and the masked Burrows-Wheeler transform☆20Updated 2 months ago
- Next Index to Query Kmer Intersection☆16Updated 2 years ago
- Code for the paper Aligning Distant Sequences to Graphs using Long Seed Sketches.☆13Updated 2 years ago
- ☆12Updated 6 years ago
- RabbitMash: an efficient highly optimized implementation of Mash.☆20Updated last year
- ☆24Updated 4 years ago
- Space-efficient pseudoalignment with a colored de Bruijn graph☆52Updated 7 months ago
- GBWT-based handle graph☆31Updated last week
- a toolset for fast DNA read set matching and assembly using a new type of reduced kmer☆37Updated 4 years ago
- ☆28Updated 6 months ago
- Refinements of the WFA alignment algorithm with better complexity☆26Updated 3 years ago
- Iterate k-min-mers from a DNA sequence in Rust☆13Updated last year
- ☆11Updated 4 years ago
- De Bruijn graph construction for large k.☆17Updated 4 years ago
- Optimal distance lower bound k-mer sampling.☆12Updated last year
- Parallel Sequence to Graph Alignment☆36Updated 2 years ago
- Minimum plain text representation of kmer sets☆16Updated 8 months ago
- Johns Hopkins University student-led genomics paper discussion group☆13Updated 5 years ago
- interactive Multi Objective K-mer Analysis☆23Updated 2 years ago
- ☆26Updated 4 years ago
- Fast and cache-efficient full-text pangenome index☆29Updated last week
- Fast and compact locality-preserving minimal perfect hashing for k-mer sets.☆43Updated last year
- Layout module for raw de novo genome assembly of long uncorrected reads.☆21Updated 4 years ago
- Construct a Physical Map from Linked Reads☆18Updated last year
- Pairwise nucleotide alignment benchmark of Rust bindings☆30Updated 2 years ago