A simple construction of two-dimensional suffix trees in linear time

초록

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.

키워드