Mostra el registre d'ítem simple
Tree edit distance and common subtrees
dc.contributor.author | Valiente Feruglio, Gabriel Alejandro |
dc.contributor.other | Universitat Politècnica de Catalunya. Departament de Ciències de la Computació |
dc.date.accessioned | 2016-11-30T16:31:58Z |
dc.date.available | 2016-11-30T16:31:58Z |
dc.date.issued | 2002-02 |
dc.identifier.citation | Valiente, G. "Tree edit distance and common subtrees". 2002. |
dc.identifier.uri | http://hdl.handle.net/2117/97554 |
dc.description.abstract | The relationship between tree edit distance and maximum common subtrees is established, showing that a tree edit distance constrained by insertion and deletions on leaves only and by a simple condition on the cost of the tree edit operations, corresponds to a maximum commonsubtree isomorphism, allowing thus the use of known tree edit distance algorithms to solve the maximum common subtree problem, and viceversa. Further, a tree distance based on the size of a maximum common subtree is introduced. |
dc.format.extent | 10 p. |
dc.language.iso | eng |
dc.relation.ispartofseries | LSI-02-20-R |
dc.subject | Àrees temàtiques de la UPC::Informàtica::Informàtica teòrica |
dc.subject.other | Tree edit distance |
dc.subject.other | Maximum common subtrees |
dc.subject.other | Tree isomorphism |
dc.subject.other | Graph algorithms |
dc.subject.other | Pattern matching |
dc.title | Tree edit distance and common subtrees |
dc.type | External research report |
dc.contributor.group | Universitat Politècnica de Catalunya. ALBCOM - Algorismia, Bioinformàtica, Complexitat i Mètodes Formals |
dc.rights.access | Open Access |
local.identifier.drac | 1890137 |
dc.description.version | Postprint (published version) |
local.citation.author | Valiente, G. |
Fitxers d'aquest items
Aquest ítem apareix a les col·leccions següents
-
Reports de recerca [139]
-
Reports de recerca [1.107]