Algorithmica

, Volume 59, Issue 2, pp 269–297

Linear-Time Construction of Two-Dimensional Suffix Trees

Authors

  • Dong Kyue Kim
    • Department of Electronics and Communications EngineeringHanyang University
    • Department of Computer Science and EngineeringSejong University
  • Jeong Seop Sim
    • School of Computer and Information EngineeringInha University
  • Kunsoo Park
    • School of Computer Science and EngineeringSeoul National University
Article

DOI: 10.1007/s00453-009-9350-z

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

Abstract

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.

Keywords

Suffix treeTwo-dimensional suffix treeDivide-and-conquer approach

Copyright information

© Springer Science+Business Media, LLC 2009