title: Bounded search for de novo identification of degenerate cis-regulatory elements.
abstract: BACKGROUND
  The identification of statistically overrepresented sequences in the upstream regions of coregulated genes should theoretically permit the identification of potential cis-regulatory elements. However, in practice many cis-regulatory elements are highly degenerate, precluding the use of an exhaustive word-counting strategy for their identification. While numerous methods exist for inferring base distributions using a position weight matrix, recent studies suggest that the independence assumptions inherent in the model, as well as the inability to reach a global optimum, limit this approach.
  
  
  RESULTS
  In this paper, we report PRISM, a degenerate motif finder that leverages the relationship between the statistical significance of a set of binding sites and that of the individual binding sites. PRISM first identifies overrepresented, non-degenerate consensus motifs, then iteratively relaxes each one into a high-scoring degenerate motif. This approach requires no tunable parameters, thereby lending itself to unbiased performance comparisons. We therefore compare PRISM's performance against nine popular motif finders on 28 well-characterized S. cerevisiae regulons. PRISM consistently outperforms all other programs. Finally, we use PRISM to predict the binding sites of uncharacterized regulons. Our results support a proposed mechanism of action for the yeast cell-cycle transcription factor Stb1, whose binding site has not been determined experimentally.
  
  
  CONCLUSIONS
  The relationship between statistical measures of the binding sites and the set as a whole leads to a simple means of identifying the diverse range of cis-regulatory elements to which a protein binds. This approach leverages the advantages of word-counting, in that position dependencies are implicitly accounted for and local optima are more easily avoided. While we sacrifice guaranteed optimality to prevent the exponential blowup of exhaustive search, we prove that the error is bounded and experimentally show that the performance is superior to other methods. A Java implementation of this algorithm can be downloaded from our web server at http://genie.dartmouth.edu/prism.
authors.affiliation: Department of Computer Science and Engineering, University of Washington, Seattle, WA 98105, USA. jcarlson@cs.washington.edu
authors.forename: Jonathan M
authors.initials: JM
authors.lastname: Carlson
authors.forename: Arijit
authors.initials: A
authors.lastname: Chakravarty
authors.forename: Radhika S
authors.initials: RS
authors.lastname: Khetani
authors.forename: Robert H
authors.initials: RH
authors.lastname: Gross
mesh_terms: D000465:Algorithms; D001483:Base Sequence; D001665:Binding Sites; D003198:Computer Simulation; D016384:Consensus Sequence; D008957:Models, Genetic; D015233:Models, Statistical; D008969:Molecular Sequence Data; D011401:Promoter Regions, Genetic; D011485:Protein Binding; D011506:Proteins / Q000737:chemistry / Q000235:genetics*; D050436:Regulatory Elements, Transcriptional / Q000235:genetics*; D016415:Sequence Alignment / Q000379:methods*; D017422:Sequence Analysis, DNA / Q000379:methods*; D014157:Transcription Factors / Q000235:genetics*
chemical_list: D011506:Proteins; D014157:Transcription Factors