Skip Navigation


Nucleic Acids Research Advance Access originally published online on January 30, 2008
Nucleic Acids Research 2008 36(4):e22; doi:10.1093/nar/gkm848
This Article
Right arrow Full Text Freely available
Right arrow Print PDF (127K) Freely available
Right arrow Screen PDF (147K) Freely available
Right arrow Supplementary Data
Right arrowOA All Versions of this Article:
36/4/e22    most recent
gkm848v1
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 Wan, J.
Right arrow Articles by Li, T.
PubMed
Right arrow PubMed Citation
Right arrow Articles by Wan, J.
Right arrow Articles by Li, T.
Social Bookmarking
 Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Nucleic Acids Research, 2008, Vol. 36, No. 4 e22
© 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.


Methods Online

Meta-prediction of phosphorylation sites with weighted voting and restricted grid search parameter selection

Ji Wan1, Shuli Kang1, Chuanning Tang1, Jianhua Yan1, Yongliang Ren1, Jie Liu1, Xiaolian Gao2, Arindam Banerjee3, Lynda B. M. Ellis4 and Tongbin Li1,*

1Department of Neuroscience, 3Department of Computer Science and Engineering and 4Department of Laboratory Medicine and Pathology, University of Minnesota, Minneapolis, MN 55455, USA and 2Department of Biology and Biochemistry, University of Houston, Houston, TX 77204, USA

*To whom correspondence should be addressed. Tel: +1 612 626 3481; Fax: +1 612 626 5009; Email: toli{at}biocompute.umn.edu

Received May 15, 2007. Revised August 28, 2007. Accepted September 26, 2007.

Meta-predictors make predictions by organizing and processing the predictions produced by several other predictors in a defined problem domain. A proficient meta-predictor not only offers better predicting performance than the individual predictors from which it is constructed, but it also relieves experimentally researchers from making difficult judgments when faced with conflicting results made by multiple prediction programs. As increasing numbers of predicting programs are being developed in a large number of fields of life sciences, there is an urgent need for effective meta-prediction strategies to be investigated. We compiled four unbiased phosphorylation site datasets, each for one of the four major serine/threonine (S/T) protein kinase families—CDK, CK2, PKA and PKC. Using these datasets, we examined several meta-predicting strategies with 15 phosphorylation site predictors from six predicting programs: GPS, KinasePhos, NetPhosK, PPSP, PredPhospho and Scansite. Meta-predictors constructed with a generalized weighted voting meta-predicting strategy with parameters determined by restricted grid search possess the best performance, exceeding that of all individual predictors in predicting phosphorylation sites of all four kinase families. Our results demonstrate a useful decision-making tool for analysing the predictions of the various S/T phosphorylation site predictors. An implementation of these meta-predictors is available on the web at: http://MetaPred.umn.edu/MetaPredPS/.


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.