TY - CHAP
T1 - Next-generation sequencing technologies and fragment assembly algorithms
AU - Lee, Heewook
AU - Tang, Haixu
PY - 2012
Y1 - 2012
N2 - As a classic topic in bioinformatics, the fragment assembly problem has been studied for over two decades. Fragment assembly algorithms take a set of DNA fragments as input, piece them together into a set of aligned overlapping fragments (i.e., contigs), and output a consensus sequence for each of the contigs. The rapid advance of massively parallel sequencing, often referred to as next-generation sequencing (NGS) technologies, has revolutionized DNA sequencing by reducing both its time and cost by several orders of magnitude in the past few years, but posed new challenges for fragment assembly. As a result, many new approaches have been developed to assemble NGS sequences, which are typically shorter with a higher error rate, but at a much higher throughput, than classic methods provided. In this chapter, we review both classic and new algorithms for fragment assembly, with a focus on NGS sequences. We also discuss a few new assembly problems emerging from the broader applications of NGS techniques, which are distinct from the classic fragment assembly problem.
AB - As a classic topic in bioinformatics, the fragment assembly problem has been studied for over two decades. Fragment assembly algorithms take a set of DNA fragments as input, piece them together into a set of aligned overlapping fragments (i.e., contigs), and output a consensus sequence for each of the contigs. The rapid advance of massively parallel sequencing, often referred to as next-generation sequencing (NGS) technologies, has revolutionized DNA sequencing by reducing both its time and cost by several orders of magnitude in the past few years, but posed new challenges for fragment assembly. As a result, many new approaches have been developed to assemble NGS sequences, which are typically shorter with a higher error rate, but at a much higher throughput, than classic methods provided. In this chapter, we review both classic and new algorithms for fragment assembly, with a focus on NGS sequences. We also discuss a few new assembly problems emerging from the broader applications of NGS techniques, which are distinct from the classic fragment assembly problem.
KW - Fragment assembly algorithms
KW - Genome sequencing
KW - Next-generation sequencing
KW - Overlap graph
KW - de Bruijn graph
UR - http://www.scopus.com/inward/record.url?scp=84860015746&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84860015746&partnerID=8YFLogxK
U2 - 10.1007/978-1-61779-582-4_5
DO - 10.1007/978-1-61779-582-4_5
M3 - Chapter
C2 - 22407708
AN - SCOPUS:84860015746
SN - 9781617795817
T3 - Methods in Molecular Biology
SP - 155
EP - 174
BT - Evolutionary Genomics
A2 - Anisimova, Maria
A2 - Anisimova, Maria
ER -