利用 DOCK 构建蛋白质中有机小分子的片段和扭转偏置算法

IF 3.4 3区 化学 Q2 CHEMISTRY, MULTIDISCIPLINARY Journal of Computational Chemistry Pub Date : 2024-10-22 DOI:10.1002/jcc.27508
John D. Bickel, Brock T. Boysan, Robert C. Rizzo
{"title":"利用 DOCK 构建蛋白质中有机小分子的片段和扭转偏置算法","authors":"John D. Bickel, Brock T. Boysan, Robert C. Rizzo","doi":"10.1002/jcc.27508","DOIUrl":null,"url":null,"abstract":"The computational construction of small organic molecules (de novo design), directly in a protein binding site, is an effective means for generating novel ligands tailored to fit the pocket environment. In this work, we present two new methods, which aim to improve de novo design outcomes using (1) biasing algorithms to prioritize selection and/or acceptance of fragments and torsions during growth, and (2) parallel‐based clustering and pruning algorithms to remove duplicate molecules as candidate fragment are added. Large‐scale testing encompassing thousands of simulations were employed to interrogate the methods in terms of multiple metrics which include numbers of duplicate molecules generated, pairwise‐similarity, focused library reconstruction rates, fragment and torsion frequencies, fragment and torsion rank scores, interaction energy and drug‐likeness scores, and 3D pose comparisons. The biasing algorithms, particularly those that include fragment and torsion components simultaneously, led to molecules that more closely mimicked the distributions of fragments and torsions found in drug‐like libraries. The new parallel‐based clustering and pruning algorithms, compared with the existing serial approach, also led to larger ensembles comprised of topologically unique molecules with much greater efficiency by removing redundant growth paths.","PeriodicalId":188,"journal":{"name":"Journal of Computational Chemistry","volume":"40 1","pages":""},"PeriodicalIF":3.4000,"publicationDate":"2024-10-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Fragment and torsion biasing algorithms for construction of small organic molecules in proteins using DOCK\",\"authors\":\"John D. Bickel, Brock T. Boysan, Robert C. Rizzo\",\"doi\":\"10.1002/jcc.27508\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The computational construction of small organic molecules (de novo design), directly in a protein binding site, is an effective means for generating novel ligands tailored to fit the pocket environment. In this work, we present two new methods, which aim to improve de novo design outcomes using (1) biasing algorithms to prioritize selection and/or acceptance of fragments and torsions during growth, and (2) parallel‐based clustering and pruning algorithms to remove duplicate molecules as candidate fragment are added. Large‐scale testing encompassing thousands of simulations were employed to interrogate the methods in terms of multiple metrics which include numbers of duplicate molecules generated, pairwise‐similarity, focused library reconstruction rates, fragment and torsion frequencies, fragment and torsion rank scores, interaction energy and drug‐likeness scores, and 3D pose comparisons. The biasing algorithms, particularly those that include fragment and torsion components simultaneously, led to molecules that more closely mimicked the distributions of fragments and torsions found in drug‐like libraries. The new parallel‐based clustering and pruning algorithms, compared with the existing serial approach, also led to larger ensembles comprised of topologically unique molecules with much greater efficiency by removing redundant growth paths.\",\"PeriodicalId\":188,\"journal\":{\"name\":\"Journal of Computational Chemistry\",\"volume\":\"40 1\",\"pages\":\"\"},\"PeriodicalIF\":3.4000,\"publicationDate\":\"2024-10-22\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Journal of Computational Chemistry\",\"FirstCategoryId\":\"92\",\"ListUrlMain\":\"https://doi.org/10.1002/jcc.27508\",\"RegionNum\":3,\"RegionCategory\":\"化学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q2\",\"JCRName\":\"CHEMISTRY, MULTIDISCIPLINARY\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Computational Chemistry","FirstCategoryId":"92","ListUrlMain":"https://doi.org/10.1002/jcc.27508","RegionNum":3,"RegionCategory":"化学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"CHEMISTRY, MULTIDISCIPLINARY","Score":null,"Total":0}
引用次数: 0

摘要

直接在蛋白质结合位点计算构建有机小分子(从头设计)是生成适合口袋环境的新型配体的有效方法。在这项工作中,我们提出了两种新方法,旨在利用(1)偏置算法和(2)基于并行的聚类和剪枝算法改善从头设计的结果,前者用于在生长过程中优先选择和/或接受片段和扭转,后者用于在添加候选片段时去除重复分子。我们采用了包含数千次模拟的大规模测试,从多个指标来检验这些方法,其中包括生成的重复分子数、配对相似度、集中库重建率、片段和扭转频率、片段和扭转等级分数、相互作用能量和药物相似度分数以及三维姿态比较。偏置算法,尤其是那些同时包含片段和扭转成分的算法,使分子更接近类药物库中发现的片段和扭转分布。与现有的串行方法相比,新的基于并行的聚类和剪枝算法还通过去除多余的生长路径,以更高的效率产生了由拓扑独特的分子组成的更大集合。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Fragment and torsion biasing algorithms for construction of small organic molecules in proteins using DOCK
The computational construction of small organic molecules (de novo design), directly in a protein binding site, is an effective means for generating novel ligands tailored to fit the pocket environment. In this work, we present two new methods, which aim to improve de novo design outcomes using (1) biasing algorithms to prioritize selection and/or acceptance of fragments and torsions during growth, and (2) parallel‐based clustering and pruning algorithms to remove duplicate molecules as candidate fragment are added. Large‐scale testing encompassing thousands of simulations were employed to interrogate the methods in terms of multiple metrics which include numbers of duplicate molecules generated, pairwise‐similarity, focused library reconstruction rates, fragment and torsion frequencies, fragment and torsion rank scores, interaction energy and drug‐likeness scores, and 3D pose comparisons. The biasing algorithms, particularly those that include fragment and torsion components simultaneously, led to molecules that more closely mimicked the distributions of fragments and torsions found in drug‐like libraries. The new parallel‐based clustering and pruning algorithms, compared with the existing serial approach, also led to larger ensembles comprised of topologically unique molecules with much greater efficiency by removing redundant growth paths.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
CiteScore
6.60
自引率
3.30%
发文量
247
审稿时长
1.7 months
期刊介绍: This distinguished journal publishes articles concerned with all aspects of computational chemistry: analytical, biological, inorganic, organic, physical, and materials. The Journal of Computational Chemistry presents original research, contemporary developments in theory and methodology, and state-of-the-art applications. Computational areas that are featured in the journal include ab initio and semiempirical quantum mechanics, density functional theory, molecular mechanics, molecular dynamics, statistical mechanics, cheminformatics, biomolecular structure prediction, molecular design, and bioinformatics.
期刊最新文献
Issue Information DC24: A new density coherence functional for multiconfiguration density‐coherence functional theory Excited state relaxation mechanisms of paracetamol and acetanilide. Stable, aromatic, and electrophilic azepinium ions: Design using quantum chemical methods Assessing small molecule conformational sampling methods in molecular docking
×
引用
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