medvedevgroup / TwoPaCoLinks
A fast constructor of the compressed de Bruijn graph from many genomes
☆42Updated last month
Alternatives and similar repositories for TwoPaCo
Users that are interested in TwoPaCo are comparing it to the libraries listed below
Sorting:
- Cosmo is a fast, low-memory DNA assembler using a Succinct (variable order) de Bruijn Graph.☆53Updated last year
- a toolset for fast DNA read set matching and assembly using a new type of reduced kmer☆37Updated 4 years ago
- Contains the description of a file format to store kmers and associated values☆34Updated 3 years ago
- efficient alignment of strings to partially ordered string graphs☆33Updated 3 years ago
- Classify sequencing reads using MinHash.☆48Updated 5 years ago
- Ococo: the first online variant and consensus caller. Call genomic consensus directly from an unsorted SAM/BAM stream.☆46Updated 7 years ago
- Space-efficient pseudoalignment with a colored de Bruijn graph☆52Updated 10 months ago
- C implementation of the Landau-Vishkin algorithm☆35Updated 3 years ago
- Population-scale detection of novel sequence insertions☆27Updated 3 years ago
- REINDEER REad Index for abuNDancE quERy☆56Updated 6 months ago
- Parallel Sequence to Graph Alignment☆36Updated 3 years ago
- URMAP ultra-fast read mapper☆38Updated 5 years ago
- Dashing 2 is a fast toolkit for k-mer and minimizer encoding, sketching, comparison, and indexing.☆70Updated last year
- Squeakr: An Exact and Approximate k -mer Counting System☆86Updated 10 months ago
- ⚡️ 🧬 Fulgor is a fast and space-efficient colored de Bruijn graph index.☆59Updated last month
- ☆24Updated 4 months ago
- SAPLING: Suffix Array Piecewise Linear INdex for Genomics☆25Updated 5 years ago
- Index kmtricks bf matrices☆46Updated last month
- The Modular Aligner and The Modular SV Caller☆46Updated 2 years ago
- Histosketching Using Little Kmers☆56Updated 2 years ago
- Johns Hopkins University student-led genomics paper discussion group☆13Updated 5 years ago
- de Bruijn Graph-based read aligner☆35Updated 7 years ago
- An experimental tool to find approximate max-cuts in a large graph☆10Updated 4 years ago
- Python bindings for Bifrost's compacted colored de Bruijn Graph with a NetworkX-compatible API☆27Updated 2 years ago
- ☆28Updated 9 months ago
- ☆24Updated 4 years ago
- This repo is deprecated. Please use gfatools instead.☆15Updated 7 years ago
- Practical Dynamic de Bruijn Graphs☆18Updated 5 years ago
- VariantStore: A Large-Scale Genomic Variant Search Index☆39Updated 4 years ago
- Efficient, parallel compression for terabyte-scale data☆56Updated 3 months ago