The DOI matches its Crossref record; 22 of the 22 references it cites were found in a registry or an index.
STREME: accurate and versatile sequence motif discovery
Open accessAbstract
Motivation: Sequence motif discovery algorithms can identify novel sequence patterns that perform biological functions in DNA, RNA and protein sequences—for example, the binding site motifs of DNA- and RNA-binding proteins. Results: The STREME algorithm presented here advances the state-of-the-art in ab initio motif discovery in terms of both accuracy and versatility. Using in vivo DNA (ChIP-seq) and RNA (CLIP-seq) data, and validating motifs with reference motifs derived from in vitro data, we show that STREME is more accurate, sensitive and thorough than several widely used algorithms (DREME, HOMER, MEME, Peak-motifs) and two other representative algorithms (ProSampler and Weeder). STREME’s capabilities include the ability to find motifs in datasets with hundreds of thousands of sequences, to find both short and long motifs (from 3 to 30 positions), to perform differential motif discovery in pairs of sequence datasets, and to find motifs in sequences over virtually any alphabet (DNA, RNA, protein and user-defined alphabets). Unlike most motif discovery algorithms, STREME reports a useful estimate of the statistical significance of each motif it discovers. STREME is easy to use individually via its web server or via the command line, and is completely integrated with the widely used MEME Suite of sequence analysis tools. The name STREME stands for ‘Simple, Thorough, Rapid, Enriched Motif Elicitation’. Availability and implementation: The STREME web server and source code are provided freely for non-commercial use at http://meme-suite.org. Supplementary information: Supplementary data are available at Bioinformatics online.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Heinz, S., Benner, C., Spann, N., Bertolino, E., Lin, Y. C., Laslo, P., Cheng, J. X., Murre, C., Singh, H., & Glass, C. K. (2010) · Molecular Cell · doi:10.1016/j.molcel.2010.05.004 · Cited by 13,382
Versatile and open software for comparing large genomes
Kurtz, S., Phillippy, A., Delcher, A. L., Smoot, M., Shumway, M., Antonescu, C., & Salzberg, S. L. (2004) · Genome Biology · doi:10.1186/gb-2004-5-2-r12 · Cited by 5,254
Sequence logos: a new way to display consensus sequences
Schneider, T. D., & Stephens, R. M. (1990) · Nucleic Acids Research · doi:10.1093/nar/18.20.6097 · Cited by 3,378
On the Interpretation of χ 2 from Contingency Tables, and the Calculation of P
Fisher, R. A. (1922) · Journal of the Royal Statistical Society · doi:10.2307/2340521 · Cited by 2,953
An improved Bonferroni procedure for multiple tests of significance
SIMES, R. J. (1986) · Biometrika · doi:10.1093/biomet/73.3.751 · Cited by 2,396
Quantifying similarity between motifs
Gupta, S., Stamatoyannopoulos, J. A., Bailey, T. L., & Noble, W. S. (2007) · Genome Biology · doi:10.1186/gb-2007-8-2-r24 · Cited by 2,058
Self-citationMEME-ChIP: motif analysis of large DNA datasets
Machanick, P., & Bailey, T. L. (2011) · Bioinformatics · doi:10.1093/bioinformatics/btr189 · Cited by 1,806
Self-citationLinear pattern matching algorithms
Weiner, P. (1973) · 14th Annual Symposium on Switching and Automata Theory (swat 1973) · doi:10.1109/swat.1973.13 · Cited by 1,801
A Space-Economical Suffix Tree Construction Algorithm
McCreight, E. M. (1976) · Journal of the ACM · doi:10.1145/321941.321946 · Cited by 1,511
DNA binding sites: representation and discovery
Stormo, G. D. (2000) · Bioinformatics · doi:10.1093/bioinformatics/16.1.16 · Cited by 1,502
A compendium of RNA-binding motifs for decoding gene regulation
Ray, D., Kazan, H., Cook, K. B., Weirauch, M. T., Najafabadi, H. S., Li, X., Gueroussov, S., Albu, M., Zheng, H., Yang, A., et al. (2013) · Nature · doi:10.1038/nature12311 · Cited by 1,480
Robust transcriptome-wide discovery of RNA-binding protein binding sites with enhanced CLIP (eCLIP)
Van Nostrand, E. L., Pratt, G. A., Shishkin, A. A., Gelboin-Burkhart, C., Fang, M. Y., Sundararaman, B., Blue, S. M., Nguyen, T. B., Surka, C., Elkins, K., et al. (2016) · Nature Methods · doi:10.1038/nmeth.3810 · Cited by 1,397
DNA-Binding Specificities of Human Transcription Factors
Jolma, A., Yan, J., Whitington, T., Toivonen, J., Nitta, K. R., Rastas, P., Morgunova, E., Enge, M., Taipale, M., Wei, G., et al. (2013) · Cell · doi:10.1016/j.cell.2012.12.009 · Cited by 1,261
DREME: motif discovery in transcription factor ChIP-seq data
Bailey, T. L. (2011) · Bioinformatics · doi:10.1093/bioinformatics/btr261 · Cited by 1,044
Self-citationThe value of prior knowledge in discovering motifs with MEME.
Bailey, T. L., & Elkan, C. (1995) · PubMed · Cited by 665
Self-citationPavesi, G., Mereghetti, P., Mauri, G., & Pesole, G. (2004) · Nucleic Acids Research · doi:10.1093/nar/gkh465 · Cited by 491
Probability plotting methods for the analysis for the analysis of data
WILK, M. B., & GNANADESIKAN, R. (1968) · Biometrika · doi:10.1093/biomet/55.1.1 · Cited by 278
RSAT 2011: regulatory sequence analysis tools
Thomas-Chollier, M., Defrance, M., Medina-Rivera, A., Sand, O., Herrmann, C., Thieffry, D., & van Helden, J. (2011) · Nucleic Acids Research · doi:10.1093/nar/gkr377 · Cited by 228
Fedotova, A. A., Bonchuk, A. N., Mogila, V. A., & Georgiev, P. G. (2017) · Acta Naturae · doi:10.32607/20758251-2017-9-2-47-58 · Cited by 227
STEME: efficient EM to find motifs in large data sets
Reid, J. E., & Wernisch, L. (2011) · Nucleic Acids Research · doi:10.1093/nar/gkr574 · Cited by 46
Differential motif enrichment analysis of paired ChIP-seq experiments
Lesluyes, T., Johnson, J., Machanick, P., & Bailey, T. L. (2014) · BMC Genomics · doi:10.1186/1471-2164-15-752 · Cited by 28
Self-citationLi, Y., Ni, P., Zhang, S., Li, G., & Su, Z. (2019) · Bioinformatics · doi:10.1093/bioinformatics/btz290 · Cited by 27
Cited by
Massively parallel characterization of transcriptional regulatory elements
Agarwal, V., Inoue, F., Schubach, M., Penzar, D., Martin, B. K., Dash, P. M., Keukeleire, P., Zhang, Z., Sohota, A., Zhao, J., et al. (2025) · Nature · doi:10.1038/s41586-024-08430-9 · Cited by 146
UBR5 forms ligand-dependent complexes on chromatin to regulate nuclear hormone receptor stability
Tsai, J. M., Aguirre, J. D., Li, Y.-D., Brown, J., Focht, V., Kater, L., Kempf, G., Sandoval, B., Schmitt, S., Rutter, J. C., et al. (2023) · Molecular Cell · doi:10.1016/j.molcel.2023.06.028 · Cited by 68
Chen, Q., Zheng, A., Xu, X., Shi, Z., Yang, M., Sun, S., Wang, L., Wang, Y., Zhao, H., Xiao, Q., et al. (2025) · Circulation · doi:10.1161/circulationaha.124.070286 · Cited by 54
FOXP3 recognizes microsatellites and bridges DNA through multimerization
Zhang, W., Leng, F., Wang, X., Ramirez, R. N., Park, J., Benoist, C., & Hur, S. (2023) · Nature · doi:10.1038/s41586-023-06793-z · Cited by 42
Polymerization of ZBTB transcription factors regulates chromatin occupancy
Park, P. M. C., Park, J., Brown, J., Hunkeler, M., Roy Burman, S. S., Donovan, K. A., Yoon, H., Nowak, R. P., Słabicki, M., Ebert, B. L., et al. (2024) · Molecular Cell · doi:10.1016/j.molcel.2024.06.010 · Cited by 22
Metadata
- Authors
- Bailey, T. L.
- Venue
- Bioinformatics
- Publisher
- Oxford University Press (OUP)
- Published
- 2021-03-24
- Volume
- 37
- Issue
- 18
- Pages
- 2834-2840
- ISSN
- 1367-4803 (ISSN-L)
- 1367-4811
- OpenAlex
- W3139265997
- Cited by
- 622
- References
- 22
- FWCI
- 27.64
- Type
- journal article
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.
