TREE-BASED 2D INDEXING

DOI10.1142/S0129054111009100MaRDI QIDQ3224955zbMATH OpenOpenAlexFDO

Authors Jan Žďárek, Bořivoj Melichar

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)

Recommendations

• A note on a tree-based 2D indexing
• Cartesian Tree Matching and Indexing
• scientific article; zbMATH DE number 3954287
• A Compact Index for Cartesian Tree Matching
• Publication:3468604
• scientific article; zbMATH DE number 4070292
• scientific article; zbMATH DE number 4057057
• Indexing graph search trees and applications
• scientific article; zbMATH DE number 3843184

Cites work

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

Cited in

(1)

• A note on a tree-based 2D indexing

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3224955)