The balanced minimum evolution problem

DOI10.1287/IJOC.1110.0455MaRDI QIDQ2815445zbMATH OpenOpenAlexFDO

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

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)

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

Cites work

• scientific article; zbMATH DE number 1945176 (Why is no real title available?)
• A molecular sequence metric and evolutionary trees
• A note on the metric properties of trees
• Approximating the balanced minimum evolution problem
• Cyclic permutations and evolutionary trees
• Exact algorithms for minimum routing cost trees
• Mathematical models to reconstruct phylogenetic trees under the minimum evolution criterion
• On the convex hull of Huffman trees
• The Construction of Huffman Codes is a Submodular ("Convex") Optimization Problem Over a Lattice of Binary Trees
• The Mathematics of Phylogenomics
• The balanced minimum evolution problem
• The minimum evolution distance-based approach to phylogenetic inference
• The minimum evolution problem: Overview and classification

Cited in

(19)

• The minimum evolution problem in phylogenetics: polytopes, linear programming, and interpretation
• On the balance of unrooted trees
• The balanced minimum evolution problem under uncertain data
• Facets of the balanced minimal evolution polytope
• A massively parallel branch-\&-bound algorithm for the balanced minimum evolution problem
• 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
• Optimizing over path-length matrices of unrooted binary trees
• Enumerating vertices of the balanced minimum evolution polytope
• Split-facets for balanced minimal evolution polytopes and the permutoassociahedron
• A tutorial on the balanced minimum evolution problem
• Mathematical models to reconstruct phylogenetic trees under the minimum evolution criterion
• Compact mixed integer linear programming models to the minimum weighted tree reconstruction problem
• The balanced minimum evolution problem

Describes a project that uses

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)