Mathematical models to reconstruct phylogenetic trees under the minimum evolution criterion
From MaRDI portal
Recommendations
Cites work
- A molecular sequence metric and evolutionary trees
- Chemical trees enumeration algorithms
- Computational complexity of inferring phylogenies from dissimilarity matrices
- scientific article; zbMATH DE number 1264488 (Why is no real title available?)
- scientific article; zbMATH DE number 1349588 (Why is no real title available?)
- Lower and upper bounds for the degree-constrained minimum spanning tree problem
- The minimum evolution problem: Overview and classification
Cited in
(16)- The reconstructed tree in the lineage-based model of protracted speciation
- 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 under uncertain data
- Dispersal routes reconstruction and the minimum cost arborescence problem
- A tutorial on the balanced minimum evolution problem
- The balanced minimum evolution problem
- A branch-price-and-cut algorithm for the minimum evolution problem
- A Mathematical Primer of Molecular Phylogenetics
- scientific article; zbMATH DE number 3963006 (Why is no real title available?)
- scientific article; zbMATH DE number 23012 (Why is no real title available?)
- scientific article; zbMATH DE number 1945176 (Why is no real title available?)
- The minimum evolution problem: Overview and classification
- Integer models and upper bounds for the 3-club problem
- Model to generate phylogenetic missing stages of dinosaurs
This page was built for publication: Mathematical models to reconstruct phylogenetic trees under the minimum evolution criterion
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5191135)