Skip Navigation



Nucleic Acids Research Advance Access published online on April 19, 2008

Nucleic Acids Research, doi:10.1093/nar/gkn161
This Article
Right arrow Full Text Freely available
Right arrow Print PDF (7378K) Freely available
Right arrow Screen PDF (994K) Freely available
Right arrow Supplementary Data
Right arrowOA All Versions of this Article:
36/10/3263    most recent
gkn161v1
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in PubMed
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrow Commercial Re-use Guidelines
for Open Access NAR Content
Google Scholar
Right arrow Articles by Li, L.
Right arrow Articles by Li, S. S.-C.
Right arrow Search for Related Content
PubMed
Right arrow PubMed Citation
Right arrow Articles by Li, L.
Right arrow Articles by Li, S. S.-C.
Social Bookmarking
 Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

© 2008 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-commercial use, distribution, and reproduction in any medium, provided the original work is properly cited.


Computational Biology

Prediction of phosphotyrosine signaling networks using a scoring matrix-assisted ligand identification approach

Lei Li1, Chenggang Wu1, Haiming Huang1, Kaizhong Zhang2, Jacob Gan3 and Shawn S.-C. Li1,*

1Department of Biochemistry and the Siebens-Drake Medical Research Institute, Schulich School of Medicine and Dentistry, 2Department of Computer Science, University of Western Ontario, London, Ontario N6A 5C1, Canada and 3School of Mechanical & Aerospace Engineering, Nanyang Technological University, Singapore

*To whom correspondence should be addressed. Tel: +1 519 8502910; Fax: +1 519 6613175; Email: sli{at}uwo.ca

Received February 26, 2008. Revised March 19, 2008. Accepted March 20, 2008.

Systematic identification of binding partners for modular domains such as Src homology 2 (SH2) is important for understanding the biological function of the corresponding SH2 proteins. We have developed a worldwide web-accessible computer program dubbed SMALI for scoring matrix-assisted ligand identification for SH2 domains and other signaling modules. The current version of SMALI harbors 76 unique scoring matrices for SH2 domains derived from screening oriented peptide array libraries. These scoring matrices are used to search a protein database for short peptides preferred by an SH2 domain. An experimentally determined cut-off value is used to normalize an SMALI score, therefore allowing for direct comparison in peptide-binding potential for different SH2 domains. SMALI employs distinct scoring matrices from Scansite, a popular motif-scanning program. Moreover, SMALI contains built-in filters for phosphoproteins, Gene Ontology (GO) correlation and colocalization of subject and query proteins. Compared to Scansite, SMALI exhibited improved accuracy in identifying binding peptides for SH2 domains. Applying SMALI to a group of SH2 domains identified hundreds of interactions that overlap significantly with known networks mediated by the corresponding SH2 proteins, suggesting SMALI is a useful tool for facile identification of signaling networks mediated by modular domains that recognize short linear peptide motifs.


The authors wish it to be known that, in their opinion, the first two authors should be regarded as joint First Authors.


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer: Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.