Combinatorial Pattern Matching

Volume 4580 of the series Lecture Notes in Computer Science pp 352-364

A Simple Construction of Two-Dimensional Suffix Trees in Linear Time

(Extended Abstract)
  • Dong Kyue KimAffiliated withDivision of Electronics and Computer Engineering, Hanyang University
  • , Joong Chae NaAffiliated withDepartment of Advanced Technology Fusion, Konkuk University
  • , Jeong Seop SimAffiliated withSchool of Computer Science and Engineering, Inha University
  • , Kunsoo ParkAffiliated withSchool of Computer Science and Engineering, Seoul National University

* Final gross prices may vary according to local VAT.

Get Access


The two-dimensional suffix tree of a matrix A is a compacted trie that represents all square submatrices of A. There exists a linear-time construction of two-dimensional suffix trees using the odd-even scheme. This algorithm has the drawback that the merging step is quite complicated. In this paper, we propose a new and simple algorithm to construct two-dimensional suffix trees in linear time by applying the skew scheme to square matrices. To do this, we present a simple algorithm to merge two Isuffix trees in linear time.