Facets of the balanced minimal evolution polytope
Related Experiment Video
Updated: Mar 28, 2026

Protein WISDOM: A Workbench for In silico De novo Design of BioMolecules
Published on: July 25, 2013
Stefan Forcey1, Logan Keefe2, William Sands2
1Department of Mathematics, The University of Akron, Akron, OH, 44325-4002, USA. sf34@uakron.edu.
Abstract:
The balanced minimal evolution (BME) method of creating phylogenetic trees can be formulated as a linear programming problem, minimizing an inner product over the vertices of the BME polytope. In this paper we undertake the project of describing the facets of this polytope. We classify and identify the combinatorial structure and geometry (facet inequalities) of all the facets in dimensions up to five, and classify even more facets in all dimensions. A full set of facet inequalities would allow a full implementation of the simplex method for finding the BME tree-although there are reasons to think this an unreachable goal. However, our results provide the crucial first steps for a more likely-to-be-successful program: finding efficient relaxations of the BME polytope.
Related Concept Videos
Synthetic Disvision of Polynomials
Plastic Deformations of Members with a Single Plane of Symmetry
Routh-Hurwitz Criterion II
The first scenario occurs when a singular zero appears in the first column of the Routh table. This situation creates a division by zero issues. To resolve this, a small positive or negative number, denoted as epsilon (∈), is substituted for the zero. The stability analysis proceeds by assuming a sign for ∈. If ∈ is positive, any sign change in the first...
Normal and Tangetial Components: Problem Solving
Routh-Hurwitz Criterion I
To apply the Routh-Hurwitz criterion, a Routh table is constructed. The table's rows are labeled with powers of the complex frequency variable s, starting from the...
Geometry of Hyperbolas

