medvedevgroup / UST
☆25Updated 3 years ago
Alternatives and similar repositories for UST:
Users that are interested in UST are comparing it to the libraries listed below
- a toolset for fast DNA read set matching and assembly using a new type of reduced kmer☆37Updated 3 years ago
- ProphAsm – a rapid computation of simplitigs directly from k-mer sets☆26Updated 2 years ago
- This repo is deprecated. Please use gfatools instead.☆16Updated 6 years ago
- ☆25Updated 3 years ago
- Iterate k-min-mers from a DNA sequence in Rust☆13Updated 11 months ago
- An experimental tool to find approximate max-cuts in a large graph☆11Updated 3 years ago
- Contains the description of a file format to store kmers and associated values☆32Updated 2 years ago
- Reference implementations of minimizer schemes to go with the mod-minimizers paper.☆23Updated 3 weeks ago
- ☆14Updated 2 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☆53Updated last week
- the we-flyin WFA-guided ultralong tiling sequence aligner☆11Updated 3 years ago
- Iterate over minimizers of a DNA sequence☆28Updated 8 months ago
- ☆28Updated last year
- Layout module for raw de novo genome assembly of long uncorrected reads.☆21Updated 4 years ago
- Johns Hopkins University student-led genomics paper discussion group☆13Updated 4 years ago
- ☆14Updated 4 years ago
- Fast and cache-efficient full-text pangenome index☆27Updated 2 weeks ago
- Fulgor is a fast and space-efficient colored de Bruijn graph index.☆49Updated 3 weeks ago
- ☆17Updated last year
- RabbitMash: an efficient highly optimized implementation of Mash.☆21Updated last year
- A Rust library providing fully dynamic sets of k-mers with high locality☆44Updated 5 months ago
- vector illustrations of BWT based searching on small strings☆16Updated 5 years ago
- De Bruijn graph representation in low memory☆36Updated 8 months ago
- ☆14Updated 9 years ago
- GBWT-based handle graph☆31Updated last week
- Code for the paper Succinct k-mer Set Representations Using Subset Rank Queries on the Spectral Burrows-Wheeler Transform (SBWT)☆24Updated last week
- De Bruijn graph construction for large k.☆18Updated 3 years ago
- SIMD-parallel BLAST X-drop DP on sequence graphs☆24Updated 9 months ago
- FMSI is a highly memory efficient exact k-mer set based on masked superstrings and the masked Burrows-Wheeler transform☆19Updated last month