On the Balanced Minimum Evolution polytope

Abstract Recent advances on the polyhedral combinatorics of the Balanced Minimum Evolution Problem (BMEP) enabled the characterization of a number of facets of its convex hull (also referred to as the BMEP polytope) as well as the discovery of connections between this polytope and the permutoassociahedron. In this article, we extend these studies, by presenting new results concerning some fundamental characteristics of the BMEP polytope, new facet-defining inequalities in the case of six or more taxa, a number of valid inequalities, and a polynomial time oracle to recognize its vertices. Our aim is to broaden understanding of the polyhedral combinatorics of the BMEP with a view to developing new and more effective exact solution algorithms.

[1]  Daniele Catanzaro,et al.  Estimating Phylogenies from Molecular Data , 2010, Mathematical Approaches to Polymer Sequence Analysis and Related Problems.

[2]  P. Erdös,et al.  A few logs suffice to build (almost) all trees (l): part I , 1997 .

[3]  Olivier Gascuel,et al.  Mathematics of Evolution and Phylogeny , 2005 .

[4]  Douglas Stott Parker,et al.  The Construction of Huffman Codes is a Submodular ("Convex") Optimization Problem Over a Lattice of Binary Trees , 1999, SIAM J. Comput..

[5]  Jan Karel Lenstra,et al.  The complexity of the network design problem , 1978, Networks.

[6]  D. Huffman.  A Method for the Construction of Minimum-Redundancy Codes , 1952 .

[7]  William Sands,et al.  Facets of the balanced minimal evolution polytope , 2016, Journal of mathematical biology.

[8]  Ruriko Yoshida,et al.  Optimality of the Neighbor Joining Algorithm and Faces of the Balanced Minimum Evolution Polytope , 2010, Bulletin of mathematical biology.

[9]  Marco Di Summa,et al.  Optimal solutions for the balanced minimum evolution problem , 2011, Comput. Oper. Res..

[10]  Daniele Catanzaro,et al.  A note on trees, tables, and algorithms , 2009 .

[11]  Mikhail Kapranov,et al.  The permutoassociahedron, Mac Lane's coherence theorem and asymptotic zones for the KZ equation , 1993 .

[12]  Frank Harary,et al.  Graph Theory , 2016 .

[13]  Samuel Fiorini,et al.  Approximating the balanced minimum evolution problem , 2012, Oper. Res. Lett..

[14]  Laurence A. Wolsey,et al.  Integer and Combinatorial Optimization , 1988 .

[15]  Y. Pauplin.  Direct Calculation of a Tree Length Using a Distance Matrix , 2000, Journal of Molecular Evolution.

[16]  O. Gascuel,et al.  Neighbor-joining revealed. , 2006, Molecular biology and evolution.

[17]  Michael Joswig,et al.  polymake: a Framework for Analyzing Convex Polytopes , 2000 .

[18]  Louis J. Billera,et al.  Geometry of the Space of Phylogenetic Trees , 2001, Adv. Appl. Math..

[19]  W. A. Beyer,et al.  Additive evolutionary trees. , 1977, Journal of theoretical biology.

[20]  O. Gascuel,et al.  Theoretical foundation of the balanced minimum evolution method of phylogenetic inference and its relationship to weighted least-squares tree fitting. , 2003, Molecular biology and evolution.

[21]  Juan José Salazar González,et al.  The Balanced Minimum Evolution Problem , 2012, INFORMS J. Comput..

[22]  Khalid Sayood,et al.  Introduction to Data Compression , 1996 .

[23]  William Sands,et al.  Split-Facets for Balanced Minimal Evolution Polytopes and the Permutoassociahedron , 2016, Bulletin of mathematical biology.

[24]  Lior Pachter,et al.  On the optimality of the neighbor-joining algorithm , 2007, Algorithms for Molecular Biology.