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
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
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
Hi-index | 5.23 |
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.