The Complexity of Checking Consistency of Pedigree Information and Related Problems
Consistency checking is a fundamental computational problem in genetics. Given a pedigree and information on the genotypes (of some) of the individuals in it, the aim of consistency checking is to determine whether these data are consistent with the classic Mendelian laws of inheritance. This problem arose originally from the geneticists’ need to filter their input data from erroneous information, and is well motivated from both a biological and a sociological viewpoint. This paper shows that consistency checking is NP-complete, even with focus on a single gene and in the presence of three alleles. Several other results on the computational complexity of problems from genetics that are related to consistency checking are also offered. In particular, it is shown that checking the consistency of pedigrees over two alleles, and of pedigrees without loops, can be done in polynomial time.
KeywordsPolynomial Time Consistency Check Conjunctive Normal Form Genotype Information Pedigree Analysis
Unable to display preview. Download preview PDF.
- 2.Aceto, L., Hansen, J.A., Ingólfsdóttir, A., Johnsen, J., Knudsen, J.: The complexity of checking consistency of pedigree information and related problems, Research Report RS–03–17, BRICS (2003), Available from http://www.brics.dk/RS/03/17/
- 4.Decode News Center (November 2001), http://www.decode.com/news/releases/
- 5.Gu, J., Purdom, P.W., Franco, J., Wah, B.W.: Algorithms for the satisfiability (SAT) problem: a survey. In: Satisfiability problem: theory and applications (Piscataway, NJ, 1996). DIMACS Ser. Discrete Math. Theoret. Comput. Sci, vol. 35, pp. 19–151. Amer. Math. Soc, Providence (1997)Google Scholar
- 7.Klug And, W.S., Cummings, M.R.: Concepts of Genetics, 5th edn. Prentice-Hall, Englewood Cliffs (1997)Google Scholar
- 8.Kruglyak, L., Daly, M.J., Reeve-Daly, M.P., Lander, E.S.: Parametric and nonparametric linkage analysis: A unified multipoint approach. American Journal of Human Genetics 58, 1347–1363 (1996)Google Scholar
- 9.Lange, K., Goradia, T.M.: An algorithm for automatic genotype elimination. American Journal of Human Genetics 40, 250–256 (1987)Google Scholar
- 13.Papadimitriou, C.H.: Computational Complexity. Addison-Wesley, Reading (1995)Google Scholar
- 14.Piccolboni, A., Gusfield, D.: On the complexity of fundamental computational problems in pedigree analysis, Tech. Rep. CSE-99-8, Computer Science Department, University of California, Davis (September 1999); Revised version to appear in the Journal of Computational BiologyGoogle Scholar
- 16.Strachan, T., Read, A.P.: Human Molecular Genetics 2. Wiley-Liss, Chichester (1999)Google Scholar