Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | 마상백 | - |
dc.date.accessioned | 2019-11-12T05:35:30Z | - |
dc.date.available | 2019-11-12T05:35:30Z | - |
dc.date.issued | 2005-12 | - |
dc.identifier.citation | JOURNAL OF THE KOREA SOCIETY FOR INDUSTRIAL AND APPLIED MATHETICS, v. 9, No. 1, Page. 1 - 7 | en_US |
dc.identifier.issn | 1229-9433 | - |
dc.identifier.uri | http://www.dbpia.co.kr/journal/articleDetail?nodeId=NODE00991143&language=ko_KR | - |
dc.identifier.uri | https://repository.hanyang.ac.kr/handle/20.500.11754/112102 | - |
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. | en_US |
dc.language.iso | ko_KR | en_US |
dc.publisher | 한국산업응용수학회 | en_US |
dc.title | O(N log N) algorithm for finding primary tandem repeats in a DNA genomic sequence | en_US |
dc.type | Article | en_US |
dc.relation.journal | JOURNAL OF THE KOREA SOCIETY FOR INDUSTRIAL AND APPLIED MATHETICS | - |
dc.contributor.googleauthor | MA, SANGBACK | - |
dc.contributor.googleauthor | JUN, HYEONG-HWA | - |
dc.relation.code | 2012212045 | - |
dc.sector.campus | E | - |
dc.sector.daehak | COLLEGE OF COMPUTING[E] | - |
dc.sector.department | DIVISION OF COMPUTER SCIENCE | - |
dc.identifier.pid | sangback2001 | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.