用体素网格生成新药分子,比传统方法更快更广
Pharmacophore-based design by learning on voxel grids
- 将分子构象转为体素网格,通过图像描述方式生成SMILES
- 在去重设计中生成多样性高的新分子,性能超越已有方法
- 结合2D子结构搜索,实现超大分子库的快速精准筛选
基于配体的药物发现依赖已知结合分子来寻找结构多样但可能同样有效的候选物。传统方法通常采用暴力比对查询分子与分子库中的化合物,使用分子相似性度量进行筛选。一种常用策略是将已知分子的药效团-形状特征叠加到库中每个分子的3D构象上,计算重叠程度并选取高重叠度的多样分子。尽管该虚拟筛选流程在提高命中率、骨架跳跃和规避专利方面取得显著成效,但其计算开销随库规模急剧上升,且仅限于现有化合物。本文利用体素化生成建模的新进展,提出基于药效团的生成模型及工作流,解决传统方法的扩展性与生成能力不足问题。我们提出VoxCap——一种从体素化分子表示生成SMILES字符串的体素图像描述方法,并设计两种实用场景:一是去重设计,目标是生成与查询分子具有高药效团-形状相似性的新分子;二是快速搜索,结合生成设计与低成本的2D子结构相似性搜索以实现高效命中识别。结果表明,VoxCap在生成多样化新分子方面显著优于以往方法;结合快速搜索工作流后,计算时间降低数个数量级,同时对所有查询分子均能返回有效命中,使原本无法通过暴力搜索的大规模分子库成为可处理对象。
原文摘要 · Abstract (English)
Ligand-based drug discovery (LBDD) relies on making use of known binders to a protein target to find structurally diverse molecules similarly likely to bind. This process typically involves a brute force search of the known binder (query) against a molecular library using some metric of molecular similarity. One popular approach overlays the pharmacophore-shape profile of the known binder to 3D conformations enumerated for each of the library molecules, computes overlaps, and picks a set of diverse library molecules with high overlaps. While this virtual screening workflow has had considerable success in hit diversification, scaffold hopping, and patent busting, it scales poorly with library sizes and restricts candidate generation to existing library compounds. Leveraging recent advances in voxel-based generative modelling, we propose a pharmacophore-based generative model and workflows that address the scaling and fecundity issues of conventional pharmacophore-based virtual screening. We introduce \emph{VoxCap}, a voxel captioning method for generating SMILES strings from voxelised molecular representations. We propose two workflows as practical use cases as well as benchmarks for pharmacophore-based generation: \emph{de-novo} design, in which we aim to generate new molecules with high pharmacophore-shape similarities to query molecules, and fast search, which aims to combine generative design with a cheap 2D substructure similarity search for efficient hit identification. Our results show that VoxCap significantly outperforms previous methods in generating diverse \textit{de-novo} hits. When combined with our fast search workflow, VoxCap reduces computational time by orders of magnitude while returning hits for all query molecules, enabling the search of large libraries that are intractable to search by brute force.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。