Computing All Subtree Repeats in Ordered Ranked Trees
We consider the problem of finding all subtree repeats in a given ordered ranked tree. Specifically, we transform the given tree to a string representing its postfix notation, and then propose an algorithm based on the bottom-up technique. The proposed algorithm is divided into two phases: the preprocessing phase, and the phase where all subtree repeats are computed. The linear runtime of the algorithm, as well as the use of linear auxiliary space, are important aspects of its quality.
Unable to display preview. Download preview PDF.
- 9.Janousek, J.: String suffix automata and subtree pushdown automata. In: Holub, J., Zdárek, J. (eds.) Stringology. pp. 160–172. Prague Stringology Club, Department of Computer Science and Engineering, Faculty of Electrical Engineering, Czech Technical University in Prague (2009)Google Scholar
- 12.Kuboyama, T.: Matching and Learning in Trees. Ph.D. thesis, University of Tokyo (2007)Google Scholar