Abstract
Many important problems in bioinformatics and genetics require analyses that are NP-complete. For example, one of the basic problems facing researchers that analyze pedigrees—data that represents relationships and genetic traits of a set of individuals—is evaluating whether they are consistent with the Mendelian laws of inheritance. This problem is NP-complete and several specialized algorithms have been devised to solve the types of problems occurring in practice efficiently. In this paper, we present PCS, a tool based on Boolean Satisfiability (SAT) that is orders of magnitude faster than existing algorithms, and more general. In fact, PCS can solve real pedigree checking problems that cannot be solved with any other existing tool.
This research was funded in part by NSF grants CCF-0429924, IIS-0417413, and CCF-0438871.
Chapter PDF
Similar content being viewed by others
Keywords
References
Aceto, L., et al.: The complexity of checking consistency of pedigree information and related problems. In: Blundo, C., Laneve, C. (eds.) ICTCS 2003. LNCS, vol. 2841, pp. 174–187. Springer, Heidelberg (2003)
de Givry, S., et al.: Mendelian error detection in complex pedigree using weighted constraint satisfaction techniques. In: ICLP-05 workshop on Constraint Based Methods for Bioinformatics, Sitges, Spain (2005)
Lange, K., Goradia, T.: An algorithm for automatic genotype elimination. American Journal of Human Genetics 40(3), 250–256 (1987)
Manolios, P., Oms, M.G., Valls, S.O.: PCS: Pedigree Checking with SAT (2007), Available from http://www.cc.gatech.edu/~manolios/pcs/
Manolios, P., Srinivasan, S.K., Vroon, D.: Automatic memory reductions for RTL-level verification. In: ACM-IEEE International Conference on Computer Aided Design (ICCAD 2006) (November 2006)
Manolios, P., Srinivasan, S.K., Vroon, D.: BAT: The Bit-level Analysis Tool (2006), Available from http://www.cc.gatech.edu/~manolios/bat/
Moskewicz, M.W., et al.: Chaff: Engineering an efficient SAT solver. In: Design Automation Conference (DAC’01), pp. 530–535 (2001)
O’Connell, J.R., Weeks, D.E.: Pedcheck: A program for identification of genotype incompatibilities in linkage analysis. American Journal of Human Genetics 63(1), 259–266 (1998)
O’Connell, J.R., Weeks, D.E.: An optimal algorithm for automatic genotype elimination. American Journal of Human Genetics 65(6), 1733–1740 (1999)
Sobel, E., Papp, J.C., Lange, K.: Detection and integration of genotyping errors in statistical genetics. American Journal of Human Genetics 70, 496–508 (2002)
Zhang, L., Malik, S.: Validating SAT solvers using an independent resolution-based checker: Practical implementations and other applications. In: Proceedings of the Design and Test in Europe Conference, March 2003, pp. 10880–10885 (2003)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer Berlin Heidelberg
About this paper
Cite this paper
Manolios, P., Oms, M.G., Valls, S.O. (2007). Checking Pedigree Consistency with PCS. In: Grumberg, O., Huth, M. (eds) Tools and Algorithms for the Construction and Analysis of Systems. TACAS 2007. Lecture Notes in Computer Science, vol 4424. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-71209-1_26
Download citation
DOI: https://doi.org/10.1007/978-3-540-71209-1_26
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-71208-4
Online ISBN: 978-3-540-71209-1
eBook Packages: Computer ScienceComputer Science (R0)