Translator Disclaimer
2010 Theory and Algorithms for the Haplotype Assembly Problem
Russell Schwartz
Commun. Inf. Syst. 10(1): 23-38 (2010).

Abstract

Genome sequencing studies to date have generally sought to assemble consensus genomes by merging sequence contributions from multiple homologous copies of each chromosome. With growing interest in genetic variations, however, there is a need for methods to separate these distinct contributions and assess how individual homologous chromosome copies differ from one another. An approach to this problem was developed using small sequence fragments derived from shotgun sequencing studies to determine the patterns of variations that co-occur on individual chromosomes. This has become known as the "haplotype assembly" problem. This review paper surveys results on the theory and algorithms for haplotype assembly. It first describes common abstractions of the problem. It then discusses some notable intractibility results for different problem variants. It next examines a variety of combinatorial, statistical, and heuristic methods for assembling fragment data sets in practice. The review concludes with a discussion of recent directions in diploid genome sequencing and their implications for haplotype assembly in the future.

Citation

Download Citation

Russell Schwartz. "Theory and Algorithms for the Haplotype Assembly Problem." Commun. Inf. Syst. 10 (1) 23 - 38, 2010.

Information

Published: 2010
First available in Project Euclid: 9 March 2010

zbMATH: 1185.92081
MathSciNet: MR2608065

Rights: Copyright © 2010 International Press of Boston

JOURNAL ARTICLE
16 PAGES


SHARE
Vol.10 • No. 1 • 2010
Back to Top