165 0

Linear-Time Construction of Two-Dimensional Suffix Trees

Title
Linear-Time Construction of Two-Dimensional Suffix Trees
Author
김동규
Keywords
Suffix tree; Two-dimensional suffix tree; Divide-and-conquer approach
Issue Date
2011-02
Publisher
Springer
Citation
Algorithmica, 2009, 59(2), P.269-297
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.
URI
http://link.springer.com/article/10.1007%2Fs00453-009-9350-z
ISSN
0178-4617
DOI
10.1007/s00453-009-9350-z
Appears in Collections:
COLLEGE OF ENGINEERING[S](공과대학) > ELECTRONIC ENGINEERING(융합전자공학부) > Articles
Files in This Item:
There are no files associated with this item.
Export
RIS (EndNote)
XLS (Excel)
XML


qrcode

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.

BROWSE