Computational peptide discovery with a genetic programming approach

IF 3 3区 生物学 Q3 BIOCHEMISTRY & MOLECULAR BIOLOGY Journal of Computer-Aided Molecular Design Pub Date : 2024-04-03 DOI:10.1007/s10822-024-00558-0
Nicolas Scalzitti, Iliya Miralavy, David E. Korenchan, Christian T. Farrar, Assaf A. Gilad, Wolfgang Banzhaf
{"title":"Computational peptide discovery with a genetic programming approach","authors":"Nicolas Scalzitti, Iliya Miralavy, David E. Korenchan, Christian T. Farrar, Assaf A. Gilad, Wolfgang Banzhaf","doi":"10.1007/s10822-024-00558-0","DOIUrl":null,"url":null,"abstract":"<p>The development of peptides for therapeutic targets or biomarkers for disease diagnosis is a challenging task in protein engineering. Current approaches are tedious, often time-consuming and require complex laboratory data due to the vast search spaces that need to be considered. <i>In silico</i> methods can accelerate research and substantially reduce costs. Evolutionary algorithms are a promising approach for exploring large search spaces and can facilitate the discovery of new peptides. This study presents the development and use of a new variant of the genetic-programming-based POET algorithm, called POET<span>\\(_{Regex}\\)</span>, where individuals are represented by a list of regular expressions. This algorithm was trained on a small curated dataset and employed to generate new peptides improving the sensitivity of peptides in magnetic resonance imaging with chemical exchange saturation transfer (CEST). The resulting model achieves a performance gain of 20% over the initial POET models and is able to predict a candidate peptide with a 58% performance increase compared to the gold-standard peptide. By combining the power of genetic programming with the flexibility of regular expressions, new peptide targets were identified that improve the sensitivity of detection by CEST. This approach provides a promising research direction for the efficient identification of peptides with therapeutic or diagnostic potential.</p>","PeriodicalId":621,"journal":{"name":"Journal of Computer-Aided Molecular Design","volume":null,"pages":null},"PeriodicalIF":3.0000,"publicationDate":"2024-04-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Computer-Aided Molecular Design","FirstCategoryId":"99","ListUrlMain":"https://doi.org/10.1007/s10822-024-00558-0","RegionNum":3,"RegionCategory":"生物学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"BIOCHEMISTRY & MOLECULAR BIOLOGY","Score":null,"Total":0}
引用次数: 0

Abstract

The development of peptides for therapeutic targets or biomarkers for disease diagnosis is a challenging task in protein engineering. Current approaches are tedious, often time-consuming and require complex laboratory data due to the vast search spaces that need to be considered. In silico methods can accelerate research and substantially reduce costs. Evolutionary algorithms are a promising approach for exploring large search spaces and can facilitate the discovery of new peptides. This study presents the development and use of a new variant of the genetic-programming-based POET algorithm, called POET\(_{Regex}\), where individuals are represented by a list of regular expressions. This algorithm was trained on a small curated dataset and employed to generate new peptides improving the sensitivity of peptides in magnetic resonance imaging with chemical exchange saturation transfer (CEST). The resulting model achieves a performance gain of 20% over the initial POET models and is able to predict a candidate peptide with a 58% performance increase compared to the gold-standard peptide. By combining the power of genetic programming with the flexibility of regular expressions, new peptide targets were identified that improve the sensitivity of detection by CEST. This approach provides a promising research direction for the efficient identification of peptides with therapeutic or diagnostic potential.

查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
利用遗传编程方法计算肽的发现
开发用于治疗靶点或疾病诊断的生物标志物的多肽是蛋白质工程中一项具有挑战性的任务。由于需要考虑巨大的搜索空间,目前的方法繁琐、耗时且需要复杂的实验室数据。硅学方法可以加快研究速度并大幅降低成本。进化算法是一种探索大型搜索空间的有前途的方法,可促进新肽的发现。本研究介绍了基于遗传编程的 POET 算法的新变体 POET(_{Regex}\)的开发和使用,其中个体由正则表达式列表表示。该算法是在一个小型策划数据集上训练的,并用于生成新的肽,以提高肽在化学交换饱和转移(CEST)磁共振成像中的灵敏度。与最初的 POET 模型相比,生成的模型性能提高了 20%,与黄金标准肽相比,预测候选肽的性能提高了 58%。通过将遗传编程的强大功能与正则表达式的灵活性相结合,确定了新的多肽靶标,提高了 CEST 检测的灵敏度。这种方法为高效鉴定具有治疗或诊断潜力的多肽提供了一个前景广阔的研究方向。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
Journal of Computer-Aided Molecular Design
Journal of Computer-Aided Molecular Design 生物-计算机:跨学科应用
CiteScore
8.00
自引率
8.60%
发文量
56
审稿时长
3 months
期刊介绍: The Journal of Computer-Aided Molecular Design provides a form for disseminating information on both the theory and the application of computer-based methods in the analysis and design of molecules. The scope of the journal encompasses papers which report new and original research and applications in the following areas: - theoretical chemistry; - computational chemistry; - computer and molecular graphics; - molecular modeling; - protein engineering; - drug design; - expert systems; - general structure-property relationships; - molecular dynamics; - chemical database development and usage.
期刊最新文献
De novo drug design through gradient-based regularized search in information-theoretically controlled latent space. Computational design and experimental confirmation of a disulfide-stapled YAP helixα1-trap derived from TEAD4 helical hairpin to selectively capture YAP α1-helix with potent antitumor activity. Holistic in silico developability assessment of novel classes of small proteins using publicly available sequence-based predictors. FitScore: a fast machine learning-based score for 3D virtual screening enrichment. Development of human lactate dehydrogenase a inhibitors: high-throughput screening, molecular dynamics simulation and enzyme activity assay.
×
引用
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