Finding the longest common nonsuperstring in linear time
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Na, Joong Chae | - |
dc.contributor.author | Kim, Dong Kyue | - |
dc.contributor.author | Sim, Jeong Seop | - |
dc.date.accessioned | 2022-12-20T21:30:25Z | - |
dc.date.available | 2022-12-20T21:30:25Z | - |
dc.date.created | 2022-08-26 | - |
dc.date.issued | 2009-08 | - |
dc.identifier.issn | 0020-0190 | - |
dc.identifier.uri | https://scholarworks.bwise.kr/hanyang/handle/2021.sw.hanyang/176454 | - |
dc.description.abstract | String inclusion and non-inclusion problems have been vigorously studied in such diverse fields as molecular biology, data compression, and computer security. Among the well-known string inclusion or non-inclusion notions, we are interested in the longest common nonsuperstring. Given a set of strings, the longest common nonsuperstring problem is finding the longest string that is not a superstring of any string in the given set. It is known that the longest common nonsuperstring problem is solvable in polynomial time. In this paper, we propose an efficient algorithm for the longest common nonsuperstring problem. The running time of our algorithm is linear with respect to the sum of the lengths of the strings in the given set, using generalized suffix trees. | - |
dc.language | 영어 | - |
dc.language.iso | en | - |
dc.publisher | ELSEVIER | - |
dc.title | Finding the longest common nonsuperstring in linear time | - |
dc.type | Article | - |
dc.contributor.affiliatedAuthor | Kim, Dong Kyue | - |
dc.identifier.doi | 10.1016/j.ipl.2009.06.010 | - |
dc.identifier.scopusid | 2-s2.0-69049094798 | - |
dc.identifier.wosid | 000270126700009 | - |
dc.identifier.bibliographicCitation | INFORMATION PROCESSING LETTERS, v.109, no.18, pp.1066 - 1070 | - |
dc.relation.isPartOf | INFORMATION PROCESSING LETTERS | - |
dc.citation.title | INFORMATION PROCESSING LETTERS | - |
dc.citation.volume | 109 | - |
dc.citation.number | 18 | - |
dc.citation.startPage | 1066 | - |
dc.citation.endPage | 1070 | - |
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 | CONSTRUCTION | - |
dc.subject.keywordAuthor | Design of algorithms | - |
dc.subject.keywordAuthor | String non-inclusion problem | - |
dc.subject.keywordAuthor | Longest common nonsuperstring | - |
dc.subject.keywordAuthor | Generalized suffix tree | - |
dc.identifier.url | https://www.sciencedirect.com/science/article/pii/S0020019009002099?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.