Skip Navigation


Briefings in Bioinformatics Advance Access originally published online on May 29, 2009
Briefings in Bioinformatics 2009 10(4):354-366; doi:10.1093/bib/bbp026
This Article
Right arrow Full Text
Right arrow Full Text (PDF)
Right arrow All Versions of this Article:
10/4/354    most recent
bbp026v1
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in PubMed
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Pop, M.
Right arrow Search for Related Content
PubMed
Right arrow PubMed Citation
Right arrow Articles by Pop, M.
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

© The Author 2009. Published by Oxford University Press. For Permissions, please email: journals.permissions@oxfordjournals.org

This article appears in the following Briefings in Bioinformatics issue: Special Issue: Challenges in Bioinformatics and Computational Biology [View the issue table of contents]

Genome assembly reborn: recent computational challenges

Mihai Pop

Corresponding author. Mihai Pop, Department of Computer Science, Center for Bioinformatics and Computational Biology, Biomolecular Sciences Building, Room 3120F, University of Maryland, College Park, MD 20742, USA. E-mail: mpop{at}umiacs.umd.edu

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.

Keywords: genome assembly, genome sequencing, next generation sequencing technologies

Submitted: March 2, 2009. Received (in revised form): April 18, 2009.


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?


This article has been cited by other articles:


Home page
 Brief BioinformHome page
M. Imelfort and D. Edwards
De novo sequencing of plant genomes using second-generation technologies
Brief Bioinform, November 1, 2009; 10(6): 609 - 618.
[Abstract] [Full Text] [PDF]

Home page
 Brief BioinformHome page
D. S. Horner, G. Pavesi, T. Castrignano, P. D. De Meo, S. Liuni, M. Sammeth, E. Picardi, and G. Pesole
Bioinformatics approaches for genomics and post genomics applications of next-generation sequencing
Brief Bioinform, October 27, 2009; (2009) bbp046v1.
[Abstract] [Full Text] [PDF]

Home page
 Brief Funct Genomic ProteomicHome page
K. U. Mir
Sequencing Genomes: From Individuals to Populations
Briefings in Functional Genomics, September 1, 2009; 8(5): 367 - 378.
[Abstract] [Full Text] [PDF]


Disclaimer: Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.