Approximation and Exact Algorithms for Constructing Minimum Ultrametric Trees from Distance Matrices

Journal of Combinatorial Optimization

Volumn 3, Issue 2-3, 1999, Pages 199-211

  Wu, Bang Ye ^a   Chao, Kun Mao ^b   Tang, Chuan Yi ^a  

^a NATIONAL TSING HUA UNIVERSITY   (Taiwan)

^b PROVIDENCE UNIVERSITY   (Taiwan)

Author keywords

Approximation algorithms; Branch and bound; Computational biology; Ultrametric trees

Indexed keywords

EID: 0041542956     PISSN: 13826905     EISSN: None     Source Type: Journal    
DOI: 10.1023/a:1009885610075     Document Type: Article

References (17)

1. H.J. Bandelt, "Recognition of tree metrics," SIAM Journal on Discrete Mathematics, vol. 3, no. 1, pp. 1-6, 1990.
2. N. Christofides, "Worst-case analysis of a new heuristic for the travelling salesman problem," Technique Report, Graduate School of Industrial Administration, Carnegie-Mellon University, Pittsburgh, PA, 1976.
3. E. Dahlhaus, "Fast parallel recognition of ultrametrics and tree metrics," SIAM Journal on Discrete Mathematics, vol. 6, no. 4, pp. 523-532, 1993.
4. W.H.E. Day, "Computationally difficult parsimony problems in phylogenetic systematics," Journal of Theoretic Biology, vol. 103, pp. 429-438, 1983.
5. W.H.E. Day, "Computational complexity of inferring phylogenies from dissimilarity matrices," Bulletin of Mathematical Biology, vol. 49, no. 4, pp. 461-467, 1987.
6. W.H.E. Day, D.S. Johnson, and D. Sankoff, "The computational complexity of inferring rooted phylogenies by parsimony," Mathematical Biosciences, vol. 81, pp. 33-42, 1986.
7. M. Farach, S. Kannan, and T. Warnow, "A robust model for finding optimal evolutionary trees," Algorithmica, vol. 13, pp. 155-179, 1995.
8. WM. Fitch, "A non-sequential method for constructing trees and hierarchical classifications," Journal of Molecular Evolution, vol. 18, pp. 30-37, 1981.
9. L.R. Foulds, "Maximum savings in the Steiner problem in phylogeny," Journal of Theoretic Biology, vol. 107, pp. 471-474, 1984.
10. L.R. Foulds and R.L. Graham, "The Steiner problem in phylogeny is NP-complete," Advances in Applied Mathematics, vol. 3, pp. 43-49, 1982.
11. M.R. Garey and D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, Freeman: San Fransisco, 1979.
12. D. Gusfield, Algorithms on Strings, Trees, and Sequences, Computer Science and Computational Biology, Cambridge University Press, 1997.
13. M.D. Hendy and D. Penny, "Branch and bound algorithms to determine minimal evolutionary trees," Mathematical Biosciences, vol. 59, pp. 277-290, 1982.
14. R.M. Karp, "Reducibility among combinatorial problems," in Complexity of Computer Computations, R.E. Miller and J.W. Thatcher (Eds.), Plenum Press: New York, 1972, pp. 85-103.
15. M. Krivanek, "The complexity of ultrametric partitions on graphs," Information Processing Letter, vol. 27, no. 5, pp. 265-270, 1988.
16. W.H. Li and D. Graur, Fundamentals of Molecular Evolution, Sinauer Associates, 1991.
17. C.L. Liu, Introduction to Combinatorial Mathematics, McGraw-Hill: New York, 1968.