Algorithmic Aspects of Tree Amalgamation

Böcker S, Bryant D, Dress A, Steel MA (2000)
Journal of Algorithms 37(2): 522-537.

Zeitschriftenaufsatz | Veröffentlicht | Englisch
 
Download
Es wurden keine Dateien hochgeladen. Nur Publikationsnachweis!
Autor*in
Böcker, Sebastian; Bryant, David; Dress, AndreasUniBi; Steel, Mike A.
Abstract / Bemerkung
The amalgamation of leaf-labeled 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. (C) 2000 Academic Press.
Stichworte
dyadic closure; tree amalgamation; algorithms; trees
Erscheinungsjahr
2000
Zeitschriftentitel
Journal of Algorithms
Band
37
Ausgabe
2
Seite(n)
522-537
ISSN
0196-6774
Page URI
https://pub.uni-bielefeld.de/record/1618684

Zitieren

Böcker S, Bryant D, Dress A, Steel MA. Algorithmic Aspects of Tree Amalgamation. Journal of Algorithms. 2000;37(2):522-537.
Böcker, S., Bryant, D., Dress, A., & Steel, M. A. (2000). Algorithmic Aspects of Tree Amalgamation. Journal of Algorithms, 37(2), 522-537. https://doi.org/10.1006/jagm.2000.1116
Böcker, S., Bryant, D., Dress, A., and Steel, M. A. (2000). Algorithmic Aspects of Tree Amalgamation. Journal of Algorithms 37, 522-537.
Böcker, S., et al., 2000. Algorithmic Aspects of Tree Amalgamation. Journal of Algorithms, 37(2), p 522-537.
S. Böcker, et al., “Algorithmic Aspects of Tree Amalgamation”, Journal of Algorithms, vol. 37, 2000, pp. 522-537.
Böcker, S., Bryant, D., Dress, A., Steel, M.A.: Algorithmic Aspects of Tree Amalgamation. Journal of Algorithms. 37, 522-537 (2000).
Böcker, Sebastian, Bryant, David, Dress, Andreas, and Steel, Mike A. “Algorithmic Aspects of Tree Amalgamation”. Journal of Algorithms 37.2 (2000): 522-537.

Export

Markieren/ Markierung löschen
Markierte Publikationen

Open Data PUB

Web of Science

Dieser Datensatz im Web of Science®

Suchen in

Google Scholar