Computing All Subtree Repeats in Ordered Ranked Trees

  • Michalis Christou
  • Maxime Crochemore
  • Tomáš Flouri
  • Costas S. Iliopoulos
  • Jan Janoušek
  • Bořivoj Melichar
  • Solon P. Pissis
Conference paper

DOI: 10.1007/978-3-642-24583-1_33

Part of the Lecture Notes in Computer Science book series (LNCS, volume 7024)
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

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2011

Authors and Affiliations

  • Michalis Christou
    • 1
  • Maxime Crochemore
    • 1
    • 2
  • Tomáš Flouri
    • 3
  • Costas S. Iliopoulos
    • 1
    • 4
  • Jan Janoušek
    • 3
  • Bořivoj Melichar
    • 3
  • Solon P. Pissis
    • 1
  1. 1.Dept. of InformaticsKing’s College LondonUK
  2. 2.Université Paris-EstFrance
  3. 3.Dept. of Theoretical Computer Science, Faculty of Information TechnologyCzech Technical UniversityPragueCzech Republic
  4. 4.Digital Ecosystems & Business Intelligence InstituteCurtin UniversityPerthAustralia

Personalised recommendations