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 4 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 3 years ago
- This repo is deprecated. Please use gfatools instead.☆16Updated 7 years ago
- Generate kmers/minimizers/hashes/MinHash signatures, including with multiple kmer sizes.☆24Updated 4 years ago
- SIMD-parallel BLAST X-drop DP on sequence graphs☆25Updated last year
- ☆28Updated 4 months ago
- Fast and cache-efficient full-text pangenome index☆29Updated last week
- 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 5 months ago
- Refinements of the WFA alignment algorithm with better complexity☆26Updated 3 years ago
- A Rust library providing fully dynamic sets of k-mers with high locality☆45Updated 10 months ago
- Reference implementations of minimizer schemes to go with the mod-minimizers paper.☆25Updated 4 months ago
- FMSI is a highly memory efficient exact k-mer set index based on masked superstrings and the masked Burrows-Wheeler transform☆20Updated last month
- Layout module for raw de novo genome assembly of long uncorrected reads.☆21Updated 4 years ago
- Next Index to Query Kmer Intersection☆16Updated 2 years ago
- VariantStore: A Large-Scale Genomic Variant Search Index☆40Updated 4 years ago
- De Bruijn graph representation in low memory☆36Updated last year
- ☆14Updated 2 years ago
- ☆14Updated 4 years ago
- Parallel Sequence to Graph Alignment☆37Updated 2 years ago
- nimble aligner that will map your reads to the references on a laptop☆12Updated 8 years ago
- ☆18Updated 9 months ago
- Iterate k-min-mers from a DNA sequence in Rust☆13Updated last year
- An experimental tool to find approximate max-cuts in a large graph☆11Updated 4 years ago
- A fast constructor of the compressed de Bruijn graph from many genomes☆41Updated 6 months ago
- Code for the paper Aligning Distant Sequences to Graphs using Long Seed Sketches.☆13Updated 2 years ago
- A hash map using the BooPHF perfect hash function☆13Updated 8 years ago
- Efficient C functions to compute the summary statistics (flagstats) for sequencing read sets.☆15Updated 5 years ago