medvedevgroup / USTLinks
☆25Updated 4 years ago
Alternatives and similar repositories for UST
Users that are interested in UST are comparing it to the libraries listed below
Sorting:
- a toolset for fast DNA read set matching and assembly using a new type of reduced kmer☆37Updated 3 years ago
- ☆25Updated 4 years ago
- ProphAsm – a rapid computation of simplitigs directly from k-mer sets☆26Updated 2 years ago
- Contains the description of a file format to store kmers and associated values☆32Updated 2 years ago
- This repo is deprecated. Please use gfatools instead.☆16Updated 6 years ago
- C++ library for analysing and storing large-scale cohorts of sequence variant data☆17Updated 5 years ago
- Space-efficient pseudoalignment with a colored de Bruijn graph☆52Updated 4 months ago
- Johns Hopkins University student-led genomics paper discussion group☆13Updated 5 years ago
- VariantStore: A Large-Scale Genomic Variant Search Index☆39Updated 4 years ago
- A Rust library providing fully dynamic sets of k-mers with high locality☆45Updated 9 months ago
- nimble aligner that will map your reads to the references on a laptop☆12Updated 8 years ago
- De Bruijn graph representation in low memory☆36Updated last year
- ☆17Updated 7 months ago
- ☆28Updated 3 months ago
- Code for the paper Aligning Distant Sequences to Graphs using Long Seed Sketches.☆13Updated 2 years ago
- Reference implementations of minimizer schemes to go with the mod-minimizers paper.☆25Updated 2 months ago
- the we-flyin WFA-guided ultralong tiling sequence aligner☆11Updated 4 years ago
- ☆14Updated 4 years ago
- Next Index to Query Kmer Intersection☆16Updated 2 years ago
- Parallel Sequence to Graph Alignment☆37Updated 2 years ago
- An experimental tool to find approximate max-cuts in a large graph☆11Updated 4 years ago
- ☆14Updated 2 years ago
- Alignment algorithm for short Illumina reads to a de Bruijn graph☆16Updated 6 years ago
- Universal K-mer Hitting Set library in Rust☆10Updated 4 years ago
- Iterate k-min-mers from a DNA sequence in Rust☆13Updated last year
- Layout module for raw de novo genome assembly of long uncorrected reads.☆21Updated 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 5 months ago
- A fast constructor of the compressed de Bruijn graph from many genomes☆41Updated 5 months ago
- Refinements of the WFA alignment algorithm with better complexity☆26Updated 3 years ago
- RabbitMash: an efficient highly optimized implementation of Mash.☆21Updated last year