z-logo
open-access-imgOpen Access
Analysis ofE.colipromoter structures using neural networks
Author(s) -
I. B. Mahadevan,
Indira Ghosh
Publication year - 1994
Publication title -
nucleic acids research
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 9.008
H-Index - 537
eISSN - 1362-4954
pISSN - 0305-1048
DOI - 10.1093/nar/22.11.2158
Subject(s) - promoter , biology , genetics , pbr322 , consensus sequence , plasmid , computational biology , gene , base sequence , gene expression
Backpropagation neural network is trained to identify E.coli promoters of all spacing classes (15 to 21). A three module approach is employed wherein the first neural net module predicts the consensus boxes, the second module aligns the promoters to a length of 65 bases and the third neural net module predicts the entire sequence of 65 bases taking care of the possible interdependencies between the bases in the promoters. The networks were trained with 106 promoters and random sequences which were 60% AT rich and tested on 126 promoters (Bacterial, Mutant and Phage promoters). The network was 98% successful in promoter recognition and 90.2% successful in non-promoter recognition when tested on 5000 randomly generated sequences. The network was further trained with 11 mutated non-promoters and 8 mutated promoters of the p22ant promoter. The testing set with 7 mutated promoters and 13 mutated non-promoters of p22ant were identified. The network was upgraded using total 1665 data of promoters and non-promoters to identify any promoter sequences in the gene sequences. The network identified the locations of P1, P2 and P3 promoters in the pBR322 plasmid. A search for the start codon, Ribosomal Binding Site and the stop codon by a string search procedure has also been added to find the possible promoters that can yield protein products. The network was also successfully tested on a synthetic plasmid pWM528.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here