COMBINE-lab / kmersLinks
A bit-packed k-mer representation (and relevant utilities) for rust
☆47Updated last year
Alternatives and similar repositories for kmers
Users that are interested in kmers are comparing it to the libraries listed below
Sorting:
- Pairwise nucleotide alignment benchmark of Rust bindings☆30Updated 2 years ago
- Iterate over minimizers of a DNA sequence☆31Updated last year
- A FASTA/FASTQ format parser library☆20Updated last year
- ☆47Updated 2 years ago
- Fast and exact gap-affine partial order alignment☆54Updated 3 weeks ago
- GBWT in Rust☆42Updated 6 months ago
- Filter of Pairwise Alignement☆44Updated 3 years ago
- ntHash implementation in Rust☆36Updated last year
- Compacted and colored de Bruijn graph construction and querying☆84Updated last month
- A SIMD-accelerated library to compute random minimizers☆33Updated last week
- gia: Genomic Interval Arithmetic☆64Updated last year
- Benchmarking pairwise aligners☆36Updated 7 months ago
- Generate random test data for bioinformatics☆26Updated last year
- Bioinformatics 101 tool for counting unique k-length substrings in DNA☆31Updated 2 years ago
- Fasten toolkit, for streaming operations on fastq files☆79Updated 5 months ago
- Reference implementations of minimizer schemes to go with the mod-minimizers paper.☆25Updated 5 months ago
- Optimal sequence-to-graph alignment with recombinations☆36Updated 2 months ago
- Bidirectional WFA (Paper)☆47Updated last year
- A Rust library providing fully dynamic sets of k-mers with high locality☆46Updated last year
- A long read simulator based on badread idea☆22Updated 2 years ago
- a toolset for fast DNA read set matching and assembly using a new type of reduced kmer☆37Updated 4 years ago
- Python language bindings for bwa☆11Updated last week
- SIMD-parallel BLAST X-drop DP on sequence graphs☆24Updated last year
- Rust wrapper for the next generation (still currently in C++)☆28Updated 2 months ago
- implicit pangenome graph☆70Updated last week
- ⚡️ 🧬 Fulgor is a fast and space-efficient colored de Bruijn graph index.☆52Updated last week
- GFAffix identifies walk-preserving shared affixes in variation graphs and collapses them into a non-redundant graph structure.☆36Updated 4 months ago
- convert variation graph alignments to coverage maps over nodes☆24Updated 3 months ago
- Refinements of the WFA alignment algorithm with better complexity☆26Updated 3 years ago
- A Go implementation of the strobemers (https://github.com/ksahlin/strobemers)☆14Updated 4 years ago