Free Online Productivity Tools
i2Speak
i2Symbol
i2OCR
iTex2Img
iWeb2Print
iWeb2Shot
i2Type
iPdf2Split
iPdf2Merge
i2Bopomofo
i2Arabic
i2Style
i2Image
i2PDF
iLatex2Rtf
Sci2ools

FUIN

2010

2010

Given a set of taxa S and a complete set of quartet topologies Q over S, the problem of determining a phylogeny that satisﬁes the maximum number of topologies is called the Maximum Quartet Consistency (MQC) problem. The MQC problem is an NP-problem. MQC has been solved both heuristically and exactly. Exact solutions for MQC include Constraint Programming, Answer Set Programming and Pseudo-Boolean Optimization (PBO). This paper extends the range of solutions for MQC, by developing two new PBO models and also by introducing models based on the optimization of Satisﬁability Modulo Theories (SMT). The models were experimentally compared with existing exact solutions. The results show that for instances with small percentage of quartet errors, the models based on SMT can be competitive, whereas for instances with higher number of quartet errors the PB-models are more eﬃcient.

Related Content

Added |
25 Jan 2011 |

Updated |
25 Jan 2011 |

Type |
Journal |

Year |
2010 |

Where |
FUIN |

Authors |
António Morgado, João Marques-Silva |

Comments (0)