Linear-Time Construction of Two-Dimensional Suffix Trees
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Kim, Dong Kyue | - |
dc.contributor.author | Na, Joong Chae | - |
dc.contributor.author | Sim, Jeong Seop | - |
dc.contributor.author | Park, Kunsoo | - |
dc.date.accessioned | 2022-07-16T21:50:19Z | - |
dc.date.available | 2022-07-16T21:50:19Z | - |
dc.date.created | 2021-05-12 | - |
dc.date.issued | 2011-02 | - |
dc.identifier.issn | 0178-4617 | - |
dc.identifier.uri | https://scholarworks.bwise.kr/hanyang/handle/2021.sw.hanyang/169103 | - |
dc.description.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. | - |
dc.language | 영어 | - |
dc.language.iso | en | - |
dc.publisher | SPRINGER | - |
dc.title | Linear-Time Construction of Two-Dimensional Suffix Trees | - |
dc.type | Article | - |
dc.contributor.affiliatedAuthor | Kim, Dong Kyue | - |
dc.identifier.doi | 10.1007/s00453-009-9350-z | - |
dc.identifier.scopusid | 2-s2.0-79951558152 | - |
dc.identifier.wosid | 000286462700009 | - |
dc.identifier.bibliographicCitation | ALGORITHMICA, v.59, no.2, pp.269 - 297 | - |
dc.relation.isPartOf | ALGORITHMICA | - |
dc.citation.title | ALGORITHMICA | - |
dc.citation.volume | 59 | - |
dc.citation.number | 2 | - |
dc.citation.startPage | 269 | - |
dc.citation.endPage | 297 | - |
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.journalResearchArea | Mathematics | - |
dc.relation.journalWebOfScienceCategory | Computer Science, Software Engineering | - |
dc.relation.journalWebOfScienceCategory | Mathematics, Applied | - |
dc.subject.keywordPlus | ONLINE CONSTRUCTION | - |
dc.subject.keywordPlus | COMMON ANCESTORS | - |
dc.subject.keywordPlus | SQUARE MATRICES | - |
dc.subject.keywordPlus | ALGORITHMS | - |
dc.subject.keywordPlus | COMPLEXITY | - |
dc.subject.keywordAuthor | Suffix tree | - |
dc.subject.keywordAuthor | Two-dimensional suffix tree | - |
dc.subject.keywordAuthor | Divide-and-conquer approach | - |
dc.identifier.url | https://link.springer.com/article/10.1007%2Fs00453-009-9350-z | - |
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.