ratschlab / Project2020-seq-tensor-sketching
☆8Updated 3 years ago
Alternatives and similar repositories for Project2020-seq-tensor-sketching:
Users that are interested in Project2020-seq-tensor-sketching are comparing it to the libraries listed below
- Reference implementations of minimizer schemes to go with the mod-minimizers paper.☆23Updated this week
- Iterate over minimizers of a DNA sequence☆27Updated 7 months ago
- Fast and exact gap-affine partial order alignment☆47Updated 2 months ago
- Refinements of the WFA alignment algorithm with better complexity☆26Updated 2 years ago
- A rust wrapper for the spoa C++ partial order alignment library☆10Updated 7 months ago
- Optimal sequence-to-graph alignment with recombinations☆28Updated this week
- Optimal distance lower bound k-mer sampling.☆12Updated 8 months ago
- SAPLING: Suffix Array Piecewise Linear INdex for Genomics☆25Updated 4 years ago
- convert variation graph alignments to coverage maps over nodes☆23Updated 3 weeks ago
- Benchmarking pairwise aligners☆36Updated last week
- Pairwise nucleotide alignment benchmark of Rust bindings☆31Updated last year
- Fulgor is a fast and space-efficient colored de Bruijn graph index.☆49Updated this week
- Rust implementation of ekg's dozyg☆9Updated 2 years ago
- Code for the paper Succinct k-mer Set Representations Using Subset Rank Queries on the Spectral Burrows-Wheeler Transform (SBWT)☆24Updated 2 months ago
- ☆17Updated last year
- GBWT in Rust☆42Updated 2 months ago
- Iterate k-min-mers from a DNA sequence in Rust☆13Updated 10 months ago
- ☆15Updated last year
- Alignment algorithm for short Illumina reads to a de Bruijn graph☆16Updated 5 years ago
- A long read simulator based on badread idea☆20Updated 2 years ago
- sequence to graph mapper☆11Updated 3 years ago
- Rust implementation of VG handle graph☆20Updated last year
- A reimplementation of the WaveFront Alignment algorithm at low memory☆49Updated 8 months ago
- genome variation graphs constructed from HLA GRCh38 ALTs☆23Updated 3 years ago
- GFAffix identifies walk-preserving shared affixes in variation graphs and collapses them into a non-redundant graph structure.☆36Updated this week
- A Rust library providing fully dynamic sets of k-mers with high locality☆44Updated 4 months ago
- Extracting paths from assembly graphs☆22Updated 9 months ago
- Wavefront alignment algorithm (WFA) in Golang☆30Updated 3 months ago
- ☆17Updated 4 years ago
- Sketch-based surveillance platform☆13Updated 2 months ago