The balanced minimum evolution problem

DOI10.1287/IJOC.1110.0455zbMATH Open1461.92066OpenAlexW2141344305MaRDI QIDQ2815445FDOQ2815445

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

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

Recommendations

• A tutorial on the balanced minimum evolution problem
• A branch-price-and-cut algorithm for the minimum evolution problem
• The minimum evolution problem: Overview and classification
• Mathematical models to reconstruct phylogenetic trees under the minimum evolution criterion
• The minimum evolution problem in phylogenetics: polytopes, linear programming, and interpretation

zbMATH Keywords

combinatorial optimizationcomputational biologybalanced minimum evolutionnetwork designHuffman codingLagrangian relaxationcombinatorial inequalitiesKraft equality

Mathematics Subject Classification ID

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

Cites Work

• A note on the metric properties of trees
• Mathematical models to reconstruct phylogenetic trees under the minimum evolution criterion
• Cyclic permutations and evolutionary trees
• Title not available (Why is that?)
• The balanced minimum evolution problem
• Approximating the balanced minimum evolution problem
• A molecular sequence metric and evolutionary trees
• 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
• On the convex hull of Huffman trees
• The minimum evolution distance-based approach to phylogenetic inference
• The minimum evolution problem: Overview and classification

Cited In (18)

• On the balance of unrooted trees
• The minimum evolution problem in phylogenetics: polytopes, linear programming, and interpretation
• The balanced minimum evolution problem under uncertain data
• A massively parallel branch-\&-bound algorithm for the balanced minimum evolution problem
• Facets of the balanced minimal evolution polytope
• Approximating the balanced minimum evolution problem
• Heuristics for the phylogeny problem
• A branch-price-and-cut algorithm for the minimum evolution problem
• On the balanced minimum evolution polytope
• On the approximability of the fixed-tree balanced minimum evolution problem
• Level-1 phylogenetic networks and their balanced minimum evolution polytopes
• An information theory perspective on the balanced minimum evolution problem
• Enumerating vertices of the balanced minimum evolution polytope
• Split-facets for balanced minimal evolution polytopes and the permutoassociahedron
• Mathematical models to reconstruct phylogenetic trees under the minimum evolution criterion
• A tutorial on the balanced minimum evolution problem
• Compact mixed integer linear programming models to the minimum weighted tree reconstruction problem
• The balanced minimum evolution problem

Uses Software

• Concorde

This page was built for publication: The balanced minimum evolution problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2815445)