Abstract
Constructing minimum ultrametric trees from distance matrices is an important problem in computational biology. In this paper, we examine its computational complexity and approximability. When the distances satisfy the triangle inequalities, we show that the minimum ultrametric tree problem can be approximated in polynomial time with error ratio 1.5(1 + ⌈log n⌉), where n is the number of species. We also developed an efficient branch and bound algorithm for constructing the minimum ultrametric tree for both metric and nonmetric inputs. The experimental results show that it can find an optimal solution for 25 species within reasonable time, while, to the best of our knowledge, there is no report of algorithms solving the problem even for 12 species.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
H.J. Bandelt, Recognition of tree metrics, SIAM Journal on Discrete Mathematics., 3(1)1–6, 1990.
E. Dahlhaus, Fast parallel recognition of ultrametrics and tree metrics, SIAM Journal on Discrete Mathematics, 6(4):523–532, 1993.
W.H.E. Day, Computationally difficult parsimony problems in phylogenetic systematics, Journal of theoretic Biology, 103:429–438, 1983.
W.H.E. Day, D.S. Johnson and D. Sankoff, The computational complexity of inferring rooted phylogenies by parsimony, Mathematical Biosciences 81:33–42, 1986.
W.H.E. Day, Computational complexity of inferring phylogenies from dissimilarity matrices, Bulletin of Mathematical Biology, 49(4): 461–467, 1987.
M. Farach, S. Kannan, and T. Warnow, A robust model for finding optimal evolutionary trees, Algorithmica, 13:155–179, 1995.
W.M. Fitch, A non-sequential method for constructing trees and hierarchical classifications, Journal of Molecular Evolution, 18:30–37, 1981.
L.R. Foulds and R.L. Graham, The Steiner problem in phylogeny is NP-complete, Advances in Applied Mathematics, 3:43–49, 1982.
L.R. Foulds, Maximum savings in the Steiner problem in phylogeny, Journal of theoretic Biology, 107:471–474, 1984.
M.R. Garey and D.S. Johnson, Computers and Intractability: A guide to the theory of NP-Completeness, W.H.Freeman and Company, San Fransisco, 1979.
D. Gusfield, Algorithms on Strings, Trees, and Sequences, computer science and computational biology, Cambridge University Press, 1997.
M.D. Hendy and D. Penny, Branch and bound algorithms to determine minimal evolutionary trees, Mathematical Biosciences, 59:277–290, 1982.
M. Krivanek, The complexity of ultrametric partitions on graph, Information Processing Letter, 27(5):265–270, 1988.
W.H. Li and D. Graur, Fundamentals of Molecular Evolution, Sinauer Associates, INC. 1991.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Wu, B.Y., Chao, KM., Tang, C.Y. (1998). Approximation and Exact Algorithms for Constructing Minimum Ultrametric Trees from Distance Matrices. In: Hsu, WL., Kao, MY. (eds) Computing and Combinatorics. COCOON 1998. Lecture Notes in Computer Science, vol 1449. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-68535-9_34
Download citation
DOI: https://doi.org/10.1007/3-540-68535-9_34
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-64824-6
Online ISBN: 978-3-540-68535-7
eBook Packages: Springer Book Archive