首页> 外文会议>Annual International Conference on Research in Computational Molecular Biology(RECOMB 2005); 20050514-18; Cambridge,MA(US) >Predicting Protein-Peptide Binding Affinity by Learning Peptide-Peptide Distance Functions
【24h】

Predicting Protein-Peptide Binding Affinity by Learning Peptide-Peptide Distance Functions

机译:通过学习肽-肽距离函数预测蛋白-肽结合亲和力

获取原文
获取原文并翻译 | 示例

摘要

Many important cellular response mechanisms are activated when a peptide binds to an appropriate receptor. In the immune system, the recognition of pathogen peptides begins when they bind to cell membrane Major Histocompatibility Complexes (MHCs). MHC proteins then carry these peptides to the cell surface in order to allow the activation of cytotoxic T-cells. The MHC binding cleft is highly polymorphic and therefore protein-peptide binding is highly specific. Developing computational methods for predicting protein-peptide binding is important for vaccine design and treatment of diseases like cancer. Previous learning approaches address the binding prediction problem using traditional margin based binary classifiers. In this paper we propose a novel approach for predicting binding affinity. Our approach is based on learning a peptide-peptide distance function. Moreover, we learn a single peptide-peptide distance function over an entire family of proteins (e.g MHC class Ⅰ). 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. We compare our method to various state-of-the-art binding prediction algorithms on MHC class Ⅰ and MHC class Ⅱ 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, DistBoost's performance gain, when compared to other computational methods, is even more pronounced.
机译:当肽结合适当的受体时,许多重要的细胞反应机制就会被激活。在免疫系统中,当病原体肽与细胞膜主要组织相容性复合物(MHC)结合时,便开始对其进行识别。然后,MHC蛋白将这些肽携带到细胞表面,以激活细胞毒性T细胞。 MHC结合裂隙具有高度多态性,因此蛋白质-肽结合具有高度特异性。开发预测蛋白质-肽结合的计算方法对于疫苗设计和治疗癌症等疾病非常重要。先前的学习方法使用传统的基于余量的二进制分类器解决绑定预测问题。在本文中,我们提出了一种预测结合亲和力的新方法。我们的方法基于学习肽-肽距离函数。此外,我们学习了整个蛋白质家族(例如MHCⅠ类)的单个肽-肽距离函数。该距离函数可用于计算新型肽与给定家族中任何蛋白质的亲和力。为了学习这些肽-肽距离函数,我们将问题形式化为带有等价约束形式的部分信息的半监督学习问题。具体来说,我们建议使用DistBoost,这是一种半监督的远程学习算法。我们将我们的方法与MHCⅠ类和MHCⅡ类数据集上的各种最新绑定预测算法进行了比较。在几乎所有情况下,我们的方法都优于所有竞争对手。我们的新方法的主要优点之一是,它还可以学习相对于仅存在少量标记肽的蛋白质的亲和功能。在这些情况下,与其他计算方法相比,DistBoost的性能提升更为明显。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号