splatlab / debgrLinks
deBGR: An Efficient and Near-Exact Representation of the Weighted de Bruijn Graph
☆30Updated 4 years ago
Alternatives and similar repositories for debgr
Users that are interested in debgr 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
- Population-scale detection of novel sequence insertions☆27Updated 2 years ago
- A fast constructor of the compressed de Bruijn graph from many genomes☆41Updated 6 months ago
- Cosmo is a fast, low-memory DNA assembler using a Succinct (variable order) de Bruijn Graph.☆52Updated last year
- An integrated high performance bioinformatics toolkit☆23Updated 6 years ago
- ☆28Updated 4 months ago
- Classify sequencing reads using MinHash.☆48Updated 5 years ago
- SAPLING: Suffix Array Piecewise Linear INdex for Genomics☆25Updated 4 years ago
- This repo is deprecated. Please use gfatools instead.☆16Updated 6 years ago
- Ococo: the first online variant and consensus caller. Call genomic consensus directly from an unsorted SAM/BAM stream.☆47Updated 6 years ago
- Space-efficient pseudoalignment with a colored de Bruijn graph☆53Updated 4 months ago
- GBWT-based handle graph☆31Updated last month
- Tool (experimental) to compute layout from overlaps with spectral algorithm☆11Updated 7 years ago
- Scaffolding genomes using synthetic long read clouds☆20Updated 8 years ago
- Proof-of-concept implementation of GWFA for sequence-to-graph alignment☆57Updated last year
- Parallel Sequence to Graph Alignment☆37Updated 2 years ago
- a string to graph aligner☆41Updated 9 years ago
- reference free variant assembly☆33Updated 2 years ago
- De Bruijn graph representation in low memory☆36Updated last year
- Minimalistic aligner which uses Minimap for input mapping locations and Edlib for fast bitvector alignment.☆10Updated 8 years ago
- de Bruijn Graph REAd mapping Tool☆14Updated 8 years ago
- d'accord is a non hybrid long read consensus program based on local de Bruijn graph assembly☆19Updated 6 years ago
- Fast and accurate set similarity estimation via containment min hash☆43Updated last year
- ☆25Updated 4 years ago
- collection of data structures and algorithms☆19Updated 6 years ago
- Johns Hopkins University student-led genomics paper discussion group☆13Updated 5 years ago
- Using reference-free compressed data structures to analyse thousands of human genomes (1000 Genomes ReadServer)☆14Updated 7 years ago
- de Bruijn Graph-based read aligner☆33Updated 6 years ago
- ☆15Updated 7 years ago
- A fast, AVX2 and ARM Neon accelerated FM index library☆34Updated 8 months ago