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 architecture- and 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. © 2008 Springer-Verlag Berlin Heidelberg.
CITATION STYLE
Sul, S. J., & Williams, T. L. (2008). An experimental analysis of robinson-foulds distance matrix algorithms. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5193 LNCS, pp. 793–804). Springer Verlag. https://doi.org/10.1007/978-3-540-87744-8_66
Mendeley helps you to discover research relevant for your work.