The JI
HOME HELP FEEDBACK SUBSCRIPTIONS ARCHIVE SEARCH TABLE OF CONTENTS
 QUICK SEARCH:   [advanced]


     
 


This Article
Right arrow Full Text
Right arrow Full Text (PDF)
Right arrow Data Supplement
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Right arrow Citation Map
Services
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 Download to citation manager
Right arrow Request Permissions
Citing Articles
Right arrow Citing Articles via HighWire
Right arrow Citing Articles via Google Scholar
Google Scholar
Right arrow Articles by Udaka, K.
Right arrow Articles by Abe, N.
Right arrow Search for Related Content
PubMed
Right arrow PubMed Citation
Right arrow Articles by Udaka, K.
Right arrow Articles by Abe, N.
The Journal of Immunology, 2002, 169: 5744-5753.
Copyright © 2002 by The American Association of Immunologists

Empirical Evaluation of a Dynamic Experiment Design Method for Prediction of MHC Class I-Binding Peptides1

Keiko Udaka2,*, Hiroshi Mamitsuka3,{dagger}, Yukinobu Nakaseko* and Naoki Abe{dagger},{ddagger}

* Department of Biophysics, Kyoto University, Kyoto, Japan; {dagger} Theory NEC Laboratory, Real World Computing Partnership, Kawasaki, Japan; and {ddagger} IBM Thomas J. Watson Research Center, Yorktown, NY 10598

The ability to predict MHC-binding peptides remains limited despite ever expanding demands for specific immunotherapy against cancers, infectious diseases, and autoimmune disorders. Previous analyses revealed position-specific preference of amino acids but failed to detect sequence patterns. Efforts to use computational analysis to identify sequence patterns have been hampered by the insufficiency of the number/quality of the peptide binding data. We propose here a dynamic experiment design to search for sequence patterns that are common to the MHC class I-binding peptides. The method is based on a committee-based framework of query learning using hidden Markov models as its component algorithm. It enables a comprehensive search of a large variety (209) of peptides with a small number of experiments. The learning was conducted in seven rounds of feedback loops, in which our computational method was used to determine the next set of peptides to be analyzed based on the results of the earlier iterations. After these training cycles, the algorithm enabled a real number prediction of MHC binding peptides with an accuracy surpassing that of the hitherto best performing positional scanning method.




This article has been cited by other articles:


Home page
Clin. Cancer Res.Home page
E. Hayashi, Y. Matsuzaki, G. Hasegawa, T. Yaguchi, S. Kurihara, T. Fujita, T. Kageshita, M. Sano, and Y. Kawakami
Identification of a Novel Cancer-Testis Antigen CRT2 Frequently Expressed in Various Cancers Using Representational Differential Analysis
Clin. Cancer Res., November 1, 2007; 13(21): 6267 - 6274.
[Abstract] [Full Text] [PDF]


Home page
BioinformaticsHome page
S. Zhu, K. Udaka, J. Sidney, A. Sette, K. F. Aoki-Kinoshita, and H. Mamitsuka
Improving MHC binding peptide prediction by incorporating binding data of auxiliary MHC molecules
Bioinformatics, July 1, 2006; 22(13): 1648 - 1655.
[Abstract] [Full Text] [PDF]


Home page
J. Immunol.Home page
J. Sidney, S. Southwood, V. Pasquetto, and A. Sette
Simultaneous Prediction of Binding Capacity for Multiple Molecules of the HLA B44 Supertype
J. Immunol., December 1, 2003; 171(11): 5964 - 5974.
[Abstract] [Full Text] [PDF]




HOME HELP FEEDBACK SUBSCRIPTIONS ARCHIVE SEARCH TABLE OF CONTENTS
This Website Copyright © 2002 by The American Association of Immunologists, Inc. All rights reserved.
All Contents Copyright © 2002 by The American Association of Immunologists, Inc. All rights reserved.