A Note on a Tree-Based 2D Indexing

DOI10.1007/978-3-642-18098-9_32zbMath1297.68281OpenAlexW1579968497MaRDI QIDQ3073649

Jan Žd'árek, Bořivoj Melichar

Publication date: 11 February 2011

Published in: Implementation and Application of Automata (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-18098-9_32

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Algorithms on strings (68W32)

Cites Work

• Unnamed Item
• 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.