Close category search window
 

Detection and visualization of tandem repeats in DNA sequences

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Buchner, M. ; Dept. of Electr. Eng. & Comput. Sci., Case Western Reserve Univ., Cleveland, OH, USA ; Janjarasjitt, S.

One conspicuous feature of DNA is the extent to which nucleotide subsequences repeat in the genome. Several strongly repetitive tandem (or contiguous) repeats are known to be associated with genetic diseases, while weaker repetitive structures are thought to be representative of historical events associated with sequence repetition. Thus, it is important to develop sensitive and rapid automation of the detection and identification of repeat sequences. A new algorithm for examining periodic patterns in DNA sequences is developed. The algorithm uses the short-time periodicity transform to compute the closest periodic sequence of fixed length at each nucleotide position in a given sequence to be analyzed. Each such subsequence is then compared to its closest periodic sequence to provide a quantitative measure of the amount of repetition within the sequence. In addition to being used to detect the presence of repeat subsequences in DNA, the periodicity explorer algorithm provides a potentially useful visualization of periodic patterns in a DNA sequence through a graphical display of the relative energy in the optimal periodic projections of the analyzed sequences, i.e., the DNA periodogram. Computationally, the algorithm is linear in the length of the analyzed sequence.

Published in:
Signal Processing, IEEE Transactions on  (Volume:51 ,  Issue: 9 )

Date of Publication: Sept. 2003

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.