Computational identification and analysis of protein short linear motifs

Davey, Norman E., Edwards, Richard J. and Shields, Denis C. (2010) Computational identification and analysis of protein short linear motifs Frontiers in Bioscience, 15, pp. 801-825.


[img] PDF davey_edwards_shields_2010.pdf - Accepted Manuscript
Download (251kB)


Short linear motifs (SLiMs) in proteins can act as targets for proteolytic cleavage, sites of post-translational modification, determinants of sub-cellular localization, and mediators of protein-protein interactions. Computational discovery of SLiMs involves assembling a group of proteins postulated to share a potential motif, masking out residues less likely to contain such a motif, down-weighting shared motifs arising through common evolutionary descent, and calculation of statistical probabilities allowing for the multiple testing of all possible motifs. Much of the challenge for motif discovery lies in the assembly and masking of datasets of proteins likely to share motifs, since the motifs are typically short (between 3 and 10 amino acids in length), so that potential signals can be easily swamped by the noise of stochastically recurring motifs. Focusing on disordered regions of proteins, where SLiMs are predominantly found, and masking out non-conserved residues can reduce the level of noise but more work is required to improve the quality of high-throughput experimental datasets (e.g. of physical protein interactions) as input for computational discovery.

Item Type: Article
ISSNs: 1093-9946 (print)
Related URLs:
ePrint ID: 158235
Date :
Date Event
1 June 2010Published
Date Deposited: 16 Jun 2010 15:52
Last Modified: 18 Apr 2017 03:56
Further Information:Google Scholar

Actions (login required)

View Item View Item