A `stochastic safety radius' for distance-based tree reconstruction
From MaRDI portal
(Redirected from Publication:289927)
Abstract: A variety of algorithms have been proposed for reconstructing trees that show the evolutionary relationships between species by comparing differences in genetic data across present-day taxa. If the leaf-to-leaf distances in a tree can be accurately estimated, then it is possible to reconstruct this tree from these estimated distances, using polynomial-time methods such as the popular `Neighbor-Joining' algorithm. There is a precise combinatorial condition under which distance-based methods are guaranteed to return a correct tree (in full or in part) based on the requirement that the input distances all lie within some `safety radius' of the true distances. Here, we explore a stochastic analogue of this condition, and mathematically establish upper and lower bounds on this `stochastic safety radius' for distance-based tree reconstruction methods. Using simulations, we show how this notion provides a new way to compare the performance of distance-based tree reconstruction methods. This may help explain why Neighbor-Joining performs so well, as its stochastic safety radius appears close to optimal (while its more classical safety radius is the same as many other less accurate methods).
Recommendations
Cites work
- scientific article; zbMATH DE number 46578 (Why is no real title available?)
- scientific article; zbMATH DE number 3591873 (Why is no real title available?)
- scientific article; zbMATH DE number 1113975 (Why is no real title available?)
- scientific article; zbMATH DE number 1945176 (Why is no real title available?)
- scientific article; zbMATH DE number 3243264 (Why is no real title available?)
- A reduction algorithm for approximating a (nonmetric) dissimilarity by a tree distance
- Comparison of phylogenetic trees
- Data model and classification by trees; The minimum variance reduction (MVR) method
- Determining the Evolutionary Tree Using Experiments
- Inferring evolutionary trees with strong combinatorial evidence
- Performance analysis of hierarchical clustering algorithms
- Robustness of phylogenetic inference based on minimum evolution
- Structuring causal trees
- The performance of neighbor-joining methods of phylogenetic reconstruction
- Why neighbor-joining works
Cited in
(6)- Spectral neighbor joining for reconstruction of latent tree models
- Phylogenetic placement problem: a hyperbolic embedding approach
- Towards optimal distance functions for stochastic substitution models
- A massively parallel branch-\&-bound algorithm for the balanced minimum evolution problem
- Comparing evolutionary distances via adaptive distance functions
- A tutorial on the balanced minimum evolution problem
This page was built for publication: A `stochastic safety radius' for distance-based tree reconstruction
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q289927)
