COMBINE-lab / kmersLinks
A bit-packed k-mer representation (and relevant utilities) for rust
☆48Updated 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☆31Updated last year
- Benchmarking pairwise aligners☆36Updated 5 months ago
- Iterate over minimizers of a DNA sequence☆31Updated last year
- gia: Genomic Interval Arithmetic☆65Updated 10 months ago
- GBWT in Rust☆43Updated 3 months ago
- ntHash implementation in Rust☆36Updated last year
- Filter of Pairwise Alignement☆44Updated 3 years ago
- Compacted and colored de Bruijn graph construction and querying☆83Updated this week
- ☆48Updated 2 years ago
- A Rust library providing fully dynamic sets of k-mers with high locality☆45Updated 9 months ago
- ⚡️ 🧬 Fulgor is a fast and space-efficient colored de Bruijn graph index.☆51Updated 3 weeks ago
- a toolset for fast DNA read set matching and assembly using a new type of reduced kmer☆37Updated 3 years ago
- Alignment-based gene expression quantification☆29Updated 3 months ago
- GFA insert into GenomicSQLite☆49Updated 4 years ago
- A FASTA/FASTQ format parser library☆20Updated last year
- Fasten toolkit, for streaming operations on fastq files☆79Updated 3 months ago
- Bioinformatics 101 tool for counting unique k-length substrings in DNA☆31Updated last year
- A SIMD-accelerated library to compute random minimizers☆29Updated 2 weeks ago
- Bidirectional WFA (Paper)☆46Updated last year
- A long read simulator based on badread idea☆22Updated 2 years ago
- Generate random test data for bioinformatics☆26Updated last year
- Refinements of the WFA alignment algorithm with better complexity☆26Updated 3 years ago
- A Go implementation of the strobemers (https://github.com/ksahlin/strobemers)☆15Updated 4 years ago
- GFA parser in Rust☆31Updated 2 years ago
- ☆58Updated 2 years ago
- Python language bindings for bwa☆10Updated last week
- an API for intersections of genomic data☆75Updated 3 weeks ago
- GFAffix identifies walk-preserving shared affixes in variation graphs and collapses them into a non-redundant graph structure.☆36Updated last month
- Fast and exact gap-affine partial order alignment☆52Updated this week
- De Bruijn graph representation in low memory☆36Updated last year