Display Settings:

Format

Send to:

Choose Destination
    J Mol Biol. 1992 Jan 5;223(1):159-70.

    Expectation maximization algorithm for identifying protein-binding sites with variable lengths from unaligned DNA fragments.

    Source

    Institute for Behavior Genetics, University of Colorado Boulder 80309-0447.

    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.

    PMID:
    1731067
    [PubMed - indexed for MEDLINE]

      Supplemental Content

      Icon for Elsevier Science

      Save items

      loading

      Recent activity

      Your browsing activity is empty.

      Activity recording is turned off.

      Turn recording back on

      See more...
      Write to the Help Desk