The minimum evolution problem: Overview and classification

DOI10.1002/net.20280zbMath1168.92036OpenAlexW4249467803WikidataQ124796534 ScholiaQ124796534MaRDI QIDQ5191134

Daniele Catanzaro

Publication date: 28 July 2009

Published in: Networks (Search for Journal in Brave)

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

zbMATH Keywords

network designcomputational biologyordinary least squaresweighted least squaresminimum evolutionphylogenetic estimation

Mathematics Subject Classification ID

Trees (05C05) Problems related to evolution (92D15) Applications of graph theory (05C90) Applications of mathematical programming (90C90) Numerical optimization and variational techniques (65K10) Biochemistry, molecular biology (92C40)

Related Items (13)

A tutorial on the balanced minimum evolution problem ⋮ Topology reconstruction using time series data in telecommunication networks ⋮ UPGMA and the normalized equidistant minimum evolution problem ⋮ PULLPRU: a practical approach to estimate phylogenies from single nucleotide polymorphism haplotypes under the maximum parsimony criterion ⋮ The balanced minimum evolution problem under uncertain data ⋮ The pure parsimony haplotyping problem: overview and computational advances ⋮ Compact mixed integer linear programming models to the minimum weighted tree reconstruction problem ⋮ Enumerating vertices of the balanced minimum evolution polytope ⋮ Mathematical models to reconstruct phylogenetic trees under the minimum evolution criterion ⋮ On the approximability of the fixed-tree balanced minimum evolution problem ⋮ The Balanced Minimum Evolution Problem ⋮ On the balanced minimum evolution polytope ⋮ Fishing for minimum evolution trees with neighbor-nets

Uses Software

• fastDNAml
• PAUP*
• BIONJ
• METREE

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Minimum evolution using ordinary least-squares is less robust than neighbor-joining
• The full Steiner tree problem
• Computational complexity of inferring phylogenies from dissimilarity matrices
• A fast algorithm for constructing trees from distance matrices
• The performance of neighbor-joining methods of phylogenetic reconstruction
• Unlikelihood that minimal phylogenies for a realistic biological study can be constructed in reasonable computational time
• Approximation and exact algorithms for constructing minimum ultrametric trees from distance matrices
• Performance analysis of hierarchical clustering algorithms
• On the consistency of the minimum evolution principle of phylogenetic inference
• Cyclic permutations and evolutionary trees
• A robust model for finding optimal evolutionary tree
• An algorithm for the fitting of a tree metric according to a weighted least-squares criterion
• A molecular sequence metric and evolutionary trees
• A reduction algorithm for approximating a (nonmetric) dissimilarity by a tree distance
• On the Full and Bottleneck Full Steiner Tree Problems
• Unrooted trees for numerical taxonomy
• Iterative projection strategies for the least‐squares fitting of tree structures to proximity data
• Research in Computational Molecular Biology
• Algorithms and Computation

This page was built for publication: The minimum evolution problem: Overview and classification