Carregant...
Carregant...

Vés al contingut (premeu Retorn)

Constrained tree inclusion

Autor
Valiente, G.
Tipus d'activitat
Document cientificotècnic
Data
2003-03
Codi
LSI-03-11-R
Repositori
http://hdl.handle.net/2117/97378 Obrir en finestra nova
Resum
The tree matching problem is considered of given labeled trees P and T, determining if the pattern tree P can be obtained from the text tree T by deleting degree-one and degree-two nodes and, in the case of unordered trees, by also permuting siblings. The constrained tree inclusion problem is more sensitive to the structure of the pattern tree than the general tree inclusion problem. Further, it can be solved in polynomial time for both unordered and ordered trees. Algorithms based on the subtre...
Citació
Valiente, G. "Constrained tree inclusion". 2003.
Paraules clau
Constrained tree inclusion, Noncrossing bipartite matching, Pattern tree inclusion, Subtree homeomorphism, Tree pattern matching
Grup de recerca
ALBCOM - Algorismia, Bioinformàtica, Complexitat i Mètodes Formals

Participants

Arxius