Skip to main content

Enumeration of binary phylogenetic trees

Contributed Papers

Part of the Lecture Notes in Mathematics book series (LNM,volume 884)

Abstract

Evolutionary trees of biology are represented by a special class of labelled trees, termed phylogenetic trees. These are characterised by having disjoint subsets of the labelling set assigned to the points of a tree, in such a way that no point of degree less than 3 is assigned an empty set of labels. By a binary tree is meant one in which every point has degree 1 or 3. The exact and asymptotic numbers of binary phylogenetic trees are determined under the presence or absence of two additional conditions on the labelling. The optional constraints studied require nonempty label sets to be singletons, and that only endpoints be labelled.

The second author is grateful for the support of the Australian Research Grants Committee for the project “Numerical Implementation of Unlabelled Graph Counting Algorithms”, under which research and computing for this paper were performed.

This is a preview of subscription content, access via your institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   34.99
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   46.00
Price excludes VAT (Canada)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. E.A. Bender, Asymptotic methods in enumeration, STAM Rev. 16 (1974), 485–515.

    MathSciNet  MATH  Google Scholar 

  2. L.L. Cavalli-Sforza and A.W.F. Edwards, Phylogenetic analysis. Models and estimation procedures, Amer. J. Human Genet. 19 (1967), 233–257 and Evolution 21 (1967), 550–570.

    Google Scholar 

  3. J. Felsenstein, The numbers of evolutionary trees, Syst. Zool. 27 (1978), 27–33.

    CrossRef  Google Scholar 

  4. L.R. Foulds, David Penny and M.D. Hendy, A Graph Theoretic Approach to the Development of Minimal Phylogenetic Trees, J. Mol. Evol. 13 (1979), 127–150.

    CrossRef  Google Scholar 

  5. L.R. Foulds and R.W. Robinson, Determining the asymptotic numbers of phylogenetic trees. Combinatorial Mathematics VII, Lecture Notes in Mathematics 829 (Springer, Berlin, 1980), 110–126.

    CrossRef  Google Scholar 

  6. F. Harary and E.M. Palmer, Graphical Enumeration (Academic Press, New York, 1973).

    MATH  Google Scholar 

  7. F. Harary, R.W. Robinson and A.J. Schwenk, Twenty step algorithm for determining the asymptotic number of trees of various species, J. Austral. Math. Soc. Ser. A 20 (1975), 483–503.

    CrossRef  MathSciNet  MATH  Google Scholar 

  8. E.F. Harding, The probabilities of rooted tree-shapes generated by random bifurcation, Adv. Appl. Prob. 3 (1971), 44–77.

    CrossRef  MathSciNet  MATH  Google Scholar 

  9. J.W. Moon, Various proofs of Cayley's formula for counting trees. A Seminar on Graph Theory (F. Harary, ed, Holt, Rinehart and Winston, New York, 1967), 70–78.

    Google Scholar 

  10. H. Prüfer, Neuer Beweis eines Satzes über Permutationen, Arch. Math. Phys., 27 (1918), 742–744.

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and Permissions

Copyright information

© 1981 Springer-Verlag

About this paper

Cite this paper

Foulds, L.R., Robinson, R.W. (1981). Enumeration of binary phylogenetic trees. In: McAvaney, K.L. (eds) Combinatorial Mathematics VIII. Lecture Notes in Mathematics, vol 884. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0091819

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-10883-2

  • Online ISBN: 978-3-540-38792-3

  • eBook Packages: Springer Book Archive