The DOI matches its Crossref record; 7 of the 7 references it cites were found in a registry or an index.
Practical Strategies for Discovering Regulatory DNA Sequence Motifs
Open accessAbstract
Many functionally important regions of the genome can be recognized by searching for sequence patterns, or “motifs.” Aside from the genes themselves, examples include CpG islands, often present in promoter regions, and splice sites that denote intron/exon boundaries. Other motifs of great interest correspond to sites bound by regulatory proteins. Differential expression of genes in response to environmental and developmental cues depends on the action of these proteins, which are also known as transcription factors. Identifying the regulatory motifs bound by transcription factors can provide crucial insight into the mechanisms of transcriptional regulation. However, the search for these sites is challenging because a single regulatory protein will often recognize a variety of similar sequences. In this tutorial, we review computational techniques, termed “motif discovery,” to learn representations of regulatory motifs from sequence data. In Figure 1, we present an overview of the basic workflow in a motif discovery analysis and some practical strategies for successfully mining sequence data for biologically important regulatory motifs. In the remainder of this tutorial, we discuss the main challenges associated with motif discovery in detail, and we review recent developments for addressing these challenges. Figure 1 Motif Discovery Workflow
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
A leisurely look at the bootstrap, the jackknife, and cross-validation
Efron, B., & Gong, G. (1983) · The American Statistician · doi:10.1080/00031305.1983.10483087 · Cited by 3,229
Xie, X., Lu, J., Kulbokas, E. J., Golub, T. R., Mootha, V., Lindblad-Toh, K., Lander, E. S., & Kellis, M. (2005) · Nature · doi:10.1038/nature03441 · Cited by 1,872 · cited 2×
“Similar procedures, using the Pearson correlation coefficient between motif PWMs as the similarity measure, have been applied [34,47].”
BackgroundMethodAssessing computational tools for the discovery of transcription factor binding sites
Tompa, M., Li, N., Bailey, T. L., Church, G. M., De Moor, B., Eskin, E., Favorov, A. V., Frith, M. C., Fu, Y., Kent, W. J., et al. (2005) · Nature Biotechnology · doi:10.1038/nbt1053 · Cited by 1,268
Cawley, S., Bekiranov, S., Ng, H. H., Kapranov, P., Sekinger, E. A., Kampa, D., Piccolboni, A., Sementchenko, V., Cheng, J., Williams, A. J., et al. (2004) · Cell · doi:10.1016/s0092-8674(04)00127-8 · Cited by 1,095
Nomenclature for incompletely specified bases in nucleic acid sequences: rcommendations 1984
Cornish-Bowden, A. (1985) · Nucleic Acids Research · doi:10.1093/nar/13.9.3021 · Cited by 548
Integrating regulatory motif discovery and genome-wide expression analysis
Conlon, E. M., Liu, X. S., Lieb, J. D., & Liu, J. S. (2003) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.0630591100 · Cited by 343
Moses, A. M., Chiang, D. Y., Pollard, D. A., Iyer, V. N., & Eisen, M. B. (2004) · Genome Biology · doi:10.1186/gb-2004-5-12-r98 · Cited by 153
Cited by
Hazelwood, L. A., Daran, J.-M., van Maris, A. J. A., Pronk, J. T., & Dickinson, J. R. (2008) · Applied and Environmental Microbiology · doi:10.1128/aem.02625-07 · Cited by 1,547
Discovering motifs in ranked lists of DNA sequences
Eden, E., Lipson, D., Yogev, S., & Yakhini, Z. (2007) · PLoS Computational Biology · doi:10.1371/journal.pcbi.0030039 · Cited by 696
Guo, Y., Mahony, S., & Gifford, D. K. (2012) · PLoS Computational Biology · doi:10.1371/journal.pcbi.1002638 · Cited by 303
Molecular determinants of caste differentiation in the highly eusocial honeybee Apis mellifera
Barchuk, A. R., Cristino, A. S., Kucharski, R., Costa, L. F., Simões, Z. L., & Maleszka, R. (2007) · BMC Developmental Biology · doi:10.1186/1471-213x-7-70 · Cited by 290
Machine learning: a powerful tool for gene function prediction in plants
Mahood, E. H., Kruse, L. H., & Moghe, G. D. (2020) · Applications in Plant Sciences · doi:10.1002/aps3.11376 · Cited by 153
Metadata
- Authors
- MacIsaac, K. D., & Fraenkel, E.
- Venue
- PLoS Computational Biology
- Publisher
- Public Library of Science (PLoS)
- Published
- 2006-04-28
- Volume
- 2
- Issue
- 4
- Pages
- e36
- ISSN
- 1553-734X (ISSN-L)
- 1553-7358
- OpenAlex
- W2157076973
- Cited by
- 169
- References
- 7
- FWCI
- 8.60
- Type
- journal article
- Language
- en
- Open access
- gold
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.