GraphCPP:通过图神经网络预测细胞穿透肽的最新方法。

IF 6.8 2区 医学 Q1 PHARMACOLOGY & PHARMACY British Journal of Pharmacology Pub Date : 2024-11-20 DOI:10.1111/bph.17388
Attila Imre, Balázs Balogh, István Mándity
{"title":"GraphCPP:通过图神经网络预测细胞穿透肽的最新方法。","authors":"Attila Imre, Balázs Balogh, István Mándity","doi":"10.1111/bph.17388","DOIUrl":null,"url":null,"abstract":"<p><strong>Background and purpose: </strong>Cell-penetrating peptides (CPPs) are short amino acid sequences that can penetrate cell membranes and deliver molecules into cells. Several models have been developed for their discovery, yet these models often face challenges in accurately predicting membrane penetration due to the complex nature of peptide-cell interactions. Hence, there is a need for innovative approaches that can enhance predictive performance.</p><p><strong>Experimental approach: </strong>In this study, we present the application GraphCPP, a novel graph neural network (GNN) for the prediction of membrane penetration capability of peptides.</p><p><strong>Key results: </strong>A new comprehensive dataset-dubbed CPP1708-was constructed resulting in the largest reliable database of CPPs to date. Comparative analyses with previous methods, such as MLCPP2, C2Pred, CellPPD and CellPPD-Mod, demonstrated the superior predictive performance of our model. Upon testing against other published methods, GraphCPP performs exceptionally, achieving 0.5787 Matthews correlation coefficient and 0.8459 area under the curve (AUC) values on one dataset. This means a 92.8% and 23.3% improvement in Matthews correlation coefficient and AUC measures respectively compared with the next best model. The capability of the model to effectively learn peptide representations was demonstrated through t-distributed stochastic neighbour embedding plots. Additionally, the uncertainty analysis revealed that GraphCPP maintains high confidence in predictions for peptides shorter than 40 amino acids. The source code is available at https://github.com/attilaimre99/GraphCPP.</p><p><strong>Conclusion and implications: </strong>These findings indicate the potential of GNN-based models to improve CPP penetration prediction and it may contribute towards the development of more efficient drug delivery systems.</p>","PeriodicalId":9262,"journal":{"name":"British Journal of Pharmacology","volume":" ","pages":""},"PeriodicalIF":6.8000,"publicationDate":"2024-11-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"GraphCPP: The new state-of-the-art method for cell-penetrating peptide prediction via graph neural networks.\",\"authors\":\"Attila Imre, Balázs Balogh, István Mándity\",\"doi\":\"10.1111/bph.17388\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<p><strong>Background and purpose: </strong>Cell-penetrating peptides (CPPs) are short amino acid sequences that can penetrate cell membranes and deliver molecules into cells. Several models have been developed for their discovery, yet these models often face challenges in accurately predicting membrane penetration due to the complex nature of peptide-cell interactions. Hence, there is a need for innovative approaches that can enhance predictive performance.</p><p><strong>Experimental approach: </strong>In this study, we present the application GraphCPP, a novel graph neural network (GNN) for the prediction of membrane penetration capability of peptides.</p><p><strong>Key results: </strong>A new comprehensive dataset-dubbed CPP1708-was constructed resulting in the largest reliable database of CPPs to date. Comparative analyses with previous methods, such as MLCPP2, C2Pred, CellPPD and CellPPD-Mod, demonstrated the superior predictive performance of our model. Upon testing against other published methods, GraphCPP performs exceptionally, achieving 0.5787 Matthews correlation coefficient and 0.8459 area under the curve (AUC) values on one dataset. This means a 92.8% and 23.3% improvement in Matthews correlation coefficient and AUC measures respectively compared with the next best model. The capability of the model to effectively learn peptide representations was demonstrated through t-distributed stochastic neighbour embedding plots. Additionally, the uncertainty analysis revealed that GraphCPP maintains high confidence in predictions for peptides shorter than 40 amino acids. The source code is available at https://github.com/attilaimre99/GraphCPP.</p><p><strong>Conclusion and implications: </strong>These findings indicate the potential of GNN-based models to improve CPP penetration prediction and it may contribute towards the development of more efficient drug delivery systems.</p>\",\"PeriodicalId\":9262,\"journal\":{\"name\":\"British Journal of Pharmacology\",\"volume\":\" \",\"pages\":\"\"},\"PeriodicalIF\":6.8000,\"publicationDate\":\"2024-11-20\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"British Journal of Pharmacology\",\"FirstCategoryId\":\"3\",\"ListUrlMain\":\"https://doi.org/10.1111/bph.17388\",\"RegionNum\":2,\"RegionCategory\":\"医学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"PHARMACOLOGY & PHARMACY\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"British Journal of Pharmacology","FirstCategoryId":"3","ListUrlMain":"https://doi.org/10.1111/bph.17388","RegionNum":2,"RegionCategory":"医学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"PHARMACOLOGY & PHARMACY","Score":null,"Total":0}
引用次数: 0

摘要

背景和目的:细胞穿透肽(CPPs)是一种能穿透细胞膜并将分子送入细胞的短氨基酸序列。目前已开发出多种用于发现它们的模型,但由于肽与细胞间相互作用的复杂性,这些模型在准确预测膜穿透性方面往往面临挑战。因此,我们需要能提高预测性能的创新方法:在本研究中,我们介绍了 GraphCPP 的应用,这是一种新型图神经网络(GNN),用于预测多肽的膜穿透能力:我们构建了一个新的综合数据集,称为 CPP1708,这是迄今为止最大的可靠 CPP 数据库。与以往方法(如 MLCPP2、C2Pred、CellPPD 和 CellPPD-Mod)的比较分析表明,我们的模型具有更优越的预测性能。在与其他已发布方法的对比测试中,GraphCPP 表现优异,在一个数据集上实现了 0.5787 的马修斯相关系数和 0.8459 的曲线下面积(AUC)值。这意味着与次佳模型相比,马修斯相关系数和 AUC 值分别提高了 92.8% 和 23.3%。该模型有效学习多肽表征的能力通过 t 分布随机相邻嵌入图得到了证明。此外,不确定性分析表明,GraphCPP 对短于 40 个氨基酸的肽的预测保持了很高的置信度。源代码见 https://github.com/attilaimre99/GraphCPP.Conclusion 和 implications:这些研究结果表明,基于 GNN 的模型具有改进 CPP 穿透预测的潜力,它可能有助于开发更高效的给药系统。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
GraphCPP: The new state-of-the-art method for cell-penetrating peptide prediction via graph neural networks.

Background and purpose: Cell-penetrating peptides (CPPs) are short amino acid sequences that can penetrate cell membranes and deliver molecules into cells. Several models have been developed for their discovery, yet these models often face challenges in accurately predicting membrane penetration due to the complex nature of peptide-cell interactions. Hence, there is a need for innovative approaches that can enhance predictive performance.

Experimental approach: In this study, we present the application GraphCPP, a novel graph neural network (GNN) for the prediction of membrane penetration capability of peptides.

Key results: A new comprehensive dataset-dubbed CPP1708-was constructed resulting in the largest reliable database of CPPs to date. Comparative analyses with previous methods, such as MLCPP2, C2Pred, CellPPD and CellPPD-Mod, demonstrated the superior predictive performance of our model. Upon testing against other published methods, GraphCPP performs exceptionally, achieving 0.5787 Matthews correlation coefficient and 0.8459 area under the curve (AUC) values on one dataset. This means a 92.8% and 23.3% improvement in Matthews correlation coefficient and AUC measures respectively compared with the next best model. The capability of the model to effectively learn peptide representations was demonstrated through t-distributed stochastic neighbour embedding plots. Additionally, the uncertainty analysis revealed that GraphCPP maintains high confidence in predictions for peptides shorter than 40 amino acids. The source code is available at https://github.com/attilaimre99/GraphCPP.

Conclusion and implications: These findings indicate the potential of GNN-based models to improve CPP penetration prediction and it may contribute towards the development of more efficient drug delivery systems.

求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
CiteScore
15.40
自引率
12.30%
发文量
270
审稿时长
2.0 months
期刊介绍: The British Journal of Pharmacology (BJP) is a biomedical science journal offering comprehensive international coverage of experimental and translational pharmacology. It publishes original research, authoritative reviews, mini reviews, systematic reviews, meta-analyses, databases, letters to the Editor, and commentaries. Review articles, databases, systematic reviews, and meta-analyses are typically commissioned, but unsolicited contributions are also considered, either as standalone papers or part of themed issues. In addition to basic science research, BJP features translational pharmacology research, including proof-of-concept and early mechanistic studies in humans. While it generally does not publish first-in-man phase I studies or phase IIb, III, or IV studies, exceptions may be made under certain circumstances, particularly if results are combined with preclinical studies.
期刊最新文献
Targeting the NLRP3 inflammasome signalling for the management of atrial fibrillation. Elucidating the beneficial impact of exercise on chronic obstructive pulmonary disease and its comorbidities: Integrating proteomic and immunological insights. Evidence generation throughout paediatric medicines life cycle: findings from collaborative work between European Medicines Agency (EMA) and EUnetHTA on use of extrapolation. Plasma miR-1-3p levels predict severity in hospitalized COVID-19 patients. EDITORIAL for BJP themed issue "noncoding RNA therapeutics".
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1