Loading...
Loading...

Go to the content (press return)

An algebraic view of the relation between largest common subtrees and smallest common supertrees

Author
Rosselló, F. A.; Valiente, G.
Type of activity
Report
Date
2004-12
Code
LSI-04-60-R
Repository
http://hdl.handle.net/2117/87254 Open in new window
Abstract
The relationship between two important problems in tree pattern matching, the largest common subtree and the smallest common supertree of two trees, is established by means of simple constructions, which allow one to obtain the largest common subtree from the smallest common supertree, and vice versa. These constructions are given for the problems of isomorphic, homeomorphic, topological, and minor embeddings. They can be implemented by a straightforward extension of any algorithm that solves on...
Citation
Rosselló, F., Valiente, G. "An algebraic view of the relation between largest common subtrees and smallest common supertrees". 2004.
Keywords
Largest common subtree, Minor containment, Pullback, Pushout, Smallest common supertree, Subtree homeomorphism, Subtree isomorphism, Topological embedding, Tree pattern matching
Group of research
ALBCOM - Algorithms, Computational Biology, Complexity and Formal Methods

Participants

Attachments