Checking pedigree consistency with PCS

Authors:
Panagiotis Manolios;Marc Galceran Oms;Sergi Oliva Valls
Affiliations:
College of Computing, Georgia Institute of Technology, Atlanta, Georgia;College of Computing, Georgia Institute of Technology, Atlanta, Georgia;College of Computing, Georgia Institute of Technology, Atlanta, Georgia
Venue:
TACAS'07 Proceedings of the 13th international conference on Tools and algorithms for the construction and analysis of systems
Year:
2007

Citing 3
Cited 0

Chaff: engineering an efficient SAT solver

Proceedings of the 38th annual Design Automation Conference
Validating SAT Solvers Using an Independent Resolution-Based Checker: Practical Implementations and Other Applications

DATE '03 Proceedings of the conference on Design, Automation and Test in Europe - Volume 1
Automatic memory reductions for RTL model verification

Proceedings of the 2006 IEEE/ACM international conference on Computer-aided design

Quantified Score

Hi-index	0.00

Visualization

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.