An \(O(n \log n)\) Time Algorithm for Computing the Path-Length Distance Between Trees
- 41 Downloads
Tree comparison metrics have proven to be an invaluable aide in the reconstruction and analysis of phylogenetic (evolutionary) trees. The path-length distance between trees is a particularly attractive measure as it reflects differences in tree shape as well as differences between branch lengths. The distance equals the sum, over all pairs of taxa, of the squared differences between the lengths of the unique path connecting them in each tree. We describe an \(O(n \log n)\) time for computing this distance, making extensive use of tree decomposition techniques introduced by Brodal et al. (Algorithmica 38(2):377–395, 2004).
KeywordsPhylogeny Tree comparison metrics Path-length metric Tree decomposition
Mathematics Subject Classification68Q25 92D15 05CO5
This research was made possible due to travel funds made available from a Marsden Grant to DB. Both authors thank David Swofford for help finding an error in an earlier version of Proposition 1.
- 6.Farris, J.S.: A successive approximations approach to character weighting. Syst. Biol. 18(4), 374–385 (1969)Google Scholar
- 9.Holmes, S.: Statistical approach to tests involving phylogenies. In: Gascuel, O. (ed.) Mathematics of Phylogeny and Evolution, chap. 4, pp. 91–117. New York: Oxford University Press (2005)Google Scholar
- 14.Swofford, D.L.: When are phylogeny estimates from molecular and morphological data incongruent? In: Miyamoto, M.M., Cracraft, J. (eds.) Phylogenetic Analysis of DNA Sequences, pp. 295–333. Oxford University Press, Oxford (1991)Google Scholar