Journal of Classification

, Volume 12, Issue 1, pp 101–112

An efficient algorithm for supertrees

  • Mariana Constantinescu
  • David Sankoff

DOI: 10.1007/BF01202270

Cite this article as:
Constantinescu, M. & Sankoff, D. Journal of Classification (1995) 12: 101. doi:10.1007/BF01202270


Givenk rooted binary treesA1, 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 ofA1, A2, ..., Ak. The running time to obtain one such supertree isO(k2 n2), wheren is the number of distinct leaves in all of the treesA1, A2, ..., Ak.


Tree compatibility Constraints on trees Supertrees Consensus trees 

Copyright information

© Springer-Verlag 1995

Authors and Affiliations

  • Mariana Constantinescu
    • 1
  • David Sankoff
    • 2
  1. 1.Départment d'InformatiqueUniversité de MonctonMonctonCanada
  2. 2.Centre de Recherches MathématiquesUniversité de Montréal, C. P., Succ. AMontréalCanada