The Balanced Minimum Evolution Problem

DOI10.1287/ijoc.1110.0455zbMath1461.92066OpenAlexW2141344305MaRDI QIDQ2815445

Raffaele Pesenti, Juan-José Salazar-González, Daniele Catanzaro, Martine Labbé

Publication date: 29 June 2016

Published in: INFORMS Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/64fd7e3db8c825c6480341e2a9ef7dd508cdbbc2

zbMATH Keywords

Lagrangian relaxationcombinatorial optimizationcombinatorial inequalitiesnetwork designcomputational biologybalanced minimum evolutionHuffman codingKraft equality

Mathematics Subject Classification ID

Problems related to evolution (92D15) Mixed integer programming (90C11) Linear programming (90C05)

Related Items (14)

Split-facets for balanced minimal evolution polytopes and the permutoassociahedron ⋮ Facets of the balanced minimal evolution polytope ⋮ A branch-price-and-cut algorithm for the minimum evolution problem ⋮ A tutorial on the balanced minimum evolution problem ⋮ An information theory perspective on the balanced minimum evolution problem ⋮ A massively parallel branch-\&-bound algorithm for the balanced minimum evolution problem ⋮ Approximating the balanced minimum evolution problem ⋮ The balanced minimum evolution problem under uncertain data ⋮ Compact mixed integer linear programming models to the minimum weighted tree reconstruction problem ⋮ Enumerating vertices of the balanced minimum evolution polytope ⋮ On the approximability of the fixed-tree balanced minimum evolution problem ⋮ The Balanced Minimum Evolution Problem ⋮ Level-1 phylogenetic networks and their balanced minimum evolution polytopes ⋮ On the balanced minimum evolution polytope

Uses Software

• Concorde

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Approximating the balanced minimum evolution problem
• A note on the metric properties of trees
• Cyclic permutations and evolutionary trees
• A molecular sequence metric and evolutionary trees
• The Balanced Minimum Evolution Problem
• The Mathematics of Phylogenomics
• The Construction of Huffman Codes is a Submodular ("Convex") Optimization Problem Over a Lattice of Binary Trees
• Exact algorithms for minimum routing cost trees
• The minimum evolution problem: Overview and classification
• Mathematical models to reconstruct phylogenetic trees under the minimum evolution criterion

This page was built for publication: The Balanced Minimum Evolution Problem