Chapter

Theory and Applications of Satisfiability Testing - SAT 2006

Volume 4121 of the series Lecture Notes in Computer Science pp 136-141

SAT in Bioinformatics: Making the Case with Haplotype Inference

  • Inês LynceAffiliated withIST/INESC-ID, Technical University of Lisbon
  • , João Marques-SilvaAffiliated withSchool of Electronics and Computer Science, University of Southampton

* Final gross prices may vary according to local VAT.

Get Access

Abstract

Mutation in DNA is the principal cause for differences among human beings, and Single Nucleotide Polymorphisms (SNPs) are the most common mutations. Hence, a fundamental task is to complete a map of haplotypes (which identify SNPs) in the human population. Associated with this effort, a key computational problem is the inference of haplotype data from genotype data, since in practice genotype data rather than haplotype data is usually obtained. Recent work has shown that a SAT-based approach is by far the most efficient solution to the problem of haplotype inference by pure parsimony (HIPP), being several orders of magnitude faster than existing integer linear programming and branch and bound solutions. This paper proposes a number of key optimizations to the the original SAT-based model. The new version of the model can be orders of magnitude faster than the original SAT-based HIPP model, particularly on biological test data.