OndrejSladky / fmsi
FMSI is a highly memory efficient exact k-mer set based on masked superstrings and the masked Burrows-Wheeler transform
☆18Updated 3 weeks ago
Alternatives and similar repositories for fmsi:
Users that are interested in fmsi are comparing it to the libraries listed below
- Fulgor is a fast and space-efficient colored de Bruijn graph index.☆49Updated this week
- Reference implementations of minimizer schemes to go with the mod-minimizers paper.☆23Updated this week
- Iterate over minimizers of a DNA sequence☆27Updated 7 months ago
- ProphAsm – a rapid computation of simplitigs directly from k-mer sets☆26Updated 2 years ago
- Iterate k-min-mers from a DNA sequence in Rust☆13Updated 10 months ago
- Wavefront alignment algorithm (WFA) in Golang☆30Updated 3 months ago
- a toolset for fast DNA read set matching and assembly using a new type of reduced kmer☆37Updated 3 years ago
- A k-mer search engine for all Sequence Read Archive public accessions☆20Updated 3 months ago
- A Rust library providing fully dynamic sets of k-mers with high locality☆44Updated 4 months ago
- Space-efficient pseudoalignment with a colored de Bruijn graph☆53Updated 2 months ago
- Validation of sycnmers compared to minimizers☆11Updated 4 years ago
- General purpose utility related to GAF files☆22Updated 3 weeks ago
- ☆17Updated last year
- SAPLING: Suffix Array Piecewise Linear INdex for Genomics☆25Updated 4 years ago
- De Bruijn graph construction for large k.☆18Updated 3 years ago
- exploring viral genome assembly with variation graph tools☆19Updated 4 years ago
- ☆28Updated last year
- Contains the description of a file format to store kmers and associated values☆32Updated 2 years ago
- RabbitMash: an efficient highly optimized implementation of Mash.☆21Updated last year
- GFAffix identifies walk-preserving shared affixes in variation graphs and collapses them into a non-redundant graph structure.☆36Updated this week
- ☆21Updated 4 months ago
- Optimal distance lower bound k-mer sampling.☆12Updated 8 months ago
- extract MSAs from genome variation graphs☆33Updated 4 years ago
- Long-read aligner to pangenome graphs☆26Updated 9 months ago
- Alignment algorithm for short Illumina reads to a de Bruijn graph☆16Updated 5 years ago
- Fast and exact gap-affine partial order alignment☆47Updated 2 months ago
- Next Index to Query Kmer Intersection☆16Updated 2 years ago
- Optimized sequence graph implementations for graph genomics☆34Updated 2 months ago
- Long read aligner for cyclic and acyclic pangenome graphs☆36Updated last year
- ☆25Updated 3 years ago