全部 标题 作者
关键词 摘要

OALib Journal期刊
ISSN: 2333-9721
费用:99美元

查看量下载量

相关文章

更多...
-  2018 

A safe and complete algorithm for metagenomic assembly

DOI: 10.1186/s13015-018-0122-7

Keywords: Genome assembly, Contig assembly, Metagenomics, Graph algorithm, Circular walk

Full-Text   Cite this paper   Add to My Lib

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

Full-Text

Contact Us

service@oalib.com

QQ:3279437679

WhatsApp +8615387084133