Carregant...
Carregant...

Vés al contingut (premeu Retorn)

Simple and efficient tree pattern matching

Autor
Valiente, G.
Tipus d'activitat
Document cientificotècnic
Data
2000-12
Codi
R00-72
Repositori
http://hdl.handle.net/2117/97540 Obrir en finestra nova
Resum
A simple and efficient algorithm for an extension of the subtree isomorphism problem is presented that computes a certificate for each rooted subtree of a given forest, thereby partitioning the set of rooted subtrees into isomorphism equivalence classes. The partitioning can be used to find all occurrences of a pattern tree in a text tree, or even all occurrences of every subtree of a pattern in a text, and the algorithm handles multiple pattern trees and also multiple text trees. The method com...
Citació
Valiente, G. "Simple and efficient tree pattern matching". 2000.
Paraules clau
Combinatorial problems, Design and analysis of algorithms, Graph algorithms, Pattern matching, Subtree isomorphism, Tree isomorphism, Tree pattern matching
Grup de recerca
ALBCOM - Algorismia, Bioinformàtica, Complexitat i Mètodes Formals

Participants

Arxius