PepDist: a new framework for protein-peptide binding prediction based on learning peptide distance functions.
BACKGROUND
Many different aspects of cellular signalling, trafficking and targeting mechanisms are mediated by interactions between proteins and peptides. Representative examples are MHC-peptide complexes in the immune system. Developing computational methods for protein-peptide binding prediction is therefore an important task with applications to vaccine and drug design.


METHODS
Previous learning approaches address the binding prediction problem using traditional margin based binary classifiers. In this paper we propose PepDist: a novel approach for predicting binding affinity. Our approach is based on learning peptide-peptide distance functions. Moreover, we suggest to learn a single peptide-peptide distance function over an entire family of proteins (e.g. MHC class I). This distance function can be used to compute the affinity of a novel peptide to any of the proteins in the given family. In order to learn these peptide-peptide distance functions, we formalize the problem as a semi-supervised learning problem with partial information in the form of equivalence constraints. Specifically, we propose to use DistBoost, which is a semi-supervised distance learning algorithm.


RESULTS
We compare our method to various state-of-the-art binding prediction algorithms on MHC class I and MHC class II datasets. In almost all cases, our method outperforms all of its competitors. One of the major advantages of our novel approach is that it can also learn an affinity function over proteins for which only small amounts of labeled peptides exist. In these cases, our method's performance gain, when compared to other computational methods, is even more pronounced. We have recently uploaded the PepDist webserver which provides binding prediction of peptides to 35 different MHC class I alleles. The webserver which can be found at http://www.pepdist.cs.huji.ac.il is powered by a prediction engine which was trained using the framework presented in this paper.


CONCLUSIONS
The results obtained suggest that learning a single distance function over an entire family of proteins achieves higher prediction accuracy than learning a set of binary classifiers for each of the proteins separately. We also show the importance of obtaining information on experimentally determined non-binders. Learning with real non-binders generalizes better than learning with randomly generated peptides that are assumed to be non-binders. This suggests that information about non-binding peptides should also be published and made publicly available.
Hertz
Tomer
T
School of Computer Science and Engineering, The Hebrew University of Jerusalem, Jerusalem, 91904, Israel. tomboy@cs.huji.ac.il
Yanover
Chen
C
D000465:Algorithms; D000483:Alleles; D001665:Binding Sites; D019295:Computational Biology / Q000379:methods*; D030562:Databases, Protein; D015195:Drug Design; D005805:Genes, MHC Class I; D006680:HLA Antigens / Q000737:chemistry; D006801:Humans; D015233:Models, Statistical; D010455:Peptides / Q000737:chemistry*; D011485:Protein Binding; D012984:Software
D006680:HLA Antigens; D010455:Peptides