Checking Pedigree Consistency with PCS

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. Key words: Boolean satisfiability, SAT, Pedigree Consistency checking, bioinformatics, genetics, computational biology

• Type: Conference
• Year: 2007
• Where: TACAS
• Authors: Panagiotis Manolios, Marc Galceran Oms, Sergi Oliva Valls
• Keywords: Algorithms, Boolean Satisfiability, Many Important Problems, Problems, TACAS 2007