Fast algorithms for finding nearest common ancestors
SIAM Journal on Computing
On finding lowest common ancestors: simplification and parallelization
SIAM Journal on Computing
A data structure for dynamic trees
Journal of Computer and System Sciences
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
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
Text algorithms
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
Suffix tree data structures for matrices
Pattern matching algorithms
A Space-Economical Suffix Tree Construction Algorithm
Journal of the ACM (JACM)
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
Optimal Logarithmic Time Randomized Suffix Tree Construction
ICALP '96 Proceedings of the 23rd International Colloquium on Automata, Languages and Programming
Constructing Suffix Arrays for Multi-dimensional Matrices
CPM '98 Proceedings of the 9th Annual Symposium on Combinatorial Pattern Matching
Optimal suffix tree construction with large alphabets
FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
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
A simple construction of two-dimensional suffix trees in linear time
CPM'07 Proceedings of the 18th annual conference on Combinatorial Pattern Matching
| Hi-index | 0.00 |
The suffix tree of a string S is a compacted trie that represents all suffixes of S. Linear-time algorithms for constructing the suffix tree have been known for quite a while. In two dimensions, however, linear-time construction of two-dimensional suffix trees has been an open problem.We present the first linear-time algorithm for constructing two-dimensional suffix trees.