Finding consensus and optimal alignment of circular strings
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Lee, Taehyung | - |
dc.contributor.author | Na, Joong Chae | - |
dc.contributor.author | Park, Heejin | - |
dc.contributor.author | Park, Kunsoo | - |
dc.contributor.author | Sim, Jeong Seop | - |
dc.date.accessioned | 2022-07-16T11:48:54Z | - |
dc.date.available | 2022-07-16T11:48:54Z | - |
dc.date.created | 2021-05-12 | - |
dc.date.issued | 2013-01 | - |
dc.identifier.issn | 0304-3975 | - |
dc.identifier.uri | https://scholarworks.bwise.kr/hanyang/handle/2021.sw.hanyang/163713 | - |
dc.description.abstract | Circular strings are different from linear strings in that the last symbol is considered to precede the first symbol. Even though circular strings are biologically important, only a few efforts have been made to solve computational problems on circular strings. In this paper, we introduce consensus problems for circular strings of length n and present the first non-trivial algorithms to find a consensus and an optimal alignment for circular strings by the Hamming distance. They are O(n(2) log n)-time algorithms for three circular strings and an O(n(3) log n)-time algorithm for four circular strings. Our algorithms are O(n/ log n) times faster than the naive algorithms directly using the solutions for the linear consensus problems, which take O(n(3)) time for three circular strings and O(n(4)) time for four circular strings. This speedup was achieved by reducing the problems into correlations and by formulating and solving systems of linear equations. Moreover, our algorithms use only O(n) space. | - |
dc.language | 영어 | - |
dc.language.iso | en | - |
dc.publisher | ELSEVIER | - |
dc.title | Finding consensus and optimal alignment of circular strings | - |
dc.type | Article | - |
dc.contributor.affiliatedAuthor | Park, Heejin | - |
dc.identifier.doi | 10.1016/j.tcs.2012.11.018 | - |
dc.identifier.scopusid | 2-s2.0-84871621235 | - |
dc.identifier.wosid | 000313917200009 | - |
dc.identifier.bibliographicCitation | THEORETICAL COMPUTER SCIENCE, v.468, pp.92 - 101 | - |
dc.relation.isPartOf | THEORETICAL COMPUTER SCIENCE | - |
dc.citation.title | THEORETICAL COMPUTER SCIENCE | - |
dc.citation.volume | 468 | - |
dc.citation.startPage | 92 | - |
dc.citation.endPage | 101 | - |
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, Theory & Methods | - |
dc.subject.keywordPlus | EFFICIENT ALGORITHMS | - |
dc.subject.keywordPlus | CLOSEST | - |
dc.subject.keywordAuthor | Consensus strings | - |
dc.subject.keywordAuthor | Circular strings | - |
dc.subject.keywordAuthor | Multiple alignments | - |
dc.identifier.url | https://www.sciencedirect.com/science/article/pii/S0304397512010481?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.