Skip to main content
SpringerLink
Log in

An efficient algorithm for supertrees

  • Published:
Journal of Classification Aims and scope Submit manuscript

Abstract

Givenk rooted binary treesA 1, A2, ..., Ak, with labeled leaves, we generateC, a unique system of lineage constraints on common ancestors. We then present an algorithm for constructing the set of rooted binary treesB, compatible with all ofA 1, A2, ..., Ak. The running time to obtain one such supertree isO(k 2 n2), wheren is the number of distinct leaves in all of the treesA 1, A2, ..., Ak.

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

References

  • AHO, A., SAGI, Y., SZYMANSKI, T. G., and ULLMAN, J. D. (1981), “Inferring a Tree from Lowest Common Ancestors with an Application to the Optimization of Relational Expressions,”Journal of Computing, 3, 405–421.

    Google Scholar 

  • CAYLEY, A. (1881), “On the Analytical Forms Called Trees,” AmericanMathematical Journal, 4, 266–268.

    Google Scholar 

  • CONSTATINESCU, M., and SANKOFF, D. (1986), “Tree Enumeration Modulo a Consensus,”Journal of Classification, 3, 349–356.

    Google Scholar 

  • DE SOETE, G., CARROLL, J. D., and DESARBO, W. S. (1987), “Least Squares Algorithms for Constructing Constrained Ultrametric and Additive Tree Representation of Symmetric Proximity Data,”Journal of Classification, 4, 155–173.

    Google Scholar 

  • GORDON, A. D. (1986), “Consensus Supertrees: The Synthesis of Rooted Trees Containing Overlapping Sets of Labeled Leaves,”Journal of Classification, 3, 335–348.

    Google Scholar 

  • GRAY, M. W., SANKOFF, D., and CEDERGREN, R. J. (1984), “On the Evolutionary Descent of Organisma and Organelles: A Global Phylogeny Based on a Highly Conserved Structural Core in Small Subunit Ribosomal RNA,”Nucleic Acids Research, 12, 5837–5852.

    Google Scholar 

  • SANKOFF, D., CEDERGREN, R. J., and MCKAY, W. (1982), “A Strategy for Sequence Phylogeny Research,”Nucleic Acid Research, 10, 421–431.

    Google Scholar 

Download references

Author information

Author notes

  1. Mariana Constantinescu

    Present address: Départment d'Informatique, Université de Moncton, E1A 3E9, Moncton, (Nouveau Brunswick), Canada

  2. David Sankoff

    Present address: Centre de Recherches Mathématiques, Université de Montréal, C. P., Succ. A, H3C 3J7, Montréal, (Quebec), Canada

Authors and Affiliations

    Authors
    1. Mariana Constantinescu
      View author publications

      You can also search for this author in PubMed Google Scholar

    2. David Sankoff
      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

    Constantinescu, M., Sankoff, D. An efficient algorithm for supertrees. Journal of Classification 12, 101–112 (1995). https://doi.org/10.1007/BF01202270

    Download citation

    • Issue Date:

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

    Keywords

    Search

    Navigation