Approximating geodesic tree distance

  title={Approximating geodesic tree distance},
  author={Nina Amenta and Matthew Godwin and Nicolay Postarnakevich and Katherine St. John},
  journal={Inf. Process. Lett.},
Billera, Holmes, and Vogtmann introduced an intriguing new phylogenetic tree metric for weighted trees with useful properties related to statistical analysis. However, the best known algorithm for calculating this distance is exponential in the number of leaves of the trees compared. We point out that lower and upper bounds for this distance, which can be calculated in linear time, can differ by at most a multiplicative factor of √ 2. © 2007 Published by Elsevier B.V. 

From This Paper

Figures, tables, and topics from this paper.


Publications citing this paper.


Publications referenced by this paper.
Showing 1-10 of 13 references

Subtree Transfer Operations and their Induced Metrics on Evolutionary Trees

Benjamin L. Allen Mike Steel
View 4 Excerpts
Highly Influenced

On computing the nearest neighbor interchange distance

Discrete Mathematical Problems with Medical Applications • 1999
View 4 Excerpts
Highly Influenced


D. L. Swofford
Phylogenetic Analysis Using Parsimony (*and Other Methods). Version 4, Sinauer Associates, Sunderland, MA, 2002. c tree distance, Information Processing Letters • 2007
View 3 Excerpts
Highly Influenced

The parsimony ratchet

K. C. Nixon
a new method for rapid parsimony analysis, Cladistics 15 • 1999
View 2 Excerpts
Highly Influenced

Optimal algorithms for comparing trees with labeled leaves

W.H.E. Day
J. Classification 2 (1) • 1985
View 3 Excerpts
Highly Influenced


J. P. Huelsenbeck
Ronquist, MrBayes: Bayesian inference of phylogeny • 2001

Similar Papers

Loading similar papers…