Detailed Information
Cited 0 time in 
Cited 0 time in 
Cited 0 time in
Metadata Downloads
A Generalization of the Linearized Suffix Tree to Square MatricesA Generalization of the Linearized Suffix Tree to Square Matrices
- Other Titles
- A Generalization of the Linearized Suffix Tree to Square Matrices
- Issue Date
- Dec-2010
- Publisher
- 한국멀티미디어학회
- Keywords
- Linearized Suffix trees; Two-Dimensional Suffix trees; Linearized Suffix trees; Two-Dimensional Suffix trees
- Citation
- 멀티미디어학회논문지, v.13, no.12, pp 1760 - 1766
- Pages
- 7
- Indexed
- KCI
- Journal Title
- 멀티미디어학회논문지
- Volume
- 13
- Number
- 12
- Start Page
- 1760
- End Page
- 1766
- ISSN
- 1229-7771
- Abstract
- The linearized suffix tree (LST) is an array data structure supporting traversals on suffix trees. We apply this LST to two dimensional (2D) suffix trees and obtain a space-efficient substitution of 2D suffix trees. Given an text matrix and an pattern matrix over an alphabet , our 2D-LST provides pattern matching in time and space.
- 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)