Faster Phylogenetic Inference with MXG

We apply the logic-based declarative programming approach of Model Expansion (MX) to a phylogenetic inference task. We axiomatize the task in multi-sorted first-order logic with cardinality constraints. Using the model expansion solver MXG and SAT+cardinality solver MXC, we compare the performance of several MX axiomatizations on a challenging set of test instances. Our methods perform orders of magnitude faster than previously reported declarative solutions. Our best solution involves polynomial-time pre-processing, redundant axioms, and symmetry-breaking axioms. We also discuss our method of test instance generation, and the role of pre-processing in declarative programming.

[1]  D. Penny,et al.  Branch and bound algorithms to determine minimal evolutionary trees , 1982 .

[2]  Ján Manuch,et al.  Constructing Camin-Sokal Phylogenies Via Answer Set Programming , 2006, LPAR.

[3]  Hector J. Levesque,et al.  Some Pitfalls for Experimenters with Random SAT , 1996, Artif. Intell..

[4]  Esra Erdem,et al.  Reconstructing the Evolutionary History of Indo-European Languages Using Answer Set Programming , 2003, PADL.

[5]  Inês Lynce,et al.  Efficient Haplotype Inference with Boolean Satisfiability , 2006, AAAI.

[6]  Gang Wu,et al.  Quartet based phylogeny reconstruction with answer set programming , 2004, 16th IEEE International Conference on Tools with Artificial Intelligence.

[7]  Esra Erdem,et al.  Character-Based Cladistics and Answer Set Programming , 2005, PADL.

[8]  Niklas Sörensson,et al.  An Extensible SAT-solver , 2003, SAT.

[9]  Andrew Hayes,et al.  Comparative genomic hybridization provides new insights into the molecular taxonomy of the Saccharomyces sensu stricto complex. , 2004, Genome research.

[10]  David S. Johnson,et al.  The computational complexity of inferring rooted phylogenies by parsimony , 1986 .

[11]  Jia-Huai You,et al.  Quartet-Based Phylogeny Reconstruction with Answer Set Programming , 2007, TCBB.

[12]  DAVID MITCHELL,et al.  Model Expansion as a Framework for Modelling and Solving Search Problems , 2007 .

[13]  Yuliya Lierler,et al.  Cmodels-2: SAT-based Answer Set Solver Enhanced to Non-tight Programs , 2004, LPNMR.

[14]  Ján Manuch,et al.  Characterization of the Existence of Galled-Tree Networks , 2006, APBC.

[15]  T. Kuroiwa,et al.  Phylogeny of Plastids Based on Cladistic Analysis of Gene Loss Inferred from Complete Plastid Genome Sequences , 2003, Journal of Molecular Evolution.

[16]  Martin Gebser,et al.  clasp : A Conflict-Driven Answer Set Solver , 2007, LPNMR.

[17]  Frank Wolter,et al.  Monodic fragments of first-order temporal logics: 2000-2001 A.D , 2001, LPAR.

[18]  Detlef Weigel,et al.  Opsin gene duplication and diversification in the guppy, a model for sexual selection , 2007, Proceedings of the Royal Society B: Biological Sciences.