|
- 2018
A safe and complete algorithm for metagenomic assemblyDOI: 10.1186/s13015-018-0122-7 Keywords: Genome assembly, Contig assembly, Metagenomics, Graph algorithm, Circular walk Abstract: Reconstructing the genome of a species from short fragments is one of the oldest bioinformatics problems. Metagenomic assembly is a variant of the problem asking to reconstruct the circular genomes of all bacterial species present in a sequencing sample. This problem can be naturally formulated as finding a collection of circular walks of a directed graph G that together cover all nodes, or edges, of G
|