Mathematical models to reconstruct phylogenetic trees under the minimum evolution criterion

DOI10.1002/net.20281zbMath1168.92037OpenAlexW4232508923MaRDI QIDQ5191135

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

Publication date: 28 July 2009

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.20281

zbMATH Keywords

branch-and-boundnetwork designminimum evolution criterionphylogenetic estimation

Mathematics Subject Classification ID

Trees (05C05) Problems related to evolution (92D15) Applications of graph theory (05C90) Mixed integer programming (90C11) Biochemistry, molecular biology (92C40)

Related Items (8)

A branch-price-and-cut algorithm for the minimum evolution problem ⋮ Integer models and upper bounds for the 3‐club problem ⋮ A tutorial on the balanced minimum evolution problem ⋮ The balanced minimum evolution problem under uncertain data ⋮ Binary Steiner trees: structural results and an exact solution approach ⋮ Compact mixed integer linear programming models to the minimum weighted tree reconstruction problem ⋮ Recognizing Helly edge-path-tree graphs and their clique graphs ⋮ The Balanced Minimum Evolution Problem

Uses Software

• fastDNAml

Cites Work

• Computational complexity of inferring phylogenies from dissimilarity matrices
• Chemical trees enumeration algorithms
• A molecular sequence metric and evolutionary trees
• Lower and upper bounds for the degree-constrained minimum spanning tree problem
• The minimum evolution problem: Overview and classification
• Unnamed Item
• Unnamed Item

This page was built for publication: Mathematical models to reconstruct phylogenetic trees under the minimum evolution criterion