A simple and compact algorithm for the RMQ and its application to the longest common repeat problem
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Lee, I. | - |
dc.contributor.author | Song, H.Y. | - |
dc.date.accessioned | 2022-01-14T09:42:09Z | - |
dc.date.available | 2022-01-14T09:42:09Z | - |
dc.date.created | 2022-01-14 | - |
dc.date.issued | 2007 | - |
dc.identifier.issn | 0302-9743 | - |
dc.identifier.uri | https://scholarworks.bwise.kr/hongik/handle/2020.sw.hongik/24190 | - |
dc.description.abstract | The Range Minimum Query (RMQ) problem is to find the smallest element in an array for given range {a, b). We propose a simple and compact algorithm for this problem when the queries are sorted in ascending order. Then we show how to use this algorithm for the generalised longest common repeat problem [14]. Our algorithm is easy to understand and implement and requires much smaller memory. © Springer-Verlag Berlin Heidelberg 2007. | - |
dc.language | 영어 | - |
dc.language.iso | en | - |
dc.publisher | Springer Verlag | - |
dc.title | A simple and compact algorithm for the RMQ and its application to the longest common repeat problem | - |
dc.type | Article | - |
dc.contributor.affiliatedAuthor | Song, H.Y. | - |
dc.identifier.doi | 10.1007/978-3-540-71618-1_61 | - |
dc.identifier.scopusid | 2-s2.0-38049052179 | - |
dc.identifier.bibliographicCitation | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), v.4431 LNCS, no.PART 1, pp.554 - 561 | - |
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 | 4431 LNCS | - |
dc.citation.number | PART 1 | - |
dc.citation.startPage | 554 | - |
dc.citation.endPage | 561 | - |
dc.type.rims | ART | - |
dc.type.docType | Conference Paper | - |
dc.description.journalClass | 1 | - |
dc.description.journalRegisteredClass | scopus | - |
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.
94, Wausan-ro, Mapo-gu, Seoul, 04066, Korea02-320-1314
COPYRIGHT 2020 HONGIK UNIVERSITY. ALL RIGHTS RESERVED.
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.