Linear-Time Construction of Two-Dimensional Suffix Trees

Kim, Dong Kyue; Na, Joong Chae; Sim, Jeong Seop; Park, Kunsoo

doi:10.1007/s00453-009-9350-z

상세 보기

Linear-Time Construction of Two-Dimensional Suffix Trees

Kim, Dong Kyue;
Na, Joong Chae;
Sim, Jeong Seop;
Park, Kunsoo

Citations

WEB OF SCIENCE

8

Citations

SCOPUS

11

초록

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.

키워드

Suffix tree; Two-dimensional suffix tree; Divide-and-conquer approach; ONLINE CONSTRUCTION; COMMON ANCESTORS; SQUARE MATRICES; ALGORITHMS; COMPLEXITY

제목: Linear-Time Construction of Two-Dimensional Suffix Trees

저자: Kim, Dong Kyue; Na, Joong Chae; Sim, Jeong Seop; Park, Kunsoo

DOI: 10.1007/s00453-009-9350-z

발행일: 2011-02

유형: Article

저널명: Algorithmica

권: 59

호: 2

페이지: 269 ~ 297