A note on a tree-based 2D indexing

DOI10.1007/978-3-642-18098-9_32MaRDI QIDQ3073649zbMATH OpenOpenAlexFDO

Authors Jan Žďá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)

Recommendations

• TREE-BASED 2D INDEXING
• An index data structure for matrices, with applications to fast two-dimensional pattern matching
• A full and linear index of a tree for tree patterns
• scientific article; zbMATH DE number 1759461
• A Generalization of the Suffix Tree to Square Matrices, with Applications

Cites work

• scientific article; zbMATH DE number 3936518 (Why is no real title available?)
• 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

(3)

• Algorithms and Computation
• A full and linear index of a tree for tree patterns
• TREE-BASED 2D INDEXING

This page was built for publication: A note on a tree-based 2D indexing

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