A Note on a Tree-Based 2D Indexing

  • Jan Žd’árek
  • Bořivoj Melichar
Conference paper

DOI: 10.1007/978-3-642-18098-9_32

Volume 6482 of the book series Lecture Notes in Computer Science (LNCS)
Cite this paper as:
Žd’árek J., Melichar B. (2011) A Note on a Tree-Based 2D Indexing. In: Domaratzki M., Salomaa K. (eds) Implementation and Application of Automata. CIAA 2010. Lecture Notes in Computer Science, vol 6482. Springer, Berlin, Heidelberg

Abstract

A new approach to the 2D pattern matching and specifically to 2D text indexing is proposed. We present the transformation of 2D structures into the form of a tree, preserving the context of each element of the structure. The tree can be linearised using the prefix notation into the form of a text (a string) and we do the pattern matching in this text. Over this representation pushdown automata indexing the 2D text are constructed. They allow to search for 2D prefixes, suffixes, or factors of the 2D text in time proportional to the size of the representation of a 2D pattern. This result achieves the properties analogous to the results obtained in tree pattern matching and string indexing.

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

  • Jan Žd’árek
    • 1
  • Bořivoj Melichar
    • 1
  1. 1.Department of Theoretical Computer Science, Faculty of Information TechnologyCzech Technical UniversityPragueCzech Republic