Linear-Time Construction of Two-Dimensional Suffix Trees
The two-dimensional suffix tree of a matrix A is a compacted tree that represents all square submatrices of A. We present the first complete version of a deterministic linear-time algorithm to construct the two-dimensional suffix tree by applying a divide-and-conquer approach.
two-dimensional suffix tree suffix tree divide-and-conquer approach