title: Efficiently computing the Robinson-Foulds metric.
abstract: 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, in sublinear time and with high probability, a (1 + epsilon) approximation of the true RF metric. 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 complement our algorithm by presenting an efficient embedding procedure, thereby resolving an open issue from the preliminary version of this paper. We have also improved the performance of Day's (exact) algorithm in practice by using techniques discovered while implementing our approximation scheme. Indeed, we give a unified framework for edge-based tree algorithms in which implementation tradeoffs are clear. Finally, we present detailed experimental results illustrating the precision and running-time tradeoffs as well as demonstrating the speed of our approach. Our new implementation, FastRF, is available as an open-source tool for phylogenetic analysis.
authors: Department of Computer Science, University of New Mexico, Albuquerque, NM, USA.
authors: Nicholas D
authors: ND
authors: Pattengale
authors: Eric J
authors: EJ
authors: Gottlieb
authors: Bernard M E
authors: BM
authors: Moret
mesh_terms: D000465:Algorithms; D019295:Computational Biology; D030562:Databases, Protein; D019143:Evolution, Molecular; D010802:Phylogeny; D011506:Proteins / Q000737:chemistry / Q000145:classification / Q000235:genetics*; D012984:Software
chemical_list: D011506:Proteins