Abstract
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 missing data cannot be approximated (the formal definition is given in section 1.2) unless P=NP. Next we show that MRHC on two-locus pedigrees without missing data cannot be approximated within any constant ratio under the Unique Games Conjecture and can be approximated within ratio O\((\sqrt{{\rm log}(n)})\). Our L-reduction for the approximation hardness gives a simple alternative proof that MRHC on two-locus pedigrees is NP-hard, which is much easier to understand than the original proof. We also show that MRHC for tree pedigrees without missing data cannot be approximated within any constant ratio under the Unique Games Conjecture, too. Finally, we explore the hardness and approximation of MRHC on pedigrees where each member has a bounded number of children and mates mirroring real pedigrees.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Li, J., Jiang, T.: Efficient rule-based haplotyping algorithm for pedigree data. In: Proc. of the 7th Annual Conference on Research in Computational Molecular Biology (RECOMB 2003), pp. 197–206 (2003)
Doi, K., Li, J., Jiang, T.: Minimum recombinant haplotype configuration on tree pedigrees. In: Benson, G., Page, R.D.M. (eds.) WABI 2003. LNCS (LNBI), vol. 2812, pp. 339–353. Springer, Heidelberg (2003)
Aceto, L., et al.: The complexity of checking consistency of pedigree information and related problems. J. Comp. Sci. Tech. 19(1), 42–59 (2004)
Khot, S.: On the power of 2-Prover 1-Round Games. In: Proc. of the 34th ACM Symposium on Theory of Computing (STOC 2002), pp. 767–775 (2002)
Agarwal, A., Charikar, M.: O(\(\sqrt{log(n)}\)) approximation algorithms for min UnCut, min 2CNF deletion, and directed cut problems. In: Proc. STOC 2005, pp. 573–581 (2005)
Ausiello, G., et al.: Complexity and approximation: combinatorial optimization problems and their approximability properties, pp. 276–279. Springer, Heidelberg (1999)
Jorde, L.: Where we are hot, they are not. Science 308, 60–62 (2005)
Li, L., Kim, J.H., Waterman, M.S.: Haplotype reconstruction from SNP alignment. In: Proc. RECOMB 2003, pp. 207–216 (2003)
Lippert, R., et al.: Algorithmic strategies for the single nucleotide polymorphism haplotype assembly problem. Briefings in Bioinformatics 3(1), 23–31 (2002)
Eskin, E., Halperin, E., Karp, R.M.: Large scale reconstruction of haplotypes from genotype data. In: Proc. RECOMB 2003, pp. 104–113 (2003)
Excoffier, L., Slatkin, M.: Maximum–likelihood estimation of molecular haplotype frequencies in a diploid population. Mol. Biol. Evol. 12, 921–927 (1995)
Seltman, H., Roeder, K., Devlin, B.: Transmission/disequilibrium test meets measured haplotype analysis: family-based association analysis guided by evolution of haplotypes. Am. J. Hum. Genet. 68(5), 1250–1263 (2001)
Zhang, S., et al.: Transmission/ disequilibrium test based on haplotype sharing for tightly linked markers. Am. J. Hum. Genet. 73(3), 556–579 (2003)
Li, J., Jiang, T.: An exact solution for finding minimum recombinant haplotype configurations on pedigrees with missing data by integer linear programming. In: Proc. RECOMB 2004, pp. 20–29 (2004)
O’Connell, J.R.: Zero-recombinant haplotyping: applications to fine mapping using SNPs. Genet. Epidemiol. 19(suppl. 1), S64–S70 (2000)
Qian, D., Beckmann, L.: Minimum-recombinant haplotyping in pedigrees. Am. J. Hum. Genet. 70(6), 1434–1445 (2002)
The International HapMap Consortium: The International HapMap Project. Nature 426, 789–796 (December 2003)
Papadimitriou, C.H., Yannakakis, M.: Optimization, Approximation, and Complexity Classes. J. Comp. System Sci., 425–440 (1991)
Stephens, M., Smith, N.J., Donnelly, P.: A new statistical method for haplotype reconstruction from population data. Am. J. Hum. Genet. 68(4), 978–989 (2001)
Schaefer, T.J.: The complexity of satisfiability problems. In: Proc. of the 10th STOC, pp. 216–226 (1978)
Li, J., Jiang, T.: Computing the Minimum Recombinant Haplotype Configuration from incomplete genotype data on a pedigree by integer linear programming. In: Proc. RECOMB 2004, pp. 20–29 (2004)
Available at, http://www.cs.ucr.edu/~lliu/App_MRHC.pdf
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Liu, L., Chen, X., Xiao, J., Jiang, T. (2005). Complexity and Approximation of the Minimum Recombination Haplotype Configuration Problem. In: Deng, X., Du, DZ. (eds) Algorithms and Computation. ISAAC 2005. Lecture Notes in Computer Science, vol 3827. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11602613_38
Download citation
DOI: https://doi.org/10.1007/11602613_38
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-30935-2
Online ISBN: 978-3-540-32426-3
eBook Packages: Computer ScienceComputer Science (R0)