Computing all subtree repeats in ordered trees

Authors:
Michalis Christou;Maxime Crochemore;Tomáš Flouri;Costas S. Iliopoulos;Jan JanoušEk;BořIvoj Melichar;Solon P. Pissis
Affiliations:
Dept. of Informatics, Kings College London, UK;Dept. of Informatics, Kings College London, UK and Université Paris-Est, France;Dept. of Theoretical Computer Science, Czech Technical University in Prague, Czech Republic and Heidelberg Institute for Theoretical Studies, Germany;Dept. of Informatics, Kings College London, UK and Dept. of Mathematics & Statistics, University of Western Australia, 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;Heidelberg Institute for Theoretical Studies, Germany and Florida Museum of Natural History, University of Florida, FL, USA
Venue:
Information Processing Letters
Year:
2012

Citing 10
Cited 0

Conception, evolution, and application of functional programming languages

ACM Computing Surveys (CSUR)
On finding common subtrees

Theoretical Computer Science
Tree automata for code selection

Acta Informatica
Variations on the Common Subexpression Problem

Journal of the ACM (JACM)
Programming with Equations

ACM Transactions on Programming Languages and Systems (TOPLAS)
Interactive Programming Environments

Interactive Programming Environments
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)
Computing all subtree repeats in ordered ranked trees

SPIRE'11 Proceedings of the 18th international conference on String processing and information retrieval
Arbology: trees and pushdown automata

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

Quantified Score

Hi-index	0.89

Visualization

Abstract

We consider the problem of computing all subtree repeats in a given labeled ordered tree. We first transform the tree to a string representing its postfix notation, and then present an algorithm based on the bottom-up technique to solve it. The proposed algorithm consists of two phases: the preprocessing phase and the phase where all subtree repeats are computed. The linear time and space complexity of the proposed algorithm are important parts of its quality.