Generalizations of suffix arrays to multi-dimensional matrices.
From MaRDI portal
Publication:5967094
DOI10.1016/S0304-3975(02)00861-7zbMath1044.68030MaRDI QIDQ5967094
Kun Soo Park, Dong Kyue Kim, Yoo-Ah Kim
Publication date: 17 August 2003
Published in: Theoretical Computer Science (Search for Journal in Brave)
Related Items (4)
TREE-BASED 2D INDEXING ⋮ Linear-time construction of two-dimensional suffix trees ⋮ On a property of a three-dimensional matrix ⋮ A Note on a Tree-Based 2D Indexing
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the construction of classes of suffix trees for square matrices: Algorithms and applications
- Approximate string matching with suffix automata
- A linear time solution to the single function coarsest partition problem
- An optimal algorithm for computing the repetitions in a word
- Two-dimensional dictionary matching
- On-line construction of suffix trees
- Covering a string
- On the computational power of pushdown automata
- Suffix Arrays: A New Method for On-Line String Searches
- Three Partition Refinement Algorithms
- A Space-Economical Suffix Tree Construction Algorithm
- Fast parallel and serial approximate string matching
- Algorithms on Strings, Trees and Sequences
- An Alphabet Independent Approach to Two-Dimensional Pattern Matching
- Multi-Dimensional Pattern Matching with Dimensional Wildcards: Data Structures and Optimal On-Line Search Algorithms
- Alphabet-Independent Two-Dimensional Witness Computation
- A Generalization of the Suffix Tree to Square Matrices, with Applications
- On the sorting-complexity of suffix tree construction
This page was built for publication: Generalizations of suffix arrays to multi-dimensional matrices.
