SpaceGrow:基于形状的亿万级组合片段空间高效虚拟筛选。

IF 4.3 3区 材料科学 Q1 ENGINEERING, ELECTRICAL & ELECTRONIC
Sophia M. N. Hönig, Florian Flachsenberg, Christiane Ehrt, Alexander Neumann, Robert Schmidt, Christian Lemmen, Matthias Rarey
{"title":"SpaceGrow:基于形状的亿万级组合片段空间高效虚拟筛选。","authors":"Sophia M. N. Hönig,&nbsp;Florian Flachsenberg,&nbsp;Christiane Ehrt,&nbsp;Alexander Neumann,&nbsp;Robert Schmidt,&nbsp;Christian Lemmen,&nbsp;Matthias Rarey","doi":"10.1007/s10822-024-00551-7","DOIUrl":null,"url":null,"abstract":"<p>The growing size of make-on-demand chemical libraries is posing new challenges to cheminformatics. These ultra-large chemical libraries became too large for exhaustive enumeration. Using a combinatorial approach instead, the resource requirement scales approximately with the number of synthons instead of the number of molecules. This gives access to billions or trillions of compounds as so-called chemical spaces with moderate hardware and in a reasonable time frame. While extremely performant ligand-based 2D methods exist in this context, 3D methods still largely rely on exhaustive enumeration and therefore fail to apply. Here, we present SpaceGrow: a novel shape-based 3D approach for ligand-based virtual screening of billions of compounds within hours on a single CPU. Compared to a conventional superposition tool, SpaceGrow shows comparable pose reproduction capacity based on RMSD and superior ranking performance while being orders of magnitude faster. Result assessment of two differently sized subsets of the eXplore space reveals a higher probability of finding superior results in larger spaces highlighting the potential of searching in ultra-large spaces. Furthermore, the application of SpaceGrow in a drug discovery workflow was investigated in four examples involving G protein-coupled receptors (GPCRs) with the aim to identify compounds with similar binding capabilities and molecular novelty.</p><p>SpaceGrow descriptor comparison for an example cut in the molecule of interest. Scoring scheme is implied for one fragment of this cut. </p>","PeriodicalId":3,"journal":{"name":"ACS Applied Electronic Materials","volume":null,"pages":null},"PeriodicalIF":4.3000,"publicationDate":"2024-03-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC10944417/pdf/","citationCount":"0","resultStr":"{\"title\":\"SpaceGrow: efficient shape-based virtual screening of billion-sized combinatorial fragment spaces\",\"authors\":\"Sophia M. N. Hönig,&nbsp;Florian Flachsenberg,&nbsp;Christiane Ehrt,&nbsp;Alexander Neumann,&nbsp;Robert Schmidt,&nbsp;Christian Lemmen,&nbsp;Matthias Rarey\",\"doi\":\"10.1007/s10822-024-00551-7\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<p>The growing size of make-on-demand chemical libraries is posing new challenges to cheminformatics. These ultra-large chemical libraries became too large for exhaustive enumeration. Using a combinatorial approach instead, the resource requirement scales approximately with the number of synthons instead of the number of molecules. This gives access to billions or trillions of compounds as so-called chemical spaces with moderate hardware and in a reasonable time frame. While extremely performant ligand-based 2D methods exist in this context, 3D methods still largely rely on exhaustive enumeration and therefore fail to apply. Here, we present SpaceGrow: a novel shape-based 3D approach for ligand-based virtual screening of billions of compounds within hours on a single CPU. Compared to a conventional superposition tool, SpaceGrow shows comparable pose reproduction capacity based on RMSD and superior ranking performance while being orders of magnitude faster. Result assessment of two differently sized subsets of the eXplore space reveals a higher probability of finding superior results in larger spaces highlighting the potential of searching in ultra-large spaces. Furthermore, the application of SpaceGrow in a drug discovery workflow was investigated in four examples involving G protein-coupled receptors (GPCRs) with the aim to identify compounds with similar binding capabilities and molecular novelty.</p><p>SpaceGrow descriptor comparison for an example cut in the molecule of interest. Scoring scheme is implied for one fragment of this cut. </p>\",\"PeriodicalId\":3,\"journal\":{\"name\":\"ACS Applied Electronic Materials\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":4.3000,\"publicationDate\":\"2024-03-17\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC10944417/pdf/\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"ACS Applied Electronic Materials\",\"FirstCategoryId\":\"99\",\"ListUrlMain\":\"https://link.springer.com/article/10.1007/s10822-024-00551-7\",\"RegionNum\":3,\"RegionCategory\":\"材料科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"ENGINEERING, ELECTRICAL & ELECTRONIC\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"ACS Applied Electronic Materials","FirstCategoryId":"99","ListUrlMain":"https://link.springer.com/article/10.1007/s10822-024-00551-7","RegionNum":3,"RegionCategory":"材料科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"ENGINEERING, ELECTRICAL & ELECTRONIC","Score":null,"Total":0}
引用次数: 0

摘要

按需制造化学库的规模不断扩大,给化学信息学带来了新的挑战。这些超大型化学库变得过于庞大,无法进行详尽的枚举。如果采用组合方法,资源需求将与合成子的数量而不是分子的数量成近似比例。这样,就能以适度的硬件和合理的时间范围访问数十亿或数万亿化合物的所谓化学空间。在这种情况下,虽然基于配体的二维方法性能极佳,但三维方法在很大程度上仍依赖于穷举法,因此并不适用。在此,我们介绍 SpaceGrow:一种基于形状的新型三维方法,可在数小时内利用单个 CPU 对数十亿化合物进行基于配体的虚拟筛选。与传统的叠加工具相比,SpaceGrow 基于 RMSD 显示出相当的姿态再现能力和卓越的排序性能,同时速度快了几个数量级。对 eXplore 空间的两个不同大小的子集进行的结果评估显示,在较大的空间中找到卓越结果的概率更高,这突出表明了在超大空间中搜索的潜力。此外,在涉及 G 蛋白偶联受体(GPCR)的四个实例中,研究了 SpaceGrow 在药物发现工作流程中的应用,目的是找出具有相似结合能力和分子新颖性的化合物。
本文章由计算机程序翻译,如有差异,请以英文原文为准。

SpaceGrow: efficient shape-based virtual screening of billion-sized combinatorial fragment spaces

SpaceGrow: efficient shape-based virtual screening of billion-sized combinatorial fragment spaces

The growing size of make-on-demand chemical libraries is posing new challenges to cheminformatics. These ultra-large chemical libraries became too large for exhaustive enumeration. Using a combinatorial approach instead, the resource requirement scales approximately with the number of synthons instead of the number of molecules. This gives access to billions or trillions of compounds as so-called chemical spaces with moderate hardware and in a reasonable time frame. While extremely performant ligand-based 2D methods exist in this context, 3D methods still largely rely on exhaustive enumeration and therefore fail to apply. Here, we present SpaceGrow: a novel shape-based 3D approach for ligand-based virtual screening of billions of compounds within hours on a single CPU. Compared to a conventional superposition tool, SpaceGrow shows comparable pose reproduction capacity based on RMSD and superior ranking performance while being orders of magnitude faster. Result assessment of two differently sized subsets of the eXplore space reveals a higher probability of finding superior results in larger spaces highlighting the potential of searching in ultra-large spaces. Furthermore, the application of SpaceGrow in a drug discovery workflow was investigated in four examples involving G protein-coupled receptors (GPCRs) with the aim to identify compounds with similar binding capabilities and molecular novelty.

SpaceGrow descriptor comparison for an example cut in the molecule of interest. Scoring scheme is implied for one fragment of this cut.

求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
CiteScore
7.20
自引率
4.30%
发文量
567
×
引用
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学术官方微信