Bulletin of Mathematical Biology

, Volume 51, Issue 5, pp 597–603 | Cite as

An optimal algorithm to reconstruct trees from additive distance data

  • Jotun J. Hein


In this article the question of reconstructing a phylogeny from additive distance data is addressed. Previous algorithms used the complete distance matrix of then OTUs (Operational Taxonomic Unit), that corresponds to the tips of the tree. This usedO(n 2) computing time. It is shown that this is wasteful for biologically reasonable trees. If the tree has internal nodes with degrees that are bounded onO(n*log(n)) algorithm is possible. It is also shown if the nodes can have unbounded degrees the problem hasn 2 as lower bound.


Reference Sequence Internal Node Operational Taxonomic Unit Pairwise Distance Deep Point 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. Buneman, P. 1971. “The Recovery of Trees from Measures of Dissimilarity.” In:Mathematics in the Archaeological and Historical Sciences, F.R. Hodson, D.G. Kendall and P. Tautu (Eds), pp. 387–395. Edinburgh University Press.Google Scholar
  2. Hein, J.J. 1988. “A Fast Tree Reconstruction Method.”Molec. biol. Evol., submitted.Google Scholar
  3. Hendy, M.D., C.H.C. Little and D. Penny. (1984). “Comparing Trees with Pendant Vertices Labelled.”SIAM J. appl. Math. 44, 1054–1065.MATHMathSciNetCrossRefGoogle Scholar
  4. Waterman, M.S., T.F. Smith, M. Singh and W.A. Beyer. 1977. Additive Evolutionary Trees.”J. theor. Biol. 64, 199–213.MathSciNetCrossRefGoogle Scholar

Copyright information

© Society for Mathematical Biology 1989

Authors and Affiliations

  • Jotun J. Hein
    • 1
  1. 1.Center for Molecular GeneticsUCSDLa JollaUSA

Personalised recommendations