%0 Journal Article
%T A safe and complete algorithm for metagenomic assembly
%A Nidia Obscura Acosta
%A Veli M£¿kinen
%J Archive of "Algorithms for Molecular Biology : AMB".
%D 2018
%R 10.1186/s13015-018-0122-7
%X 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
%K Genome assembly
%K Contig assembly
%K Metagenomics
%K Graph algorithm
%K Circular walk
%U https://www.ncbi.nlm.nih.gov/pmc/articles/PMC5802251/