Graph-Based Algorithms for Boolean Function Manipulation
IEEE Transactions on Computers
On the complexity of protein folding (extended abstract)
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Efficient rule-based haplotyping algorithms for pedigree data
RECOMB '03 Proceedings of the seventh annual international conference on Research in computational molecular biology
Finding Consistent Gene Transmission Patterns on Large and Complex Pedigrees
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Complexity and approximation of the minimum recombinant haplotype configuration problem
Theoretical Computer Science
Inferring Pedigree Graphs from Genetic Distances
IEICE - Transactions on Information and Systems
Mendelian error detection in complex pedigrees using weighted constraint satisfaction techniques
Proceedings of the 2007 conference on Artificial Intelligence Research and Development
Exploiting problem structure for solution counting
CP'09 Proceedings of the 15th international conference on Principles and practice of constraint programming
Complexity and approximation of the minimum recombination haplotype configuration problem
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
On counting the number of consistent genotype assignments for pedigrees
FSTTCS '05 Proceedings of the 25th international conference on Foundations of Software Technology and Theoretical Computer Science
Genetic linkage analysis algorithms and their implementation
Transactions on Computational Systems Biology III
An Abstract Interpretation framework for genotype elimination algorithms
Theoretical Computer Science
Efficient Genotype Elimination via Adaptive Allele Consolidation
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
| Hi-index | 0.00 |
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.