Prediction of promiscuous and high-affinity mutated MHC binders.

Manoj Bhasin, G P S Raghava
{"title":"Prediction of promiscuous and high-affinity mutated MHC binders.","authors":"Manoj Bhasin,&nbsp;G P S Raghava","doi":"10.1089/153685903322328956","DOIUrl":null,"url":null,"abstract":"<p><p>The identification of peptides in an antigenic sequence that can bind with high affinity to a wide range of MHC alleles is one of the challenges in subunit vaccine design. The mutation of natural peptides is an alternative to obtaining peptides that can bind to a wide range of MHC alleles with high affinity. A large number of experiments are typically necessary to identify mutations that define high-affinity binding peptides. Therefore there is a need to develop a computational method for detecting amino acid mutations in a peptide for making it high-affinity or promiscuous MHC binders. This report describes a high-throughput computer driven solution for the identification of promiscuous and high-affinity mutated binders of 47 MHC class I alleles by introducing mutations in an antigenic sequence. The method implements quantitative matrices for creating optimal mutations in an antigenic sequence. It has two major options: (i) prediction of promiscuous MHC binders and (ii) prediction of high-affinity binders. In case of prediction of promiscuous binders, the server allows a user to select (i) permissible mutations in a peptide; (ii) MHC alleles to whom it should bind; and (iii) positions at which mutation is allowed. In the case of prediction of high-affinity binders, the server allows users to specify the positions that should be conserved in the native protein. In both cases, the method computes the type of mutations and position of mutations in 9-mer peptides required to have the desired results. The web server MMBPred is available at www.imtech.res.in/raghava/mmbpred/.</p>","PeriodicalId":83733,"journal":{"name":"Hybridoma and hybridomics","volume":"22 4","pages":"229-34"},"PeriodicalIF":0.0000,"publicationDate":"2003-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1089/153685903322328956","citationCount":"43","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Hybridoma and hybridomics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1089/153685903322328956","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 43

Abstract

The identification of peptides in an antigenic sequence that can bind with high affinity to a wide range of MHC alleles is one of the challenges in subunit vaccine design. The mutation of natural peptides is an alternative to obtaining peptides that can bind to a wide range of MHC alleles with high affinity. A large number of experiments are typically necessary to identify mutations that define high-affinity binding peptides. Therefore there is a need to develop a computational method for detecting amino acid mutations in a peptide for making it high-affinity or promiscuous MHC binders. This report describes a high-throughput computer driven solution for the identification of promiscuous and high-affinity mutated binders of 47 MHC class I alleles by introducing mutations in an antigenic sequence. The method implements quantitative matrices for creating optimal mutations in an antigenic sequence. It has two major options: (i) prediction of promiscuous MHC binders and (ii) prediction of high-affinity binders. In case of prediction of promiscuous binders, the server allows a user to select (i) permissible mutations in a peptide; (ii) MHC alleles to whom it should bind; and (iii) positions at which mutation is allowed. In the case of prediction of high-affinity binders, the server allows users to specify the positions that should be conserved in the native protein. In both cases, the method computes the type of mutations and position of mutations in 9-mer peptides required to have the desired results. The web server MMBPred is available at www.imtech.res.in/raghava/mmbpred/.

混杂和高亲和力突变MHC结合物的预测。
鉴定抗原序列中能够与多种MHC等位基因高亲和力结合的肽是亚单位疫苗设计的挑战之一。天然多肽的突变是获得多肽的一种替代方法,这些多肽可以高亲和力地结合广泛的MHC等位基因。通常需要大量的实验来确定确定高亲和力结合肽的突变。因此,需要开发一种计算方法来检测肽中的氨基酸突变,以使其成为高亲和力或混杂的MHC结合物。本报告描述了一种高通量计算机驱动的解决方案,通过在抗原序列中引入突变,用于鉴定47个MHC I类等位基因的混杂和高亲和力突变结合物。该方法实现用于在抗原序列中创建最佳突变的定量矩阵。它有两个主要的选择:(i)预测混杂的MHC结合物和(ii)预测高亲和力的结合物。在预测混杂结合剂的情况下,服务器允许用户选择(i)多肽中允许的突变;(ii)应与之结合的MHC等位基因;(iii)允许突变的位置。在预测高亲和力结合物的情况下,服务器允许用户指定应该在天然蛋白中保守的位置。在这两种情况下,该方法计算获得所需结果所需的9-聚肽中突变的类型和突变的位置。web服务器MMBPred可在www.imtech.res.in/raghava/mmbpred/上获得。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信