O(N log N) algorithm for finding primary tandem repeats in a DNA genomic sequence
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Sangback Ma | - |
dc.contributor.author | Hyeong-hwa Jun | - |
dc.date.accessioned | 2021-06-24T00:05:15Z | - |
dc.date.available | 2021-06-24T00:05:15Z | - |
dc.date.created | 2021-02-01 | - |
dc.date.issued | 2005-06 | - |
dc.identifier.issn | 1226-9433 | - |
dc.identifier.uri | https://scholarworks.bwise.kr/erica/handle/2021.sw.erica/46343 | - |
dc.description.abstract | The genomes of organism are being published in an enormous speed. The genomes has a lot of intronic regions, and repeats constitute a substantial part of that. Repeats play a crucial role in DNA ?nger-printing, and detecting certain genomic diseases, such as Huntington disease, which has a high number of CAG repeats. Also, they throw important clues about the evolutionary history. Repeats are in two types, Tandem Repeats and Interspersed Repeats. In this paper we address ourselves to the problem of detecting Primary Tandem Repeats, which are tandem repeats that are not contained in any tandem repeats. We show that our algorithm takes O(n log n) time, where n is the length of genome. | - |
dc.language | 영어 | - |
dc.language.iso | en | - |
dc.publisher | 한국산업응용수학회 | - |
dc.title | O(N log N) algorithm for finding primary tandem repeats in a DNA genomic sequence | - |
dc.type | Article | - |
dc.contributor.affiliatedAuthor | Sangback Ma | - |
dc.identifier.bibliographicCitation | Journal of the Korean Society for Industrial and Applied Mathematics, v.9, no.1, pp.1 - 7 | - |
dc.relation.isPartOf | Journal of the Korean Society for Industrial and Applied Mathematics | - |
dc.citation.title | Journal of the Korean Society for Industrial and Applied Mathematics | - |
dc.citation.volume | 9 | - |
dc.citation.number | 1 | - |
dc.citation.startPage | 1 | - |
dc.citation.endPage | 7 | - |
dc.type.rims | ART | - |
dc.identifier.kciid | ART000963255 | - |
dc.description.journalClass | 2 | - |
dc.description.isOpenAccess | N | - |
dc.description.journalRegisteredClass | kci | - |
dc.description.journalRegisteredClass | other | - |
dc.identifier.url | https://www.dbpia.co.kr/journal/articleDetail?nodeId=NODE00991143 | - |
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.
55 Hanyangdeahak-ro, Sangnok-gu, Ansan, Gyeonggi-do, 15588, Korea+82-31-400-4269 sweetbrain@hanyang.ac.kr
COPYRIGHT © 2021 HANYANG 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.