Transcription binding site prediction using Markov models.
One of the main goals of analysing DNA sequences is to understand the temporal and positional information that specifies gene expression. An important step in this process is the recognition of gene expression regulatory elements. Experimental procedures for this are slow and costly. In this paper we present a computational non-supervised algorithm that facilitates the process by statistically identifying the most likely regions within a putative regulatory sequence. A probabilistic technique is presented, based on the approximation of regulatory DNA with a Markov chain, for the location of putative transcription factor binding sites in a single stretch of DNA. Hereto we developed a procedure to approximate the order of Markov model for a given DNA sequence that circumvents some of the prohibitive assumptions underlying Markov modeling. Application of the algorithm to data from 55 genes in five species shows the high sensitivity of this Markov search algorithm. Our algorithm does not require any prior knowledge in the form of description or cross-genomic comparison; it is context sensitive and takes DNA heterogeneity into account.
Abnizova
Irina
I
BSU MRC Cambridge, CB2 2SR, UK. irina.abnizova@mrc-bsu.cam.ac.uk
Rust
Alistair G
AG
Robinson
Mark
M
Te Boekhorst
Rene
R
Gilks
Walter R
WR
D001185:Artificial Intelligence; D001665:Binding Sites; D002874:Chromosome Mapping / Q000379:methods*; D003198:Computer Simulation; D004247:DNA / Q000737:chemistry / Q000235:genetics*; D008390:Markov Chains; D008957:Models, Genetic; D015233:Models, Statistical; D010363:Pattern Recognition, Automated; D011485:Protein Binding; D012045:Regulatory Sequences, Nucleic Acid / Q000235:genetics*; D016415:Sequence Alignment / Q000379:methods*; D017422:Sequence Analysis, DNA / Q000379:methods*; D014157:Transcription Factors / Q000737:chemistry / Q000235:genetics*
D014157:Transcription Factors; D004247:DNA