A novel approach to phylogenetic trees: d‐Dimensional geometric Steiner trees
From MaRDI portal
Publication:5191133
DOI10.1002/net.20279zbMath1168.92035OpenAlexW4255784761WikidataQ61714620 ScholiaQ61714620MaRDI QIDQ5191133
Christian Wulff-Nilsen, Pawel Winter, Benny K. Nielsen, Marcus Brazil, Martin Zachariasen, Doreen Anne Thomas
Publication date: 28 July 2009
Published in: Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/net.20279
Multivariate analysis (62H99) Trees (05C05) Problems related to evolution (92D15) Distance in graphs (05C12)
Related Items (8)
Mixed integer nonlinear optimization models for the Euclidean Steiner tree problem in \(\mathbb{R}^d\) ⋮ Approximate Euclidean Steiner trees ⋮ Integer models and upper bounds for the 3‐club problem ⋮ Probability Steiner trees and maximum parsimony in phylogenetic analysis ⋮ A new second‐order conic optimization model for the Euclidean Steiner tree problem in Rd$\mathbb {R}^d$ ⋮ A new heuristic for the Euclidean Steiner tree problem in \(\mathbb{R}^n\) ⋮ Euclidean Steiner trees optimal with respect to swapping 4-point subtrees ⋮ Insight into the computation of Steiner minimal trees in Euclidean space of general dimension
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Optimal algorithms for comparing trees with labeled leaves
- Comparison of phylogenetic trees
- How to find Steiner minimal trees in Euclidean \(d\)-space
- The Steiner tree problem
- Weighted sequence graphs: Boosting iterated dynamic programming using locally suboptimal solutions
- Multidimensional scaling. I: Theory and method
This page was built for publication: A novel approach to phylogenetic trees: d‐Dimensional geometric Steiner trees
