Detailed Information
Cited 0 time in 
Cited 0 time in 
Cited 0 time in
Metadata Downloads
A simple construction of two-dimensional suffix trees in linear time
- Issue Date
- Jul-2007
- Publisher
- Springer Verlag
- Citation
- Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), v.4580 LNCS, pp.352 - 364
- Indexed
- SCOPUS
- Volume
- 4580 LNCS
- Start Page
- 352
- End Page
- 364
- ISSN
- 0302-9743
- Abstract
- The two-dimensional suffix tree of a matrix A is a compacted trie that represents all square submatrices of A. There exists a linear-time construction of two-dimensional suffix trees using the odd-even scheme. This algorithm has the drawback that the merging step is quite complicated. In this paper, we propose a new and simple algorithm to construct two-dimensional suffix trees in linear time by applying the skew scheme to square matrices. To do this, we present a simple algorithm to merge two Isuffix trees in linear time.
- 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)