TY - GEN
T1 - Tree indexing by pushdown automata and subtree repeats
AU - Flouri, Tomáš
AU - Iliopoulos, Costas S.
AU - Janoušek, Jan
AU - Melichar, Bořivoj
AU - Pissis, Solon P.
PY - 2011/12/14
Y1 - 2011/12/14
N2 - We consider the problem of finding all subtree repeats in a given unranked ordered tree. We show a new, elegant, and simple method, which is based on the construction of a tree indexing structure called the subtree pushdown automaton. We propose a solution for computing all subtree repeats from the deterministic subtree pushdown automaton constructed over the subject tree. The method we present is directly analogous to the relationship between string deterministic suffix automata and factor repeats in a given string.
AB - We consider the problem of finding all subtree repeats in a given unranked ordered tree. We show a new, elegant, and simple method, which is based on the construction of a tree indexing structure called the subtree pushdown automaton. We propose a solution for computing all subtree repeats from the deterministic subtree pushdown automaton constructed over the subject tree. The method we present is directly analogous to the relationship between string deterministic suffix automata and factor repeats in a given string.
UR - http://www.scopus.com/inward/record.url?scp=83155184693&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=83155184693&partnerID=8YFLogxK
M3 - Conference contribution
AN - SCOPUS:83155184693
SN - 9781457700415
T3 - 2011 Federated Conference on Computer Science and Information Systems, FedCSIS 2011
SP - 899
EP - 902
BT - 2011 Federated Conference on Computer Science and Information Systems, FedCSIS 2011
T2 - 2011 Federated Conference on Computer Science and Information Systems, FedCSIS 2011
Y2 - 18 September 2011 through 21 September 2011
ER -