Sparse Binary Relation Representations for Genome Graph Annotation
-
Updated
Jul 4, 2021 - C++
Sparse Binary Relation Representations for Genome Graph Annotation
What I learned from Data Structures and Algorithms Specialization on Coursera.
Streaming de Bruijn and Compact de Bruijn Graph Algorithms
Find bubbles in the Colored de Bruijn Graph to reconstruct phylogenetic trees
Hybrid method based on a variable-order de bruijn Graph for the error Correction of Long Reads
ProphAsm – a rapid computation of simplitigs directly from k-mer sets
Fulgor is a fast and space-efficient colored de Bruijn graph index.
A fast constructor of the compressed de Bruijn graph from many genomes
A fast whole-genome aligner based on de Bruijn graphs
Core library of the Genome Analysis Toolbox with de-Bruijn graph
Add a description, image, and links to the de-bruijn-graphs topic page so that developers can more easily learn about it.
To associate your repository with the de-bruijn-graphs topic, visit your repo's landing page and select "manage topics."