Algorithmic Aspects of tree amalgamation (2000)
AuthorsSteel, M., Bocker, S., Dress, A.W.M.show all
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 collections of trees.
CitationSteel, M., Bocker, S., Dress, A.W.M. (2000) Algorithmic Aspects of tree amalgamation. Journal of Algorithms, 37, pp. 522--37.
This citation is automatically generated and may be unreliable. Use as a guide only.