Approximating geodesic tree distance

  • Authors:
  • Nina Amenta;Matthew Godwin;Nicolay Postarnakevich;Katherine St. John

  • Affiliations:
  • Computer Science Department, University of California, Davis, 2063 Engineering II, One Sheilds Ave, Davis, CA 95616, USA;Computer Science Department, University of California, Davis, 2063 Engineering II, One Sheilds Ave, Davis, CA 95616, USA;Computer Science Department, University of California, Davis, 2063 Engineering II, One Sheilds Ave, Davis, CA 95616, USA;Department of Mathematics & Computer Science, Lehman College--City University of New York, Bronx, NY 12581, USA and Computer Science Department, CUNY Graduate Center, New York, NY 10016, USA

  • Venue:
  • Information Processing Letters
  • Year:
  • 2007

Quantified Score

Hi-index 0.90

Visualization

Abstract

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.