IDEAS home Printed from https://ideas.repec.org/a/plo/pone00/0013897.html
   My bibliography  Save this article

A Bayesian Search for Transcriptional Motifs

Author

Listed:
  • Andrew K Miller
  • Cristin G Print
  • Poul M F Nielsen
  • Edmund J Crampin

Abstract

Identifying transcription factor (TF) binding sites (TFBSs) is an important step towards understanding transcriptional regulation. A common approach is to use gaplessly aligned, experimentally supported TFBSs for a particular TF, and algorithmically search for more occurrences of the same TFBSs. The largest publicly available databases of TF binding specificities contain models which are represented as position weight matrices (PWM). There are other methods using more sophisticated representations, but these have more limited databases, or aren't publicly available. Therefore, this paper focuses on methods that search using one PWM per TF. An algorithm, MATCHTM, for identifying TFBSs corresponding to a particular PWM is available, but is not based on a rigorous statistical model of TF binding, making it difficult to interpret or adjust the parameters and output of the algorithm. Furthermore, there is no public description of the algorithm sufficient to exactly reproduce it. Another algorithm, MAST, computes a p-value for the presence of a TFBS using true probabilities of finding each base at each offset from that position. We developed a statistical model, BaSeTraM, for the binding of TFs to TFBSs, taking into account random variation in the base present at each position within a TFBS. Treating the counts in the matrices and the sequences of sites as random variables, we combine this TFBS composition model with a background model to obtain a Bayesian classifier. We implemented our classifier in a package (SBaSeTraM). We tested SBaSeTraM against a MATCHTM implementation by searching all probes used in an experimental Saccharomyces cerevisiae TF binding dataset, and comparing our predictions to the data. We found no statistically significant differences in sensitivity between the algorithms (at fixed selectivity), indicating that SBaSeTraM's performance is at least comparable to the leading currently available algorithm. Our software is freely available at: http://wiki.github.com/A1kmm/sbasetram/building-the-tools.

Suggested Citation

  • Andrew K Miller & Cristin G Print & Poul M F Nielsen & Edmund J Crampin, 2010. "A Bayesian Search for Transcriptional Motifs," PLOS ONE, Public Library of Science, vol. 5(11), pages 1-7, November.
  • Handle: RePEc:plo:pone00:0013897
    DOI: 10.1371/journal.pone.0013897
    as

    Download full text from publisher

    File URL: https://journals.plos.org/plosone/article?id=10.1371/journal.pone.0013897
    Download Restriction: no

    File URL: https://journals.plos.org/plosone/article/file?id=10.1371/journal.pone.0013897&type=printable
    Download Restriction: no

    File URL: https://libkey.io/10.1371/journal.pone.0013897?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
    ---><---

    References listed on IDEAS

    as
    1. Shaun Mahony & Philip E Auron & Panayiotis V Benos, 2007. "DNA Familial Binding Profiles Made Easy: Comparison of Various Motif Alignment and Clustering Strategies," PLOS Computational Biology, Public Library of Science, vol. 3(3), pages 1-14, March.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Qiang Yu & Hongwei Huo & Yipu Zhang & Hongzhi Guo, 2012. "PairMotif: A New Pattern-Driven Algorithm for Planted (l, d) DNA Motif Search," PLOS ONE, Public Library of Science, vol. 7(10), pages 1-10, October.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. David L Corcoran & Kusum V Pandit & Ben Gordon & Arindam Bhattacharjee & Naftali Kaminski & Panayiotis V Benos, 2009. "Features of Mammalian microRNA Promoters Emerge from Polymerase II Chromatin Immunoprecipitation Data," PLOS ONE, Public Library of Science, vol. 4(4), pages 1-10, April.
    2. Shaoqiang Zhang & Yong Chen, 2016. "CLIMP: Clustering Motifs via Maximal Cliques with Parallel Computing Design," PLOS ONE, Public Library of Science, vol. 11(8), pages 1-17, August.
    3. Adrian Schröder & Johannes Eichner & Jochen Supper & Jonas Eichner & Dierk Wanke & Carsten Henneges & Andreas Zell, 2010. "Predicting DNA-Binding Specificities of Eukaryotic Transcription Factors," PLOS ONE, Public Library of Science, vol. 5(11), pages 1-15, November.

    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:plo:pone00:0013897. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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: plosone (email available below). General contact details of provider: https://journals.plos.org/plosone/ .

    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.