Linear-Time Construction of Two-Dimensional Suffix Trees
- First Online:
- Cite this article as:
- Kim, D.K., Na, J.C., Sim, J.S. et al. Algorithmica (2011) 59: 269. doi:10.1007/s00453-009-9350-z
- 153 Downloads
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.