On the Complexity of Several Haplotyping Problems

We present several new results pertaining to haplotyping. The first set of results concerns the combinatorial problem of reconstructing haplotypes from incomplete and/or imperfectly sequenced haplotype data. More specifically, we show that an interesting, restricted case of Minimum Error Correction (MEC) is NP-hard, question earlier claims about a related problem, and present a polynomial-time algorithm for the ungapped case of Longest Haplotype Reconstruction (LHR). Secondly, we present a polynomial time algorithm for the problem of resolving genotype data using as few haplotypes as possible (the Pure Parsimony Haplotyping Problem, PPH) where each genotype has at most two ambiguous positions, thus solving an open problem posed by Lancia et al in [15].

• Type: Conference
• Year: 2005
• Where: WABI
• Authors: Rudi Cilibrasi, Leo van Iersel, Steven Kelk, John Tromp
• Keywords: Algorithms, Combinatorial Problem, Longest Haplotype Reconstruction, Parsimony Haplotyping Problem, WABI 2005