An Experimental Analysis of Robinson-Foulds Distance Matrix Algorithms

In this paper, we study two fast algorithms--HashRF and PGM-Hashed--for computing the Robinson-Foulds (RF) distance matrix between a collection of evolutionary trees. The RF distance matrix represents a tremendous data-mining opportunity for helping biologists understand the evolutionary relationships depicted among their trees. The novelty of our work results from using a variety of different architectureand implementation-independent measures (i.e., percentage of bipartition sharing, number of bipartition comparisons, and memory usage) in addition to CPU time to explore practical algorithmic performance. Overall, our study concludes that HashRF performs better across the various performance measures than its competitor, PGM-Hashed. Thus, the HashRF algorithm provides scientists with a fast approach for understanding the evolutionary relationships among a set of trees.

• Type: Conference
• Year: 2008
• Where: ESA
• Authors: Seung-Jin Sul, Tiffani L. Williams
• Keywords: Algorithms, Distance Matrix, ESA 2008, Evolutionary Relationships, RF Distance Matrix