8 0

O(N log N) algorithm for finding primary tandem repeats in a DNA genomic sequence

Title
O(N log N) algorithm for finding primary tandem repeats in a DNA genomic sequence
Author
마상백
Issue Date
2005-12
Publisher
한국산업응용수학회
Citation
JOURNAL OF THE KOREA SOCIETY FOR INDUSTRIAL AND APPLIED MATHETICS, v. 9, No. 1, Page. 1 - 7
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.
URI
http://www.dbpia.co.kr/journal/articleDetail?nodeId=NODE00991143&language=ko_KRhttp://repository.hanyang.ac.kr/handle/20.500.11754/112102
ISSN
1229-9433
Appears in Collections:
COLLEGE OF COMPUTING[E] > COMPUTER SCIENCE(소프트웨어학부) > Articles
Files in This Item:
There are no files associated with this item.
Export
RIS (EndNote)
XLS (Excel)
XML


qrcode

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.

BROWSE