Recent computational advances in the identification of cryptic binding sites for drug discovery.

IF 2.8 Q2 MATHEMATICAL & COMPUTATIONAL BIOLOGY
Bioinformatics advances Pub Date : 2025-07-01 eCollection Date: 2025-01-01 DOI:10.1093/bioadv/vbaf156
Dorota Gašparíková, Rupesh Chikhale, Jason Cole, Ehmke Pohl
{"title":"Recent computational advances in the identification of cryptic binding sites for drug discovery.","authors":"Dorota Gašparíková, Rupesh Chikhale, Jason Cole, Ehmke Pohl","doi":"10.1093/bioadv/vbaf156","DOIUrl":null,"url":null,"abstract":"<p><strong>Motivation: </strong>Cryptic ligand binding sites, defined as binding pockets that exist in the ligand-bound state of a protein but not in its <i>apo</i> form, are gaining increasing interest due to the opportunities they provide for drug discovery.</p><p><strong>Results: </strong>This review article looks at the current state of cryptic binding site research, highlighting advancements in both molecular dynamic (MD) methods and machine learning (ML) methods to predict and utilize these sites.</p><p><strong>Availibilty and implementation: </strong>MD methods include the use of Markov State Models, Enhanced Sampling, and other methods such as Cosolvent MD, while ML methods utilize Support Vector Machine, Random Forest, and Neural Networks. Here, we discuss case studies for both methods and their overlaps, providing insight into the future and the limitations faced. Compared to MD methods, ML methods are often reported to be more cost- and time-effective. However, a limited number of datasets are available for training these ML methods. Integrating MD with ML methods promises to expand our ability to predict and validate new cryptic binding sites that can be evaluated for druggability.</p>","PeriodicalId":72368,"journal":{"name":"Bioinformatics advances","volume":"5 1","pages":"vbaf156"},"PeriodicalIF":2.8000,"publicationDate":"2025-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC12342141/pdf/","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Bioinformatics advances","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1093/bioadv/vbaf156","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"2025/1/1 0:00:00","PubModel":"eCollection","JCR":"Q2","JCRName":"MATHEMATICAL & COMPUTATIONAL BIOLOGY","Score":null,"Total":0}
引用次数: 0

Abstract

Motivation: Cryptic ligand binding sites, defined as binding pockets that exist in the ligand-bound state of a protein but not in its apo form, are gaining increasing interest due to the opportunities they provide for drug discovery.

Results: This review article looks at the current state of cryptic binding site research, highlighting advancements in both molecular dynamic (MD) methods and machine learning (ML) methods to predict and utilize these sites.

Availibilty and implementation: MD methods include the use of Markov State Models, Enhanced Sampling, and other methods such as Cosolvent MD, while ML methods utilize Support Vector Machine, Random Forest, and Neural Networks. Here, we discuss case studies for both methods and their overlaps, providing insight into the future and the limitations faced. Compared to MD methods, ML methods are often reported to be more cost- and time-effective. However, a limited number of datasets are available for training these ML methods. Integrating MD with ML methods promises to expand our ability to predict and validate new cryptic binding sites that can be evaluated for druggability.

用于药物发现的隐结合位点鉴定的最新计算进展。
动机:隐体配体结合位点被定义为存在于蛋白质的配体结合状态但不以载脂蛋白形式存在的结合袋,由于它们为药物发现提供了机会,因此越来越受到关注。结果:本文综述了隐结合位点的研究现状,重点介绍了分子动力学(MD)方法和机器学习(ML)方法在预测和利用这些位点方面的进展。可用性和实现:MD方法包括使用马尔可夫状态模型,增强采样和其他方法,如co溶剂MD,而ML方法利用支持向量机,随机森林和神经网络。在这里,我们讨论了两种方法及其重叠的案例研究,提供了对未来和面临的限制的见解。与MD方法相比,ML方法通常被报道为更具成本效益和时间效益。然而,用于训练这些ML方法的数据集数量有限。将MD与ML方法相结合有望扩大我们预测和验证新的可用于评估药物性的隐性结合位点的能力。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
CiteScore
1.60
自引率
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学术文献互助群
群 号:604180095
Book学术官方微信