Research Article: Search of regular sequences in promoters from eukaryotic genomes

Authors:
Andrew Shelenkov;Eugene Korotkov
Affiliations:
Bioengineering Centre of Russian Academy of Sciences, 117312 Moscow, Pr-t 60-tya Oktyabrya, 7/1, Russian Federation;Bioengineering Centre of Russian Academy of Sciences, 117312 Moscow, Pr-t 60-tya Oktyabrya, 7/1, Russian Federation
Venue:
Computational Biology and Chemistry
Year:
2009

Citing 6
Cited 0

An Intelligent System for Vertebrate Promoter Recognition

IEEE Intelligent Systems
Promoter Recognition for E. coli DNA Segments by Independent Component Analysis

CSB '04 Proceedings of the 2004 IEEE Computational Systems Bioinformatics Conference
Spectral Repeat Finder (SRF): identification of repetitive sequences using Fourier transformation

Bioinformatics
PromoterExplorer: an effective promoter identification method based on the AdaBoost algorithm

Bioinformatics
Handbook of Parametric and Nonparametric Statistical Procedures

Handbook of Parametric and Nonparametric Statistical Procedures
Latent periodicity of serine-threonine and tyrosine protein kinases and other protein families

Computational Biology and Chemistry

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, the notion of ''regularity'' is introduced to describe the structural features of DNA sequences. This notion expands the ''latent periodicity'' term. The novel method for revealing regularity based on the runs test is described. The search of regular sequences in eukaryotic promoters has shown that more than 60% of them possess a regularity property on statistically significant level. Possible biological functions of regularity are discussed together with the possibility of using this characteristic for performing promoter annotation.