상세 보기
A Generalization of the Linearized Suffix Tree to Square Matrices
A Generalization of the Linearized Suffix Tree to Square Matrices
- 나중채;
- 이선호;
- 김동규
초록
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.
키워드
Linearized Suffix trees; Two-Dimensional Suffix trees; Linearized Suffix trees; Two-Dimensional Suffix trees
- 제목
- A Generalization of the Linearized Suffix Tree to Square Matrices
- 제목 (타언어)
- A Generalization of the Linearized Suffix Tree to Square Matrices
- 저자
- 나중채; 이선호; 김동규
- 발행일
- 2010-12
- 저널명
- 멀티미디어학회논문지
- 권
- 13
- 호
- 12
- 페이지
- 1760 ~ 1766