Pages that link to "Item:Q1091978"
From MaRDI portal
The following pages link to Computational complexity of inferring phylogenies from dissimilarity matrices (Q1091978):
Displaying 15 items.
- Optimality of the neighbor joining algorithm and faces of the balanced minimum evolution polytope (Q263784) (← links)
- An \(O(n)\) algorithm for finding an optimal position with relative distances in an evolutionary tree (Q290256) (← links)
- Facets of the balanced minimal evolution polytope (Q304049) (← links)
- On the edge \(l_{\infty }\) radius of Saitou and Nei's method for phylogenetic reconstruction (Q861287) (← links)
- A lower bound on the edge \(l_{\infty }\) radius of Saitou and Nei's method for phylogenetic reconstruction (Q1041756) (← links)
- Inferring evolutionary trees with strong combinatorial evidence (Q1575435) (← links)
- \(l_\infty\)-approximation via subdominants. (Q1599172) (← links)
- UPGMA and the normalized equidistant minimum evolution problem (Q1704587) (← links)
- Compact mixed integer linear programming models to the minimum weighted tree reconstruction problem (Q1752190) (← links)
- Testing metric properties (Q1877548) (← links)
- A robust model for finding optimal evolutionary tree (Q1902471) (← links)
- The minimum evolution problem: Overview and classification (Q5191134) (← links)
- Mathematical models to reconstruct phylogenetic trees under the minimum evolution criterion (Q5191135) (← links)
- Steiner tree problems (Q5966604) (← links)
- Tropical medians by transportation (Q6126667) (← links)
