IDEAS home Printed from https://ideas.repec.org/a/bpj/sagmbi/v4y2005i1n1.html
   My bibliography  Save this article

Estimating Motifs Under Order Restrictions

Author

Listed:
  • van Zwet Erik W

    (Mathematical Institute, Leiden University)

  • Kechris Katherina J

    (Department of Biochemistry and Biophysics, University of California, San Francisco)

  • Bickel Peter J

    (Department of Statistics, University of California, Berkeley)

  • Eisen Michael B.

    (Department of Molecular and Cell Biology, University of California, Berkeley; Life Sciences Division, Ernest Orlando Lawrence Berkeley National Laboratory, Berkeley)

Abstract

Transcription factors and many other DNA-binding proteins recognize more than one specific sequence. Among sequences recognized by a given DNA-binding protein, different positions exhibit varying degrees of conservation. The reason is that base pairs that are more extensively contacted by the protein tend to be more conserved. This observation can be used in the discovery of transcription factor binding sites. Here we present a rigorous means to accomplish this. In particular, we constrain the order of the information (entropy) in the columns of the position specific weight matrix (PWM) which characterizes the motif being sought. We then show how to compute the maximum likelihood estimate of a PWM under such order restrictions. This computation is easily integrated with the EM algorithm or the Gibbs sampler to enhance performance in the search for motifs in unaligned sequences. We demonstrate our method on a well-known data set of binding sites of the transcription factor Crp in E. coli.

Suggested Citation

  • van Zwet Erik W & Kechris Katherina J & Bickel Peter J & Eisen Michael B., 2005. "Estimating Motifs Under Order Restrictions," Statistical Applications in Genetics and Molecular Biology, De Gruyter, vol. 4(1), pages 1-18, January.
    • Handle: RePEc:bpj:sagmbi:v:4:y:2005:i:1:n:1
    DOI: 10.2202/1544-6115.1100
    as

    Download full text from publisher

    File URL: https://doi.org/10.2202/1544-6115.1100
    Download Restriction: For access to full text, subscription to the journal or payment for the individual article is required.
    File URL: https://libkey.io/10.2202/1544-6115.1100?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:bpj:sagmbi:v:4:y:2005:i:1:n:1. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Peter Golla (email available below). General contact details of provider: https://www.degruyter.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.