medvedevgroup / UST
☆25Updated 4 years ago
Alternatives and similar repositories for UST:
Users that are interested in UST are comparing it to the libraries listed below
- ProphAsm – a rapid computation of simplitigs directly from k-mer sets☆26Updated 2 years ago
- a toolset for fast DNA read set matching and assembly using a new type of reduced kmer☆37Updated 3 years ago
- ☆25Updated 3 years ago
- C++ library for analysing and storing large-scale cohorts of sequence variant data☆17Updated 5 years ago
- This repo is deprecated. Please use gfatools instead.☆16Updated 6 years ago
- An experimental tool to find approximate max-cuts in a large graph☆11Updated 3 years ago
- ☆14Updated 2 years ago
- Contains the description of a file format to store kmers and associated values☆32Updated 2 years ago
- Johns Hopkins University student-led genomics paper discussion group☆13Updated 5 years ago
- Optimal distance lower bound k-mer sampling.☆12Updated 10 months ago
- Reference implementations of minimizer schemes to go with the mod-minimizers paper.☆24Updated last month
- SIMD-parallel BLAST X-drop DP on sequence graphs☆24Updated 10 months ago
- Layout module for raw de novo genome assembly of long uncorrected reads.☆21Updated 4 years ago
- nimble aligner that will map your reads to the references on a laptop☆12Updated 7 years ago
- the we-flyin WFA-guided ultralong tiling sequence aligner☆11Updated 3 years ago
- Iterate over minimizers of a DNA sequence☆28Updated 9 months ago
- Universal K-mer Hitting Set library in Rust☆10Updated 4 years ago
- Refinements of the WFA alignment algorithm with better complexity☆26Updated 3 years ago
- ☆28Updated last week
- Bam Read Index - Extract alignments from a bam file by readname☆25Updated 11 months ago
- Fast and cache-efficient full-text pangenome index☆27Updated 3 weeks ago
- ☆14Updated 4 years ago
- Code for the paper Aligning Distant Sequences to Graphs using Long Seed Sketches.☆13Updated 2 years ago
- Next Index to Query Kmer Intersection☆16Updated 2 years ago
- GBWT-based handle graph☆31Updated last month
- Iterate k-min-mers from a DNA sequence in Rust☆13Updated last year
- ☆14Updated 9 years ago
- Space-efficient pseudoalignment with a colored de Bruijn graph☆53Updated last month
- Validation of sycnmers compared to minimizers☆11Updated 4 years ago
- FMSI is a highly memory efficient exact k-mer set index based on masked superstrings and the masked Burrows-Wheeler transform☆20Updated 2 months ago