Skip to main content
SpringerLink
Log in

Numbering binary trees with labeled terminal vertices

  • Published:
Bulletin of Mathematical Biology Aims and scope Submit manuscript

Abstract

For each rooted binary tree witht labeled terminal vertices (leaves) a natural number can be assigned uniquely. Unrooted trees witht labeled terminal vertices andt-2 unlabeled internal vertices of degree 3 can also be numbered uniquely using the same convention. Rooted trees in which the hights of the internal vertices are rank ordered are also considered. Applications to problems in taxonomy are discussed.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Literature

  • Bobisud, H. M. and L. E. Bobisud. 1972. “A Metric for Classifications.”Taxon 21, 607–613.

    Article  Google Scholar 

  • Day, W. H. E. 1980. “A New Approach to Constructing Tree Metrics.” Technical Report No. 8001. Department of Computer Science, Memorial University of Newfoundland, St. John's, Newfoundland, Canada, 14pp.

    Google Scholar 

  • Edwards, A. W. F. and L. L. Cavalli-Sforza. 1964. Reconstruction of Evolutionary Trees. In:Phenetic and Phylogenetic Classification, W. H. Heywood and J. McNeil, pp. 67–76. Systematics Association Publication No. 6, London.

  • Felsenstein, J. 1978. “The Number of Evolutionary Trees.”Syst. Zool. 27, 27–33.

    Article  Google Scholar 

  • Frank, O. and K. Svensson. 1981. “On Probability Distributions of Single-Linkage Dendrograms.”J. statist. Comput. Simul. 12, 121–131.

    MATH  MathSciNet  Google Scholar 

  • Göbel, F. 1980. “On a 1-1-Correspondence between Rooted Trees and Natural Numbers.”J. Combinatorial Theory, Series B 29, 141–143.

    Article  MATH  Google Scholar 

  • Knott, G. D. 1977. “A Numbering System for Binary Trees.”Communs. Ass. comput. Mach. 20, 113–115.

    MATH  Google Scholar 

  • Knuth, D. E. 1973.The Art of Computer Programming, Vol. 1, 2nd edition. Reading: Addison-Wesley. 634 pp.

    Google Scholar 

  • Phipps, J. B. 1976. “The Numbers of Classifications.”Can. J. Bot. 54, 686–688.

    Article  Google Scholar 

  • Proskurowski, A. 1980. “On the Generation of Binary Trees.”J. Ass. comput. Mach. 27, 1–2.

    MathSciNet  Google Scholar 

  • Rotem, D. and Y. L. Varol. 1978. “Generation of Binary Trees from Ballot Sequences.”J. Ass. comput. Machs. 25, 396–404.

    MATH  MathSciNet  Google Scholar 

  • Sneath, P. H. A. and R. R. Sokal. 1973.Numerical Taxonomy. San Francisco: W. H. Freeman. 573 pp.

    MATH  Google Scholar 

  • Solomon, M. and R. A. Finkel. 1980. “A Note on Enumerating Binary Trees.”J. Ass. comput. Mach. 27, 3–5.

    MathSciNet  Google Scholar 

Download references

Author information

Author notes

  1. F. James Rohlf

    Present address: Department of Ecology and Evolution, State University of New York, 11794, Stony Brook, NY, U.S.A.

Authors and Affiliations

  1. Mathematical Sciences Department, IBM T. J. Watson Research Center, P. O. Box 218, 10598, Yorktown Heights, NY, U.S.A.

    F. James Rohlf

Authors
  1. F. James Rohlf
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

James Rohlf, F. Numbering binary trees with labeled terminal vertices. Bltn Mathcal Biology 45, 33–40 (1983). https://doi.org/10.1007/BF02459385

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02459385

Keywords

Search

Navigation