RagnarGrootKoerkamp / minimizersLinks
Reference implementations of minimizer schemes to go with the mod-minimizers paper.
☆28Updated 9 months ago
Alternatives and similar repositories for minimizers
Users that are interested in minimizers are comparing it to the libraries listed below
Sorting:
- ⚡️ 🧬 Fulgor is a fast and space-efficient colored de Bruijn graph index.☆59Updated last month
- Iterate over minimizers of a DNA sequence☆31Updated last year
- Contains the description of a file format to store kmers and associated values☆34Updated 3 years ago
- Fast and exact gap-affine partial order alignment☆58Updated this week
- Wavefront alignment algorithm (WFA) in Golang☆32Updated 6 months ago
- A small, auxiliary index to massively improve parallel fastq parsing☆30Updated 3 weeks ago
- A reimplementation of the WaveFront Alignment algorithm at low memory☆50Updated last year
- Space-efficient pseudoalignment with a colored de Bruijn graph☆52Updated 10 months ago
- Benchmarking pairwise aligners☆36Updated 11 months ago
- Pairwise nucleotide alignment benchmark of Rust bindings☆30Updated 2 years ago
- A "Navie" Implementation of the Wavefront Algorithm For Sequence Alignment with Gap-Affine Scoring☆14Updated 2 years ago
- GFAffix identifies walk-preserving shared affixes in variation graphs and collapses them into a non-redundant graph structure.☆37Updated 8 months ago
- MONI: A Pangenomic Index for Finding MEMs☆37Updated 10 months ago
- Python wrapper for wavefront alignment using WFA2-lib☆38Updated last year
- Iterate k-min-mers from a DNA sequence in Rust☆13Updated last year
- fast, multithreaded sourmash operations: search, compare, and gather.☆25Updated 2 weeks ago
- A Rust library providing fully dynamic sets of k-mers with high locality☆46Updated 2 weeks ago
- FMSI is a highly memory efficient exact k-mer set index based on masked superstrings and the masked Burrows-Wheeler transform☆23Updated 2 months ago
- ☆16Updated 2 years ago
- Refinements of the WFA alignment algorithm with better complexity☆26Updated 3 years ago
- Code for the paper Succinct k-mer Set Representations Using Subset Rank Queries on the Spectral Burrows-Wheeler Transform (SBWT)☆24Updated 10 months ago
- Optimal sequence-to-graph alignment with recombinations☆39Updated 6 months ago
- Alignment algorithm for short Illumina reads to a de Bruijn graph☆17Updated 6 years ago
- convert variation graph alignments to coverage maps over nodes☆27Updated 2 weeks ago
- Validation of sycnmers compared to minimizers☆11Updated 8 months ago
- Dashing 2 is a fast toolkit for k-mer and minimizer encoding, sketching, comparison, and indexing.☆70Updated last year
- C implementation of the Landau-Vishkin algorithm☆35Updated 3 years ago
- Long read aligner for cyclic and acyclic pangenome graphs☆40Updated 2 years ago
- Fast, Cache-Efficient, and Scalable Queries on Pangenomes☆36Updated 2 months ago
- Dividing heterogeneous long-read sequencing into groups with de Bruijn graphs☆40Updated 4 months ago