Summary
The problem of determining the minimal phylogenetic tree is discussed in relation to graph theory. It is shown that this problem is an example of the Steiner problem in graphs which is to connect a set of points by a minimal length network where new points can be added. There is no reported method of solving realistically-sized Steiner problems in reasonable computing time. A heuristic method of approaching the phylogenetic problem is presented, together with a worked example with 7 mammalian cytochrome c sequences. It is shown in this case that the method develops a phylogenetic tree that has the smallest possible number of amino acid replacements. The potential and limitations of the method are discussed. It is stressed that objective methods must be used for comparing different trees. In particular it should be determined how close a given tree is to a mathematically determined lower bound. A theorem is proved which is used to establish a lower bound on the length of any tree and if a tree is found with a length equal to the lower bound, then no shorter tree can exist.
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
References
Baird, R.C., Eckardt, M.J. (1972). Syst. Zool.21, 80–90
Boulter, D., Ramshaw, J.A.M., Thompson, E.W., Richardson, M., Brown, R.M. (1972). Proc. R. Soc. Lond. B.181, 441–455
Camin, J.H., Sokal, R.R. (1965). Evolution19, 311–326
Christofides, N. (1975). Graph Theory: an Algorithmic Approach. 1st ed. New York: Academic Press
Dayhoff, M.D. (1969). Atlas of Protein Sequence and Structure4, National Biomedical Foundation, Silver Spring, Md.
Dayhoff, M.O. (1972). Atlas of Protein Sequence and Structure.5, National Biomedical Research Foundation Silver Spring, Md.
Dreyfus, S.E., Wagner, R.A. (1971). Networks.1, 195–214
Eck, R.V., Dayhoff, M.O. (1966). Atlas of Protein Sequence and Structure 1966, National Biomedical Research Foundation Silver Spring, Md.
Estabrook, G.F. (1968). J. Theor. Biol.21, 421–438
Farris, J.S. (1970). Syst. Zool.19, 83–92
Farris, J.S. (1972). Am. Nat.,106, 645–668
Farris, J.S., Kluge, A.G., Eckardt, M.J. (1970). Syst. Zool.19, 172–189
Fitch, W.M. (1971). Syst. Zool.20, 406–416
Fitch, W.M. (1973). J. Mol. Evol.2, 123–136
Fitch, W.M. (1975). Proceedings of the eighth International Conference on Numerical Taxonomy, Ed. G.F. Estabrooks, Freeman, San Francisco, pp. 189–230
Fitch, W.M. (1976). J. Mol. Evol.8, 13–40
Fitch, W.M. (1977). Amer. Nat.III, 223–258
Fitch, W.M., Margoliash, E. (1967). Science155, 279–284
Fitch, W.M., Farris, J.S. (1974). J. Mol. Evol.3, 263
Hakimi, S.L. (1972). Networks,1, 113–131
Harary, F. (1969). Graph Theory 1st ed. Reading, Massachusetts, Addison-Wesley
Hartigan, J.A. (1973). Biometrics.29, 53–65
Kevin, V., Whitney, M. (1972). Comm. of A.C.M.15, 273
Kluge, A.G., Farris, J.S. (1969). Syst. Zool.18, 1–32
Kruskal, J.R. (1956). Proc. Amer. Math. Soc.7, 48–50
Moore, G.W., Barnabas, J., Goodman, M. (1973). J. Theor. Biol.38, 459–485
Peacock, D., Boulter, D. (1975). J. Mol. Biol.95, 513–527
Penny, D. (1974). J. Mol. Evol.3, 179–188
Penny, D. (1976). J. Mol. Evol.8, 95–116
Prim, R.C. (1957). Bell Syst. Tech. J.36, 1389–1401
Strydom, D.J., van der Walt, S.J., Botes, D.P. (1972). Comp. Biochem. Physiol.43B, 21–24
Wagner, W.H. (1959). IX Int. Botanical Congr. Montreal. 841–845
Watson, J.D. (1975). Molecular Biology of the Gene. 3rd ed. Menlo Park, Calif. W.A. Benjamin, Inc.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Foulds, L.R., Hendy, M.D. & Penny, D. A graph theoretic approach to the development of minimal phylogenetic trees. J Mol Evol 13, 127–149 (1979). https://doi.org/10.1007/BF01732868
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01732868