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.
Partially supported by Czech Science Foundation project No. 201/09/0807, and by MŠMT of the Czech Republic under research program No. MSM 6840770014.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Giammarresi, D., Restivo, A.: Two-dimensional languages. In: Handbook of Formal Languages, vol. III, pp. 216–267. Springer, Heidelberg (1997)
Giancarlo, R., Grossi, R.: Suffix tree data structures for matrices. In: Apostolico, A., Galil, Z. (eds.) Pattern Matching Algorithms, pp. 293–340. Oxford University Press, Oxford (1997)
Gonnet, G.H.: Efficient searching of text and pictures. Report OED-88-02, University of Waterloo (1988)
Giancarlo, R.: A generalization of the suffix tree to square matrices, with applications. SIAM J. Comput. 24(3), 520–562 (1995)
Amir, A., Farach, M.: Two-dimensional dictionary matching. Inf. Process. Lett. 44(5), 233–239 (1992)
Kim, D.K., Kim, Y.A., Park, K.: Generalizations of suffix arrays to multi-dimensional matrices. Theor. Comput. Sci. 302(1-3), 401–416 (2003)
Na, J.C., Giancarlo, R., Park, K.: On-line construction of two-dimensional suffix tree in \(\mathcal{O}(n^2 \log n)\) time. Algorithmica 48, 173–186 (2007)
Kim, D.K., Kim, Y.A., Park, K.: Constructing suffix arrays for multi-dimensional matrices. In: Farach-Colton, M. (ed.) CPM 1998. LNCS, vol. 1448, pp. 126–139. Springer, Heidelberg (1998)
Giancarlo, R., Grossi, R.: On the construction of classes of suffix trees for square matrices: Algorithms and applications. Inf. Comput. 130(2), 151–182 (1996)
Giancarlo, R.: An index data structure for matrices, with applications to fast two-dimensional pattern matching. In: Dehne, F., et al. (eds.) WADS 1993. LNCS, vol. 709, pp. 337–348. Springer, Heidelberg (1993)
Giancarlo, R., Grossi, R.: Multi-dimensional pattern matching with dimensional wildcards: Data structures and optimal on-line search algorithms. J. Algorithms 24(2), 223–265 (1997)
Inoue, K., Nakamura, A.: Some properties of two-dimensional on-line tessellation acceptors. Inf. Sci. 13(2), 95–121 (1977)
Janoušek, J.: String suffix automata and subtree pushdown automata. In: Holub, J., Žd’árek, J. (eds.) Proc. PSC 2009, CTU in Prague, Czech Republic, pp. 160–172 (2009)
Comon, H., et al.: Tree automata techniques and applications (2007), http://www.grappa.univ-lille3.fr/tata (release October 12, 2007)
Cleophas, L.: Tree Algorithms. Two Taxonomies and a Toolkit. PhD thesis, Technische Universiteit Eindhoven, Eindhoven (2008)
Flouri, T., Janoušek, J., Melichar, B.: Tree pattern matching by deterministic pushdown automata. In: Ganzha, M., Paprzycki, M. (eds.) Proc. IMCSIT, vol. 4, pp. 659–666. IEEE Computer Society Press, Los Alamitos (2009)
Olsen, G.: “Newick’s 8:45” tree format standard (August 1990), http://evolution.genetics.washington.edu/phylip/newick_doc.html
Wagner, K., Wechsung, G.: Computational Complexity. Springer, Heidelberg (2001)
Žd’árek, J.: Two-dimensional Pattern Matching Using Automata Approach. PhD thesis, Czech Technical University in Prague (2010), http://www.stringology.org/papers/Zdarek-PhD_thesis-2010.pdf
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ž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. https://doi.org/10.1007/978-3-642-18098-9_32
Download citation
DOI: https://doi.org/10.1007/978-3-642-18098-9_32
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-18097-2
Online ISBN: 978-3-642-18098-9
eBook Packages: Computer ScienceComputer Science (R0)