The minimum evolution problem: Overview and classification
From MaRDI portal
Recommendations
- A tutorial on the balanced minimum evolution problem
- Mathematical models to reconstruct phylogenetic trees under the minimum evolution criterion
- Minimizing phylogenetic number to find good evolutionary trees
- Approximating the balanced minimum evolution problem
- A branch-price-and-cut algorithm for the minimum evolution problem
Cites work
- scientific article; zbMATH DE number 422784 (Why is no real title available?)
- scientific article; zbMATH DE number 3901889 (Why is no real title available?)
- scientific article; zbMATH DE number 1219584 (Why is no real title available?)
- scientific article; zbMATH DE number 1113975 (Why is no real title available?)
- scientific article; zbMATH DE number 1113977 (Why is no real title available?)
- scientific article; zbMATH DE number 1945176 (Why is no real title available?)
- scientific article; zbMATH DE number 2079368 (Why is no real title available?)
- A fast algorithm for constructing trees from distance matrices
- A molecular sequence metric and evolutionary trees
- A reduction algorithm for approximating a (nonmetric) dissimilarity by a tree distance
- A robust model for finding optimal evolutionary tree
- Algorithms and Computation
- An algorithm for the fitting of a tree metric according to a weighted least-squares criterion
- Approximation and exact algorithms for constructing minimum ultrametric trees from distance matrices
- Computational complexity of inferring phylogenies from dissimilarity matrices
- Cyclic permutations and evolutionary trees
- Iterative projection strategies for the least‐squares fitting of tree structures to proximity data
- Minimum evolution using ordinary least-squares is less robust than neighbor-joining
- On the consistency of the minimum evolution principle of phylogenetic inference
- On the full and bottleneck full Steiner tree problems
- Performance analysis of hierarchical clustering algorithms
- Research in Computational Molecular Biology
- The full Steiner tree problem
- 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
- Unrooted trees for numerical taxonomy
Cited in
(21)- scientific article; zbMATH DE number 5046597 (Why is no real title available?)
- The minimum evolution problem in phylogenetics: polytopes, linear programming, and interpretation
- The balanced minimum evolution problem under uncertain data
- The pure parsimony haplotyping problem: overview and computational advances
- Fishing for minimum evolution trees with neighbor-nets
- Approximating the balanced minimum evolution problem
- On the consistency of the minimum evolution principle of phylogenetic inference
- 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
- Robustness of Greedy Type Minimum Evolution Algorithms
- Topology reconstruction using time series data in telecommunication networks
- Optimizing over path-length matrices of unrooted binary trees
- Enumerating vertices of the balanced minimum evolution polytope
- Inference of phylogenetic trees
- UPGMA and the normalized equidistant minimum evolution problem
- 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
- PULLPRU: a practical approach to estimate phylogenies from single nucleotide polymorphism haplotypes under the maximum parsimony criterion
This page was built for publication: The minimum evolution problem: Overview and classification
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5191134)
