Computing all subtree repeats in ordered ranked trees

Authors:
Michalis Christou;Maxime Crochemore;Tomáš Flouri;Costas S. Iliopoulos;Jan Janoušek;Bořivoj Melichar;Solon P. Pissis
Affiliations:
Dept. of Informatics, King's College London, UK;Dept. of Informatics, King's College London, UK and Université Paris-Est, France;Dept. of Theoretical Computer Science, Czech Technical University in Prague, Czech Republic;Dept. of Informatics, King's College London, UK and Digital Ecosystems & Business Intelligence Institute, Curtin University, Perth, Australia;Dept. of Theoretical Computer Science, Czech Technical University in Prague, Czech Republic;Dept. of Theoretical Computer Science, Czech Technical University in Prague, Czech Republic;Dept. of Informatics, King's College London, UK
Venue:
SPIRE'11 Proceedings of the 18th international conference on String processing and information retrieval
Year:
2011

Citing 10
Cited 1

Analytic variations on the common subexpression problem

Proceedings of the seventeenth international colloquium on Automata, languages and programming
On finding common subtrees

Theoretical Computer Science
Faster tree pattern matching

Journal of the ACM (JACM)
Variations on the Common Subexpression Problem

Journal of the ACM (JACM)
Pattern Matching in Trees

Journal of the ACM (JACM)
Rapid identification of repeated patterns in strings, trees and arrays

STOC '72 Proceedings of the fourth annual ACM symposium on Theory of computing
Algorithms for pattern matching and discovery in RNA secondary structure

Theoretical Computer Science - Pattern discovery in the post genome
Compilers: Principles, Techniques, and Tools (2nd Edition)

Compilers: Principles, Techniques, and Tools (2nd Edition)
Efficient tree pattern matching

SFCS '89 Proceedings of the 30th Annual Symposium on Foundations of Computer Science
Arbology: trees and pushdown automata

LATA'10 Proceedings of the 4th international conference on Language and Automata Theory and Applications

Computing all subtree repeats in ordered trees

Information Processing Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.