@article {16269,
	title = {Genome Assembly Reborn: Recent Computational Challenges},
	journal = {Briefings in Bioinformatics},
	volume = {10},
	year = {2009},
	month = {2009/07/01/},
	pages = {354 - 366},
	abstract = {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},
	isbn = {1467-5463, 1477-4054},
	doi = {10.1093/bib/bbp026},
	url = {http://bib.oxfordjournals.org/content/10/4/354},
	author = {Pop, Mihai}
}
