Computing All Subtree Repeats in Ordered Ranked Trees
- Cite this paper as:
- Christou M. et al. (2011) Computing All Subtree Repeats in Ordered Ranked Trees. In: Grossi R., Sebastiani F., Silvestri F. (eds) String Processing and Information Retrieval. SPIRE 2011. Lecture Notes in Computer Science, vol 7024. Springer, Berlin, Heidelberg
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.