Expectation maximization algorithm for identifying protein-binding sites with variable lengths from unaligned DNA fragments.
An Expectation Maximization algorithm for identification of DNA binding sites is presented. The approach predicts the location of binding regions while allowing variable length spacers within the sites. In addition to predicting the most likely spacer length for a set of DNA fragments, the method identifies individual sites that differ in spacer size. No alignment of DNA sequences is necessary. The method is illustrated by application to 231 Escherichia coli DNA fragments known to contain promoters with variable spacings between their consensus regions. Maximum-likelihood tests of the differences between the spacing classes indicate that the consensus regions of the spacing classes are not distinct. Further tests suggest that several positions within the spacing region may contribute to promoter specificity.
Cardon
L R
LR
Institute for Behavior Genetics, University of Colorado Boulder 80309-0447.
Stormo
G D
GD
D000465:Algorithms; D001483:Base Sequence; D001665:Binding Sites; D004247:DNA / Q000235:genetics*; D004269:DNA, Bacterial / Q000235:genetics; D004268:DNA-Binding Proteins / Q000378:metabolism*; D004926:Escherichia coli / Q000235:genetics; D008969:Molecular Sequence Data; D011401:Promoter Regions, Genetic; D016415:Sequence Alignment
D004269:DNA, Bacterial; D004268:DNA-Binding Proteins; D004247:DNA