Pop Mihai
Department of Computer Science and the Center for Bioinformatics and Computational Biology at the University of Maryland, College Park, MD 20742, USA.
Brief Bioinform. 2009 Jul;10(4):354-66. doi: 10.1093/bib/bbp026. Epub 2009 May 29.
Research into genome assembly algorithms has experienced a resurgence due to new challenges created by the development of next generation sequencing technologies. Several genome assemblers have been published in recent years specifically targeted at the new sequence data; however, the ever-changing technological landscape leads to the need for continued research. In addition, the low cost of next generation sequencing data has led to an increased use of sequencing in new settings. For example, the new field of metagenomics relies on large-scale sequencing of entire microbial communities instead of isolate genomes, leading to new computational challenges. In this article, we outline the major algorithmic approaches for genome assembly and describe recent developments in this domain.
由于下一代测序技术的发展带来了新的挑战,基因组组装算法的研究再度兴起。近年来已经发表了几种专门针对新序列数据的基因组组装程序;然而,不断变化的技术环境导致需要持续进行研究。此外,下一代测序数据的低成本使得测序在新的应用场景中的使用有所增加。例如,宏基因组学这一新兴领域依赖于对整个微生物群落而非单个分离基因组进行大规模测序,从而带来了新的计算挑战。在本文中,我们概述了基因组组装的主要算法方法,并描述了该领域的最新进展。