Article

Algorithmica

, Volume 59, Issue 2, pp 269-297

Linear-Time Construction of Two-Dimensional Suffix Trees

  • Dong Kyue KimAffiliated withDepartment of Electronics and Communications Engineering, Hanyang University
  • , Joong Chae NaAffiliated withDepartment of Computer Science and Engineering, Sejong University Email author 
  • , Jeong Seop SimAffiliated withSchool of Computer and Information Engineering, Inha University
  • , Kunsoo ParkAffiliated withSchool of Computer Science and Engineering, Seoul National University

Rent the article at a discount

Rent now

* Final gross prices may vary according to local VAT.

Get Access

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 tree Two-dimensional suffix tree Divide-and-conquer approach