Published online 19 July 2006
© 2006 The Author(s)
This is an Open Access article distributed under the terms of the Creative Commons Attribution Non-Commercial License (http://creativecommons.org/licenses/by-nc/2.0/uk/) which permits unrestricted non-commerical use, distribution, and reproduction in any medium, provided the original work is properly cited.
Article |
SLiMDisc: short, linear motif discovery, correcting for common evolutionary descent
Conway Institute of Biomolecular and Biomedical Sciences, University College Dublin Dublin 4, Ireland
*To whom correspondence should be addressed. Tel: +353 1 7166831; Email: denis.shields{at}ucd.ie
Received March 22, 2006. Revised June 22, 2006. Accepted June 26, 2006.
Many important interactions of proteins are facilitated by short, linear motifs (SLiMs) within a protein's primary sequence. Our aim was to establish robust methods for discovering putative functional motifs. The strongest evidence for such motifs is obtained when the same motifs occur in unrelated proteins, evolving by convergence. In practise, searches for such motifs are often swamped by motifs shared in related proteins that are identical by descent. Prediction of motifs among sets of biologically related proteins, including those both with and without detectable similarity, were made using the TEIRESIAS algorithm. The number of motif occurrences arising through common evolutionary descent were normalized based on treatment of BLAST local alignments. Motifs were ranked according to a score derived from the product of the normalized number of occurrences and the information content. The method was shown to significantly outperform methods that do not discount evolutionary relatedness, when applied to known SLiMs from a subset of the eukaryotic linear motif (ELM) database. An implementation of Multiple Spanning Tree weighting outperformed two other weighting schemes, in a variety of settings.
CiteULike 
Connotea 
Del.icio.us What's this?
This article has been cited by other articles:
|
|
 |
|
  D. T.-H. Chang, T.-Y. Chien, and C.-Y. Chen seeMotif: exploring and visualizing sequence motifs in 3D structures Nucleic Acids Res., July 1, 2009; 37(suppl_2): W552 - W558. [Abstract] [Full Text] [PDF]
|
|
|
|
 |
|
 N. E. Davey, D. C. Shields, and R. J. Edwards Masking residues using context-specific evolutionary conservation significantly improves short linear motif discovery Bioinformatics, February 15, 2009; 25(4): 443 - 450. [Abstract] [Full Text] [PDF]
|
|
|
|
|
|
R. J. Edwards, N. E. Davey, and D. C. Shields CompariMotif: quick and easy comparisons of sequence motifs Bioinformatics, May 15, 2008; 24(10): 1307 - 1309. [Abstract] [Full Text] [PDF]
|
|
|
|
|
|
H. Dinkel and H. Sticht A computational strategy for the prediction of functional linear peptide motifs in proteins Bioinformatics, December 15, 2007; 23(24): 3297 - 3303. [Abstract] [Full Text] [PDF]
|
|
|
|
|
|
N. E. Davey, R. J. Edwards, and D. C. Shields The SLiMDisc server: short, linear motif discovery in proteins Nucleic Acids Res., July 13, 2007; 35(suppl_2): W455 - W459. [Abstract] [Full Text] [PDF]
|
|