A simple construction of two-dimensional suffix trees in linear time

Authors:
Dong Kyue Kim;Joong Chae Na;Jeong Seop Sim;Kunsoo Park
Affiliations:
Division of Electronics and Computer Engineering, Hanyang University, Korea;Department of Advanced Technology Fusion, Konkuk University, Korea;School of Computer Science and Engineering, Inha University, Korea;School of Computer Science and Engineering, Seoul National University, Korea
Venue:
CPM'07 Proceedings of the 18th annual conference on Combinatorial Pattern Matching
Year:
2007

Citing 22
Cited 1

Fast algorithms for finding nearest common ancestors

SIAM Journal on Computing
On finding lowest common ancestors: simplification and parallelization

SIAM Journal on Computing
Two-dimensional dictionary matching

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

SIAM Journal on Computing
Optimal parallel suffix tree construction

STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Symmetry breaking for suffix tree construction

STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
A Generalization of the Suffix Tree to Square Matrices, with Applications

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
On-line construction of two-dimensional suffix trees

Journal of Complexity
A Space-Economical Suffix Tree Construction Algorithm

Journal of the ACM (JACM)
Faster suffix tree construction with missing suffix links

STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
On the sorting-complexity of suffix tree construction

Journal of the ACM (JACM)
Linear-Time Construction of Two-Dimensional Suffix Trees

ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
Optimal Logarithmic Time Randomized Suffix Tree Construction

ICALP '96 Proceedings of the 23rd International Colloquium on Automata, Languages and Programming
Optimal suffix tree construction with large alphabets

FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
Generalizations of suffix arrays to multi-dimensional matrices

Theoretical Computer Science
Breaking a Time-and-Space Barrier in Constructing Full-Text Indices

FOCS '03 Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science
Linear work suffix array construction

Journal of the ACM (JACM)
Linear pattern matching algorithms

SWAT '73 Proceedings of the 14th Annual Symposium on Switching and Automata Theory (swat 1973)
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

Improving on-line construction of two-dimensional suffix trees for square matrices

Information Processing Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

The two-dimensional suffix tree of a matrix A is a compacted trie that represents all square submatrices of A. There exists a linear-time construction of two-dimensional suffix trees using the odd-even scheme. This algorithm has the drawback that the merging step is quite complicated. In this paper, we propose a new and simple algorithm to construct two-dimensional suffix trees in linear time by applying the skew scheme to square matrices. To do this, we present a simple algorithm to merge two Isuffix trees in linear time.