Polynomial and APX-hard cases of the individual haplotyping problem

• Published in: Theoretical computer science Vol. 335; no. 1; pp. 109 - 125
• Main Authors: Bafna, Vineet, Istrail, Sorin, Lancia, Giuseppe, Rizzi, Romeo
• Format: Journal Article
• Language: English
• Published: Elsevier B.V 20.05.2005
• Subjects: APX-hardness; Fixed-parameter tractability; Haplotyping; Haplotyping; Fixed-parameter tractability; APX-hardness
• ISSN: 0304-3975; 1879-2294
• DOI: 10.1016/j.tcs.2004.12.017

SNP haplotyping problems have been the subject of extensive research in the last few years, and are one of the hottest areas of Computational Biology today. In this paper we report on our work of the last two years, whose preliminary results were presented at the European Symposium on Algorithms (Proceedings of the Annual European Symposium on Algorithms (ESA), Vol. 2161. Lecture Notes in Computer Science, Springer, 2001, pp. 182–193.) and Workshop on Algorithms in Bioinformatics (Proceedings of the Annual Workshop on Algorithms in Bioinformatics (WABI), Vol. 2452. Lecture Notes in Computer Science, Springer, 2002, pp. 29–43.). We address the problem of reconstructing two haplotypes for an individual from fragment assembly data. This problem will be called the Single Individual Haplotyping Problem. On the positive side, we prove that the problem can be solved effectively for gapless data, and give practical, dynamic programming algorithms for its solution. On the negative side, we show that it is unlikely that polynomial algorithms exist, even to approximate the solution arbitrarily well, when the data contain gaps. We remark that both the gapless and gapped data arise in different real-life applications.