Detailed Information
Cited 0 time in 
Cited 0 time in 
Cited 0 time in
Metadata Downloads
Linear-Time Construction of Two-Dimensional Suffix Trees
- Issue Date
- Feb-2011
- Publisher
- SPRINGER
- Keywords
- Suffix tree; Two-dimensional suffix tree; Divide-and-conquer approach
- Citation
- ALGORITHMICA, v.59, no.2, pp.269 - 297
- Indexed
- SCIE
SCOPUS
- Journal Title
- ALGORITHMICA
- Volume
- 59
- Number
- 2
- Start Page
- 269
- End Page
- 297
- ISSN
- 0178-4617
- 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.
- Files in This Item
- Go to Link
- Appears in
Collections - 서울 공과대학 > 서울 융합전자공학부 > 1. Journal Articles
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.
Related Researcher
- Kim, Dong Kyue
- COLLEGE OF ENGINEERING (SCHOOL OF ELECTRONIC ENGINEERING)