Improving on-line construction of two-dimensional suffix trees for square matrices
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Na, Joong Chae | - |
dc.contributor.author | Kim, Namhee | - |
dc.contributor.author | Sim, Jeong Seop | - |
dc.contributor.author | Kim, Dong Kyue | - |
dc.date.accessioned | 2022-12-20T22:51:18Z | - |
dc.date.available | 2022-12-20T22:51:18Z | - |
dc.date.created | 2022-08-26 | - |
dc.date.issued | 2009-04 | - |
dc.identifier.issn | 0020-0190 | - |
dc.identifier.uri | https://scholarworks.bwise.kr/hanyang/handle/2021.sw.hanyang/177040 | - |
dc.description.abstract | The two-dimensional (2-D) suffix tree of an n x n square matrix A is a compacted trie that represents all square submatrices of A. We consider constructing 2-D suffix trees on-line, which means, instead of giving the whole matrix A in advance, A is separated and each part of A is given at different time as algorithms proceed. In general, developing an on-line algorithm is more difficult than developing an off-line algorithm. Moreover, the smaller the input grain size is, the harder it is to develop an on-line algorithm. In the case of 2-D suffix tree construction, dealing with a character at a time is harder than dealing with a row or a column at a time. In this paper we propose a randomized linear-time algorithm for constructing 2-D suffix trees on-line. This algorithm is superior to previous algorithms in two ways: (1) This is the first linear-time algorithm for constructing 2-D suffix trees on-line. Although there have been some linear-time algorithms for off-line construction, there were no linear-time algorithms for on-line construction. (2) We deal with the most fine-grain on-line case, i.e., our algorithm can construct a 2-D suffix tree even though only one character of A is given at a time, while previous on-line algorithms require at least a row and/or a column at a time. | - |
dc.language | 영어 | - |
dc.language.iso | en | - |
dc.publisher | ELSEVIER | - |
dc.title | Improving on-line construction of two-dimensional suffix trees for square matrices | - |
dc.type | Article | - |
dc.contributor.affiliatedAuthor | Kim, Dong Kyue | - |
dc.identifier.doi | 10.1016/j.ipl.2009.01.026 | - |
dc.identifier.scopusid | 2-s2.0-62549088657 | - |
dc.identifier.wosid | 000265305300010 | - |
dc.identifier.bibliographicCitation | INFORMATION PROCESSING LETTERS, v.109, no.10, pp.504 - 508 | - |
dc.relation.isPartOf | INFORMATION PROCESSING LETTERS | - |
dc.citation.title | INFORMATION PROCESSING LETTERS | - |
dc.citation.volume | 109 | - |
dc.citation.number | 10 | - |
dc.citation.startPage | 504 | - |
dc.citation.endPage | 508 | - |
dc.type.rims | ART | - |
dc.type.docType | Article | - |
dc.description.journalClass | 1 | - |
dc.description.isOpenAccess | N | - |
dc.description.journalRegisteredClass | scie | - |
dc.description.journalRegisteredClass | scopus | - |
dc.relation.journalResearchArea | Computer Science | - |
dc.relation.journalWebOfScienceCategory | Computer Science, Information Systems | - |
dc.subject.keywordPlus | Clustering algorithms | - |
dc.subject.keywordPlus | Data structures | - |
dc.subject.keywordPlus | Two dimensional | - |
dc.subject.keywordPlus | Trees (mathematics) | - |
dc.subject.keywordPlus | Design of algorithms | - |
dc.subject.keywordPlus | Index data structures | - |
dc.subject.keywordPlus | On-line algorithms | - |
dc.subject.keywordPlus | Randomized algorithms | - |
dc.subject.keywordPlus | Two-dimensional suffix trees | - |
dc.subject.keywordAuthor | Design of algorithms | - |
dc.subject.keywordAuthor | Two-dimensional suffix trees | - |
dc.subject.keywordAuthor | Index data structures | - |
dc.subject.keywordAuthor | On-line algorithms | - |
dc.subject.keywordAuthor | Randomized algorithms | - |
dc.identifier.url | https://www.sciencedirect.com/science/article/pii/S0020019009000209?via%3Dihub | - |
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.
222, Wangsimni-ro, Seongdong-gu, Seoul, 04763, Korea+82-2-2220-1365
COPYRIGHT © 2021 HANYANG UNIVERSITY.
Certain data included herein are derived from the © Web of Science of Clarivate Analytics. All rights reserved.
You may not copy or re-distribute this material in whole or in part without the prior written consent of Clarivate Analytics.