Enumerating vertices of the balanced minimum evolution polytope

DOI10.1016/j.cor.2019.05.001zbMath1458.90639OpenAlexW2943904342WikidataQ127944239 ScholiaQ127944239MaRDI QIDQ2003580

Raffaele Pesenti, Daniele Catanzaro

Publication date: 9 July 2019

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2019.05.001

zbMATH Keywords

phylogeneticstree codesPrüfer codingparallel enumerationbalanced minimum evolution polytopeunrooted binary tree enumeration

Mathematics Subject Classification ID

Problems related to evolution (92D15) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Linear codes (general theory) (94B05) Combinatorial optimization (90C27)

Related Items (3)

A tutorial on the balanced minimum evolution problem ⋮ A massively parallel branch-\&-bound algorithm for the balanced minimum evolution problem ⋮ On the approximability of the fixed-tree balanced minimum evolution problem

Uses Software

• polymake

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Optimality of the neighbor joining algorithm and faces of the balanced minimum evolution polytope
• Facets of the balanced minimal evolution polytope
• Approximating the balanced minimum evolution problem
• Geometry of the space of phylogenetic trees
• The permutoassociahedron, Mac Lane's coherence theorem and asymptotic zones for the KZ equation
• Split-facets for balanced minimal evolution polytopes and the permutoassociahedron
• On coding labeled trees
• The Balanced Minimum Evolution Problem
• The Construction of Huffman Codes is a Submodular ("Convex") Optimization Problem Over a Lattice of Binary Trees
• Coxeter‐associahedra
• The minimum evolution problem: Overview and classification
• A Method for the Construction of Minimum-Redundancy Codes

This page was built for publication: Enumerating vertices of the balanced minimum evolution polytope