Recent News
UNM Engineering names Prabhakar inaugural Cleve Moler and MathWorks Endowed Chair
October 3, 2025
Computer scientist wins Athlete of the Year Award for adaptive skiing technique
May 29, 2025
Hand and Machine Lab wins 2 awards at CHI conference
May 15, 2025
News Archives
A Sublinear-Time Randomized Approximation Scheme for the Robinson-Foulds Metric
January 24, 2006
- Date: Tuesday, January 24, 2006
- Time: 11:00 am — 12:15 pm.
- Place: Woodward 149
Nick Pattengale
Department of Computer Science, UNM and Sandia National Labs
The Robinson-Foulds (RF) metric is the measure most widely used in comparing phylogenetic trees; it can be computed in linear time using Day’s algorithm. When faced with the need to compare large numbers of large trees, however, even linear time becomes prohibitive. We present a randomized approximation scheme that provides, with high probability, a (1+epsilon) approximation of the true RF metric for all pairs of trees in a given collection. Our approach is to use a sublinear-space embedding of the trees, combined with an application of the Johnson-Lindenstrauss lemma to approximate vector norms very rapidly. We discuss the consequences of various parameter choices (in the embedding and in the approximation requirements). We also implemented our algorithm as a Java class that can easily be combined with popular packages such as Mesquite; in consequence, we present experimental results illustrating the precision and running-time tradeoffs as well as demonstrating the speed of our approach.