TREE-BASED 2D INDEXING

DOI10.1142/S0129054111009100zbMath1234.68245OpenAlexW2096307634MaRDI QIDQ3224955

Bořivoj Melichar, Jan Žd'árek

Publication date: 13 March 2012

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0129054111009100

zbMATH Keywords

pushdown automatontwo-dimensional exact pattern matchingtwo-dimensional indexing structure

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Computing methodologies for text processing; mathematical typography (68U15) Algorithms on strings (68W32)

Cites Work

• On the construction of classes of suffix trees for square matrices: Algorithms and applications
• Two-dimensional dictionary matching
• Some properties of two-dimensional on-line tessellation acceptors
• On-line construction of two-dimensional suffix trees in \(O(n^{2} \log n)\) time
• Multi-Dimensional Pattern Matching with Dimensional Wildcards: Data Structures and Optimal On-Line Search Algorithms
• A Generalization of the Suffix Tree to Square Matrices, with Applications
• Generalizations of suffix arrays to multi-dimensional matrices.

This page was built for publication: TREE-BASED 2D INDEXING