RagnarGrootKoerkamp / minimizers
Reference implementations of minimizer schemes to go with the mod-minimizers paper.
☆21Updated this week
Related projects: ⓘ
- Iterate over minimizers of a DNA sequence☆24Updated 2 months ago
- Rust wrapper for the next generation (still currently in C++)☆20Updated last month
- Iterate k-min-mers from a DNA sequence in Rust☆13Updated 5 months ago
- Fulgor is a fast and space-efficient colored de Bruijn graph index.☆43Updated 3 weeks ago
- Contains the description of a file format to store kmers and associated values☆30Updated 2 years ago
- ☆17Updated last year
- Optimal distance lower bound k-mer sampling.☆12Updated 3 months ago
- A long read simulator based on badread idea☆20Updated last year
- Wavefront alignment algorithm (WFA) in Golang☆30Updated 3 months ago
- Benchmarking pairwise aligners☆35Updated 5 months ago
- a toolset for fast DNA read set matching and assembly using a new type of reduced kmer☆37Updated 3 years ago
- Fast and exact gap-affine partial order alignment☆38Updated this week
- A "Navie" Implementation of the Wavefront Algorithm For Sequence Alignment with Gap-Affine Scoring☆14Updated last year
- ☆14Updated 3 years ago
- ☆16Updated 3 years ago
- fast, multithreaded sourmash operations: search, compare, and gather.☆15Updated this week
- Optimal sequence-to-graph alignment with recombinations☆23Updated 2 months ago
- convert variation graph alignments to coverage maps over nodes☆20Updated 3 months ago
- Validation of sycnmers compared to minimizers☆11Updated 3 years ago
- RabbitMash: an efficient highly optimized implementation of Mash.☆21Updated 10 months ago
- SAPLING: Suffix Array Piecewise Linear INdex for Genomics☆25Updated 4 years ago
- recompute GFA link overlaps☆25Updated 2 years ago
- Space-efficient pseudoalignment with a colored de Bruijn graph☆50Updated last week
- A FASTA/FASTQ format parser library☆20Updated 6 months ago
- A reimplementation of the WaveFront Alignment algorithm at low memory☆49Updated 3 months ago
- Code for the paper Succinct k-mer Set Representations Using Subset Rank Queries on the Spectral Burrows-Wheeler Transform (SBWT)☆23Updated last month
- Extracting paths from assembly graphs☆19Updated 4 months ago
- Extracts subgraphs or components from a graph in GFA format☆21Updated 3 months ago
- Alignment algorithm for short Illumina reads to a de Bruijn graph☆16Updated 5 years ago