Detailed Information
Cited 0 time in 
Cited 0 time in 
Cited 0 time in
Metadata Downloads
Linear-Time Construction of Two-Dimensional Suffix Trees
Full metadata record
| 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.issued | 2011-02 | - |
| dc.identifier.issn | 0178-4617 | - |
| dc.identifier.issn | 1432-0541 | - |
| 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.format.extent | 29 | - |
| dc.language | 영어 | - |
| dc.language.iso | ENG | - |
| dc.publisher | Springer Verlag | - |
| dc.title | Linear-Time Construction of Two-Dimensional Suffix Trees | - |
| dc.type | Article | - |
| dc.publisher.location | 미국 | - |
| 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.citation.title | Algorithmica | - |
| dc.citation.volume | 59 | - |
| dc.citation.number | 2 | - |
| dc.citation.startPage | 269 | - |
| dc.citation.endPage | 297 | - |
| dc.type.docType | Article | - |
| dc.description.isOpenAccess | N | - |
| dc.description.journalRegisteredClass | sci | - |
| 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 | - |
- 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)