SAT in bioinformatics: Making the case with haplotype inference

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4121 LNCS, Issue , 2006, Pages 136-141

  Lynce, Inès ^a   Marques Silva, João ^b  

^a INESC ID   (Portugal)

^b UNIVERSITY OF SOUTHAMPTON   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL METHODS; DNA; INTEGER PROGRAMMING; MATHEMATICAL MODELS; OPTIMIZATION; PROBLEM SOLVING;

BIOINFORMATICS; HAPLOTYPE INFERENCE BY PURE PARSIMONY (HIPP); SINGLE NUCLEOTIDE POLYMORPHISMS (SNP);

BIOMEDICAL ENGINEERING;

EID: 33749572045     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11814948_16     Document Type: Conference Paper

References (10)

1. D. Brown and I. Harrower. A new integer programming formulation for the pure parsimony problem in haplotype analysis. In Workshop on Algorithms in Bioinformatics (WABI'04), 2004.
2. D. Brown and I. Harrower. Integer programming approaches to haplotype inference by pure parsimony. IEEE/ACM Transactions on Computational Biology and Bioinformatics, 3(2):141-154, April-June 2006.
3. N. Eén and N. Sörensson. An extensible SAT-solver. In International Conference on Theory and Applications of Satisfiability Testing (SAT), pages 502-518, 2003.
4. A. Frisch, B. Hnich, Z. Kiziltan, I. Miguel, and T. Walsh. Global constraints for lexicographic orderings. In International Conference on Principles and Practice of Constraint Programming (CP), 2002.
5. D. Gusfield. Haplotype inference by pure parsimony. In 14th Annual Symposium on Combinatorial Pattern Matching (CPM'03), pages 144-155, 2003.
6. R. R. Hudson. Generating samples under a wright-fisher neutral model of genetic variation. Bioinformatics, 18(2):337-338, February 2002.
7. G. Lancia, C. M. Pinotti, and R. Rizzi. Haplotyping populations by pure parsimony: complexity of exact and approximation algorithms. INFORMS Journal on Computing, 16(4):348-359, 2004.
8. I. Lynce and J. Marques-Silva. Efficient haplotype inference with Boolean satisfiability. In National Conference on Artificial Intelligence (AAAI), July 2006.
9. M. J. Rieder, S. T. Taylor. A. G. Clark, and D. A. Nickerson. Sequence variation in the human angiotensin converting enzyme. Nature Genetics, 22:481-494, 2001.
10. L. Wang and Y. Xu. Haplotype inference by maximum parsimony. Bioinformatics, 19(14):1773-1780, 2003.