title: The limits of de novo DNA motif discovery.
abstract: A major challenge in molecular biology is reverse-engineering the cis-regulatory logic that plays a major role in the control of gene expression. This program includes searching through DNA sequences to identify "motifs" that serve as the binding sites for transcription factors or, more generally, are predictive of gene expression across cellular conditions. Several approaches have been proposed for de novo motif discovery-searching sequences without prior knowledge of binding sites or nucleotide patterns. However, unbiased validation is not straightforward. We consider two approaches to unbiased validation of discovered motifs: testing the statistical significance of a motif using a DNA "background" sequence model to represent the null hypothesis and measuring performance in predicting membership in gene clusters. We demonstrate that the background models typically used are "too null," resulting in overly optimistic assessments of significance, and argue that performance in predicting TF binding or expression patterns from DNA motifs should be assessed by held-out data, as in predictive learning. Applying this criterion to common motif discovery methods resulted in universally poor performance, although there is a marked improvement when motifs are statistically significant against real background sequences. Moreover, on synthetic data where "ground truth" is known, discriminative performance of all algorithms is far below the theoretical upper bound, with pronounced "over-fitting" in training. A key conclusion from this work is that the failure of de novo discovery approaches to accurately identify motifs is basically due to statistical intractability resulting from the fixed size of co-regulated gene clusters, and thus such failures do not necessarily provide evidence that unfound motifs are not active biologically. Consequently, the use of prior knowledge to enhance motif discovery is not just advantageous but necessary. An implementation of the LR and ALR algorithms is available at http://code.google.com/p/likelihood-ratio-motifs/.
authors.affiliation: Department of Biomedical Engineering, Johns Hopkins University, Baltimore, Maryland, United States of America. dsimcha1@jhmi.edu
authors.forename: David
authors.initials: D
authors.lastname: Simcha
authors.forename: Nathan D
authors.initials: ND
authors.lastname: Price
authors.forename: Donald
authors.initials: D
authors.lastname: Geman
mesh_terms: D000465:Algorithms; D019540:Area Under Curve; D001499:Bayes Theorem; D020869:Gene Expression Profiling; D005786:Gene Expression Regulation; D006801:Humans; D016015:Logistic Models; D008390:Markov Chains; D008957:Models, Genetic; D009010:Monte Carlo Method; D056510:Position-Specific Scoring Matrices; D012372:ROC Curve; D012045:Regulatory Sequences, Nucleic Acid; D012441:Saccharomyces cerevisiae / Q000235:genetics; D017422:Sequence Analysis, DNA / Q000379:methods*; D059467:Transcriptome