Algorithmic Aspects of Tree Amalgamation

Sebastian Böcker, David Bryant, Andreas W.M. Dress, Mike A. Steel
2000 Journal of Algorithms  
The amalgamation of leaf-labelled trees into a single (super)tree that "displays" each of the input trees is an important problem in classification. We discuss various approaches to this problem and show that a simple and well known polynomial-time algorithm can be used to solve this problem whenever the input set of trees contains a minimum size subset that uniquely determines the supertree. Our results exploit a recently established combinatorial property concerning the structure of such
more » ... ctions of trees. 1991 Mathematics Subject Classification. 05C05, 92D15
doi:10.1006/jagm.2000.1116 fatcat:czowd7gcefflfag2ca5vn64ghy