The balanced minimum evolution problem under uncertain data
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 1945176 (Why is no real title available?)
- A Benders decomposition approach for the robust spanning tree problem with interval data
- A molecular sequence metric and evolutionary trees
- A robust model for finding optimal evolutionary tree
- Approximating the balanced minimum evolution problem
- Mathematical models to reconstruct phylogenetic trees under the minimum evolution criterion
- On the complexity of the robust spanning tree problem with interval data
- Robust discrete optimization and its applications
- 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 problem: Overview and classification
- The robust shortest path problem with interval data via Benders decomposition
- The robust spanning tree problem with interval data
Cited in
(4)
This page was built for publication: The balanced minimum evolution problem under uncertain data
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2446823)