Complexity and Approximation of the Minimum Recombination Haplotype Configuration Problem

We study the complexity and approximation of the problem of reconstructing haplotypes from genotypes on pedigrees under the Mendelian Law of Inheritance and the minimum recombinant principle (MRHC). First, we show that MRHC for simple pedigrees where each member has at most one mate and at most one child (i.e. binary-tree pedigrees) is NP-hard. Second, we present some approximation results for the MRHC problem, which are the first approximation results in the literature to the best of our knowledge. We prove that MRHC on two-locus pedigrees or binary-tree pedigrees with

• Type: Conference
• Year: 2005
• Where: ISAAC
• Authors: Lan Liu, Xi Chen, Jing Xiao, Tao Jiang
• Keywords: Binary-tree Pedigrees, ISAAC 2005, Mendelian Law, Minimum Recombinant Principle