Abstract
We present two algorithms for computing the quartet distance between trees of arbitrary degree. The quartet distance between two unrooted evolutionary trees is the number of quartets—sub-trees induced by four leaves—that differs between the trees. Previous algorithms focus on computing the quartet distance between binary trees. In this paper, we present two algorithms for computing the quartet distance between trees of arbitrary degrees. One in time O(n 3) and space O(n 2) and one in time O(n 2 d 2) and space O(n 2), where n is the number of species and d is the maximal degree of the internal nodes of the trees. We experimentally compare the two algorithms and discuss possible directions for improving the running time further.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Allen, B.L., Steel, M.: Subtree transfer operations and their induced metrics on evolutionary trees. Annals of Combinatorics 5, 1–13 (2001)
Berry, V., Bryant, D.: Faster reliable phylogenetic analysis. In: Proc. 3rd International Conference on Computational Molecular Biology, RECOMB (1999)
Brodal, G.S., Fagerberg, R., Pedersen, C.N.S.: Computing the quartet distance between evolutionary trees in time O(n logn). Algorithmica 38, 377–395 (2003)
Bryant, D., Moulton, V.: A polynomial time algorithm for constructing the refined buneman tree. Applied Mathematics Letters 12, 51–56 (1999)
Bryant, D., Tsang, J., Kearney, P.E., Li, M.: Computing the quartet distance between evolutionary trees. In: Proceedings of the 11th Annual Symposium on Discrete Algorithms (SODA), pp. 285–286 (2000)
Buneman, P.: The recovery of trees from measures of dissimilarity. In: Hodson, F., Kendall, D., Tautu, P. (eds.) Mathematics in Archaeological and Historical Sciences, pp. 387–395. Edinburgh University Press, Edinburgh (1971)
Estabrook, G., McMorris, F., Meacham, C.: Comparison of undirected phylogenetic trees based on subtrees of four evolutionary units. Syst. Zool. 34, 193–200 (1985)
Felsenstein, J.: Inferring Phylogenies. Sinauer Associates Inc. (2004)
Moulton, V., Steel, M.: Retractions of finite distance functions onto tree metrics. Discrete Applied Mathematics 91, 215–233 (1999)
Robinson, D.F., Foulds, L.R.: Comparison of weighted labelled trees. In: Combinatorial mathematics, VI (Proc. 6th Austral. Conf). Lecture Notes in Mathematics, pp. 119–126. Springer, Heidelberg (1979)
Robinson, D.F., Foulds, L.R.: Comparison of phylogenetic trees. Mathematical Biosciences 53, 131–147 (1981)
Steel, M., Penny, D.: Distribution of tree comparison metrics–some new results. Syst. Biol. 42(2), 126–141 (1993)
Waterman, M.S., Smith, T.F.: On the similarity of dendrograms. Journal of Theoretical Biology 73, 789–800 (1978)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Christiansen, C., Mailund, T., Pedersen, C.N.S., Randers, M. (2005). Computing the Quartet Distance Between Trees of Arbitrary Degree. In: Casadio, R., Myers, G. (eds) Algorithms in Bioinformatics. WABI 2005. Lecture Notes in Computer Science(), vol 3692. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11557067_7
Download citation
DOI: https://doi.org/10.1007/11557067_7
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-29008-7
Online ISBN: 978-3-540-31812-5
eBook Packages: Computer ScienceComputer Science (R0)