HashRF

Phylogenetic reconstruction techniques are primarily based on computational heuristics and often produce a large number of candidate evolutionary trees. It is necessary to have an efficient method to take these trees as input and return the relationship among them. We design a hash-based algorithm to compute the all-to-all Robinson-Foulds (RF) distance, the most popular measure used for comparing phylogenetic trees.

For more information

See the Wiki tab for more information.

For details

• Seung-Jin Sul, Tiffani L. Williams: An Experimental Analysis of Robinson-Foulds Distance Matrix Algorithms (ESA 2008), pp. 793-804.
• Seung-Jin Sul and Tiffani L. Williams, "A Randomized Algorithm for Comparing Sets of Phylogenetic Trees," Asia- Pacific Bioinformatics Conference (APBC'07), pp. 121- 130.