Discriminating TATA box from putative TATA boxes in plant genome.
The TATA box has been used successfully to identify a transcription start site (TSS) and thereby a promoter. Unfortunately, there are many substrings which fit the profile of a TATA box and such substrings are called putative TATA boxes. We have applied linear and non linear classifiers for discriminating TATA box from putative TATA boxes and have compared their performances. We have also investigated the influence of the length of the pair of sequences flanking a putative TATA box on the prediction accuracy. The techniques we have presented in this paper are general enough to be applicable to other domains or to other genomes.
The Center for Computer Science, University of Louisisana, P.O. Box 44330, Lafayette, LA 70504, USA. logan@cacs.louisiana.edu
Raja
R
Loganantharaj
D000465:Algorithms; D020816:Amino Acid Motifs; D001499:Bayes Theorem; D001665:Binding Sites; D017343:Genes, Plant; D018745:Genome, Plant; D015233:Models, Statistical; D016571:Neural Networks, Computer; D010944:Plants; D011237:Predictive Value of Tests; D011336:Probability; D011401:Promoter Regions, Genetic; D015203:Reproducibility of Results; D016385:TATA Box; D014158:Transcription, Genetic