Expectation maximization algorithm for identifying protein-binding sites with variable lengths from unaligned DNA fragments.
J Mol Biol
; 223(1): 159-70, 1992 Jan 05.
Article
em En
| MEDLINE
| ID: mdl-1731067
ABSTRACT
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.
Buscar no Google
Coleções:
01-internacional
Base de dados:
MEDLINE
Assunto principal:
DNA
/
Regiões Promotoras Genéticas
/
Proteínas de Ligação a DNA
Tipo de estudo:
Prognostic_studies
Idioma:
En
Revista:
J Mol Biol
Ano de publicação:
1992
Tipo de documento:
Article