Two-dimensional dictionary matching
Information Processing Letters
A Generalization of the Suffix Tree to Square Matrices, with Applications
SIAM Journal on Computing
On the construction of classes of suffix trees for square matrices: algorithms and applications
Information and Computation
Handbook of formal languages, vol. 3
Suffix tree data structures for matrices
Pattern matching algorithms
An Index Data Structure For Matrices, with Applications to Fast Two-Dimensional Pattern Matching
WADS '93 Proceedings of the Third Workshop on Algorithms and Data Structures
Constructing Suffix Arrays for Multi-dimensional Matrices
CPM '98 Proceedings of the 9th Annual Symposium on Combinatorial Pattern Matching
Generalizations of suffix arrays to multi-dimensional matrices
Theoretical Computer Science
| Hi-index | 0.00 |
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.