ratschlab / tensor-sketch-alignmentLinks
Code for the paper Aligning Distant Sequences to Graphs using Long Seed Sketches.
☆13Updated 3 years ago
Alternatives and similar repositories for tensor-sketch-alignment
Users that are interested in tensor-sketch-alignment are comparing it to the libraries listed below
Sorting:
- Iterate k-min-mers from a DNA sequence in Rust☆13Updated last year
- ☆24Updated 2 months ago
- ProphAsm – a rapid computation of simplitigs directly from k-mer sets☆25Updated 2 years ago
- ☆28Updated 7 months ago
- a toolset for fast DNA read set matching and assembly using a new type of reduced kmer☆37Updated 4 years ago
- Next Index to Query Kmer Intersection☆16Updated 2 years ago
- Long-read aligner to pangenome graphs☆28Updated last year
- syncmer graphs, and perhaps other sorts of sequence graphs☆23Updated last week
- Contains the description of a file format to store kmers and associated values☆34Updated 3 years ago
- Alignment algorithm for short Illumina reads to a de Bruijn graph☆17Updated 6 years ago
- A script to extract graph structure from multiple sequence alignment result and output as GFA/JSON for vg☆11Updated 6 years ago
- Refinements of the WFA alignment algorithm with better complexity☆26Updated 3 years ago
- Utilities to detect and profile `het-kmers`☆11Updated last year
- Long read aligner for cyclic and acyclic pangenome graphs☆39Updated last year
- ☆17Updated 2 years ago
- Wavefront alignment algorithm (WFA) in Golang☆32Updated 3 months ago
- Validation of sycnmers compared to minimizers☆11Updated 6 months ago
- GBWT-based handle graph☆31Updated this week
- recompute GFA link overlaps☆25Updated 3 years ago
- MONI: A Pangenomic Index for Finding MEMs☆37Updated 7 months ago
- A "Navie" Implementation of the Wavefront Algorithm For Sequence Alignment with Gap-Affine Scoring☆14Updated 2 years ago
- convert variation graph alignments to coverage maps over nodes☆26Updated 2 weeks ago
- Reference implementations of minimizer schemes to go with the mod-minimizers paper.☆27Updated 6 months ago
- FMSI is a highly memory efficient exact k-mer set index based on masked superstrings and the masked Burrows-Wheeler transform☆20Updated 3 weeks ago
- Population-scale detection of non-reference sequence variants using colored de Bruijn Graphs☆26Updated last year
- Generate kmers/minimizers/hashes/MinHash signatures, including with multiple kmer sizes.☆24Updated 4 years ago
- Optimal distance lower bound k-mer sampling.☆12Updated last year
- ☆24Updated 4 years ago
- ☆13Updated 2 weeks ago
- Extracts subgraphs or components from a graph in GFA format☆24Updated last year