medvedevgroup / USTLinks
☆24Updated 4 years ago
Alternatives and similar repositories for UST
Users that are interested in UST are comparing it to the libraries listed below
Sorting:
- Contains the description of a file format to store kmers and associated values☆34Updated 3 years ago
- a toolset for fast DNA read set matching and assembly using a new type of reduced kmer☆37Updated 4 years ago
- SIMD-parallel BLAST X-drop DP on sequence graphs☆24Updated last year
- ☆24Updated 5 months ago
- Refinements of the WFA alignment algorithm with better complexity☆26Updated 3 years ago
- Parallel Sequence to Graph Alignment☆36Updated 3 years ago
- Generate kmers/minimizers/hashes/MinHash signatures, including with multiple kmer sizes.☆24Updated 5 years ago
- A Rust library providing fully dynamic sets of k-mers with high locality☆47Updated 3 weeks ago
- Layout module for raw de novo genome assembly of long uncorrected reads.☆20Updated 5 years ago
- This repo is deprecated. Please use gfatools instead.☆15Updated 7 years ago
- A fast constructor of the compressed de Bruijn graph from many genomes☆42Updated 2 months ago
- Space-efficient pseudoalignment with a colored de Bruijn graph☆52Updated 10 months ago
- ☆15Updated 3 years ago
- C++ library for analysing and storing large-scale cohorts of sequence variant data☆17Updated 6 years ago
- nimble aligner that will map your reads to the references on a laptop☆11Updated 8 years ago
- ☆14Updated 5 years ago
- ProphAsm – a rapid computation of simplitigs directly from k-mer sets☆25Updated 2 years ago
- Fast, Cache-Efficient, and Scalable Queries on Pangenomes☆36Updated 3 months ago
- Reference implementations of minimizer schemes to go with the mod-minimizers paper.☆28Updated 9 months ago
- Code for the paper Aligning Distant Sequences to Graphs using Long Seed Sketches.☆13Updated 3 years ago
- De Bruijn graph representation in low memory☆35Updated last year
- GBWT-based handle graph☆31Updated this week
- VariantStore: A Large-Scale Genomic Variant Search Index☆39Updated 4 years ago
- Johns Hopkins University student-led genomics paper discussion group☆13Updated 5 years ago
- ☆28Updated 10 months ago
- URMAP ultra-fast read mapper☆38Updated 5 years ago
- An experimental tool to find approximate max-cuts in a large graph☆10Updated 4 years ago
- C implementation of the Landau-Vishkin algorithm☆35Updated 3 years ago
- Fast and compact locality-preserving minimal perfect hashing for k-mer sets.☆43Updated 2 years ago
- Code for the paper Succinct k-mer Set Representations Using Subset Rank Queries on the Spectral Burrows-Wheeler Transform (SBWT)☆24Updated 10 months ago