Computational Prediction of Short Linear Motifs from Protein Sequences
Open accessThe DOI matches its Crossref record; 8 of the 8 references it cites were found in a registry or an index.
Abstract
Short Linear Motifs (SLiMs) are functional protein microdomains that typically mediate interactions between a short linear region in one protein and a globular domain in another. SLiMs usually occur in structurally disordered regions and mediate low affinity interactions. Most SLiMs are 3-15 amino acids in length and have 2-5 defined positions, making them highly likely to occur by chance and extremely difficult to identify. Nevertheless, our knowledge of SLiMs and capacity to predict them from protein sequence data using computational methods has advanced dramatically over the past decade. By considering the biological, structural, and evolutionary context of SLiM occurrences, it is possible to differentiate functional instances from chance matches in many cases and to identify new regions of proteins that have the features consistent with a SLiM-mediated interaction. Their simplicity also makes SLiMs evolutionarily labile and prone to independent origins on different sequence backgrounds through convergent evolution, which can be exploited for predicting novel SLiMs in proteins that share a function or interaction partner. In this review, we explore our current knowledge of SLiMs and how it can be applied to the task of predicting them computationally from protein sequences. Rather than focusing on specific SLiM prediction tools, we provide an overview of the methods available and concentrate on principles that should continue to be paramount even in the light of future developments. We consider the relative merits of using regular expressions or profiles for SLiM discovery and discuss the main considerations for both predicting new instances of known SLiMs, and de novo prediction of novel SLiMs. In particular, we highlight the importance of correctly modelling evolutionary relationships and the probability of false positive predictions.
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
FIMO: scanning for occurrences of a given motif
Grant, C. E., Bailey, T. L., & Noble, W. S. (2011) · Bioinformatics · doi:10.1093/bioinformatics/btr064 · Cited by 4,247
Protein modules and signalling networks
Pawson, T. (1995) · Nature · doi:10.1038/373573a0 · Cited by 2,420
PROSITE: a documented database using patterns and profiles as motif descriptors
Sigrist, C. J. A. (2002) · Briefings in Bioinformatics · doi:10.1093/bib/3.3.265 · Cited by 913 · cited 13×
“PROSITE was one of the earliest collections of linear motif definitions for both SLiMs and longer globular domains (18) although it has largely been superseded by ELM (9) and MnM (10) as a repository for SLiMs.”
BackgroundMethodInfluentialLarge-scale phosphorylation analysis of mouse liver
Villén, J., Beausoleil, S. A., Gerber, S. A., & Gygi, S. P. (2007) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.0609836104 · Cited by 730
Buljan, M., Chalancon, G., Eustermann, S., Wagner, G. P., Fuxreiter, M., Bateman, A., & Babu, M. M. (2012) · Molecular Cell · doi:10.1016/j.molcel.2012.05.039 · Cited by 396 · cited 2×
“SLiMs are undoubtedly responsible for some of the functional diversity imparted on protein sequences via alternative splicing/promoter use (35-37).”
BackgroundSystematic Discovery of New Recognition Peptides Mediating Protein Interaction Networks
Neduva, V., Linding, R., Su-Angrand, I., Stark, A., Masi, F. D., Gibson, T. J., Lewis, J., Serrano, L., & Russell, R. B. (2005) · PLoS Biology · doi:10.1371/journal.pbio.0030405 · Cited by 359 · cited 10×
“(71, 113), for example, have three consecutive wildcards and would thus be missed by SLiMFinder defaults.”
BackgroundMethodInfluentialLinear motifs: Evolutionary interaction switches
Neduva, V., & Russell, R. B. (2005) · FEBS Letters · doi:10.1016/j.febslet.2005.04.005 · Cited by 352
Xia, X. (2012) · Scientifica · doi:10.6064/2012/917540 · Cited by 73
Cited by
Jankowski, M. S., Griffith, D., Shastry, D. G., Pelham, J. F., Ginell, G. M., Thomas, J., Karande, P., Holehouse, A. S., & Hurley, J. M. (2024) · Nature Communications · doi:10.1038/s41467-024-47761-z · Cited by 23
(2022) · doi:10.1016/j.biochi.2022.02.002 · Cited by 5
Brunello, F. G., Erra, L., Nicola, J., & Martí, M. A. (2025) · PLOS Computational Biology · doi:10.1371/journal.pcbi.1012829 · Cited by 1
Metadata
- Authors
- Edwards, R. J., & Palopoli, N.
- Venue
- Methods in Molecular Biology
- Publisher
- Springer New York
- Published
- 2014-12-11
- Volume
- 1268
- Pages
- 89-141
- ISSN
- 1064-3745 (ISSN-L)
- 1940-6029
- OpenAlex
- W2286948044
- Cited by
- 54
- References
- 8
- FWCI
- 5.92
- Type
- book chapter
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Computational Prediction of Short Linear Motifs from Protein Sequences. https://app.cochat.ai/papers/10.1007/978-1-4939-2285-7_6
- The paper
- Edwards, R. J., & Palopoli, N. (2015). Computational Prediction of Short Linear Motifs from Protein Sequences. Methods in Molecular Biology. https://doi.org/10.1007/978-1-4939-2285-7_6
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.