Generalizations of suffix arrays to multi-dimensional matrices

Authors:
Dong Kyue Kim;Yoo Ah Kim;Kunsoo Park
Affiliations:
School of Electrical and Computer Engineering, Pusan National University, Pusan 609-735, South Korea;Department of Computer Science, University of Maryland, College Park, MD;School of Computer Science and Engineering, Seoul National University, Seoul 151-742, South Korea
Venue:
Theoretical Computer Science
Year:
2003

Citing 17
Cited 3

Three partition refinement algorithms

SIAM Journal on Computing
Fast parallel and serial approximate string matching

Journal of Algorithms
Two-dimensional dictionary matching

Information Processing Letters
Suffix arrays: a new method for on-line string searches

SIAM Journal on Computing
Parallel construction and query of suffix trees for two-dimensional matrices

SPAA '93 Proceedings of the fifth annual ACM symposium on Parallel algorithms and architectures
An Alphabet Independent Approach to Two-Dimensional Pattern Matching

SIAM Journal on Computing
Text algorithms

Text algorithms
A Generalization of the Suffix Tree to Square Matrices, with Applications

SIAM Journal on Computing
Alphabet-Independent Two-Dimensional Witness Computation

SIAM Journal on Computing
On the construction of classes of suffix trees for square matrices: algorithms and applications

Information and Computation
Algorithms on strings, trees, and sequences: computer science and computational biology

Algorithms on strings, trees, and sequences: computer science and computational biology
Suffix tree data structures for matrices

Pattern matching algorithms
Multi-dimensional pattern matching with dimensional wildcards: data structures and optimal on-line search algorithms

Journal of Algorithms
A Space-Economical Suffix Tree Construction Algorithm

Journal of the ACM (JACM)
On the sorting-complexity of suffix tree construction

Journal of the ACM (JACM)
The Design and Analysis of Computer Algorithms

The Design and Analysis of Computer Algorithms
Constructing Suffix Arrays for Multi-dimensional Matrices

CPM '98 Proceedings of the 9th Annual Symposium on Combinatorial Pattern Matching

A note on a tree-based 2D indexing

CIAA'10 Proceedings of the 15th international conference on Implementation and application of automata
O(n2 log n) time on-line construction of two-dimensional suffix trees

COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
A simple construction of two-dimensional suffix trees in linear time

CPM'07 Proceedings of the 18th annual conference on Combinatorial Pattern Matching

Quantified Score

Hi-index	5.23

Visualization

Abstract

We propose multi-dimensional index data structures that generalize suffix arrays to square matrices and cubic matrices. Giancarlo proposed a two-dimensional index data structure, the Lsuffix tree, that generalizes suffix trees to square matrices. However, the construction algorithm for Lsuffix trees maintains complicated data structures and uses a large amount of space. We present simple construction algorithms for multi-dimensional suffix arrays by applying a new partitioning technique to lexicographic sorting. Our contributions are the first efficient algorithms for constructing two-dimensional and three-dimensional suffix arrays directly.