A Simple Construction of Two-Dimensional Suffix Trees in Linear Time
- Cite this paper as:
- Kim D.K., Na J.C., Sim J.S., Park K. (2007) A Simple Construction of Two-Dimensional Suffix Trees in Linear Time. In: Ma B., Zhang K. (eds) Combinatorial Pattern Matching. CPM 2007. Lecture Notes in Computer Science, vol 4580. Springer, Berlin, Heidelberg
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.
Unable to display preview. Download preview PDF.