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
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-12-21T07:06:35Z | - |
| dc.date.available | 2022-12-21T07:06:35Z | - |
| dc.date.created | 2022-09-16 | - |
| dc.date.issued | 2007-07 | - |
| dc.identifier.issn | 0302-9743 | - |
| dc.identifier.uri | https://scholarworks.bwise.kr/hanyang/handle/2021.sw.hanyang/179844 | - |
| dc.description.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. | - |
| dc.language | 영어 | - |
| dc.language.iso | en | - |
| dc.publisher | Springer Verlag | - |
| dc.title | A simple construction of two-dimensional suffix trees in linear time | - |
| dc.type | Article | - |
| dc.contributor.affiliatedAuthor | Kim, Dong Kyue | - |
| dc.identifier.doi | 10.1007/978-3-540-73437-6_35 | - |
| dc.identifier.scopusid | 2-s2.0-37849014380 | - |
| dc.identifier.bibliographicCitation | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), v.4580 LNCS, pp.352 - 364 | - |
| dc.relation.isPartOf | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) | - |
| dc.citation.title | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) | - |
| dc.citation.volume | 4580 LNCS | - |
| dc.citation.startPage | 352 | - |
| dc.citation.endPage | 364 | - |
| dc.type.rims | ART | - |
| dc.type.docType | Conference Paper | - |
| dc.description.journalClass | 1 | - |
| dc.description.isOpenAccess | N | - |
| dc.description.journalRegisteredClass | scopus | - |
| dc.subject.keywordPlus | Algorithms | - |
| dc.subject.keywordPlus | Matrix algebra | - |
| dc.subject.keywordPlus | Linear-time construction | - |
| dc.subject.keywordPlus | Odd-even scheme | - |
| dc.subject.keywordPlus | Suffix tree | - |
| dc.subject.keywordPlus | Trees (mathematics) | - |
| dc.identifier.url | https://link.springer.com/chapter/10.1007/978-3-540-73437-6_35 | - |
- 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)