Next-generation sequencing technologies and fragment assembly algorithms

Heewook Lee, Haixu Tang

Research output: Chapter in Book/Report/Conference proceedingChapter

15 Scopus citations

Abstract

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.

Original languageEnglish (US)
Title of host publicationEvolutionary Genomics
Subtitle of host publicationStatistical and Computational Methods, Volume 1
EditorsMaria Anisimova, Maria Anisimova
Pages155-174
Number of pages20
DOIs
StatePublished - 2012
Externally publishedYes

Publication series

NameMethods in Molecular Biology
Volume855
ISSN (Print)1064-3745

Keywords

  • de Bruijn graph
  • Fragment assembly algorithms
  • Genome sequencing
  • Next-generation sequencing
  • Overlap graph

ASJC Scopus subject areas

  • Molecular Biology
  • Genetics

Fingerprint Dive into the research topics of 'Next-generation sequencing technologies and fragment assembly algorithms'. Together they form a unique fingerprint.

Cite this