PharmacoMatch:通过神经子图匹配实现高效3D药效团筛选
PharmacoMatch: Efficient 3D Pharmacophore Screening via Neural Subgraph Matching
AI总结:
针对3D药效团筛选在超大规模分子库中计算成本高的问题,提出基于神经子图匹配与对比学习的 PharmacoMatch,在零样本预筛选中实现显著加速并保持相当性能。
摘要:
筛选库规模的不断扩大给药物发现中虚拟筛选方法的开发带来了重大挑战,因此有必要在大数据时代重新评估传统方法。尽管3D药效团筛选仍是一种主流技术,但其应用于超大规模数据集时,受到将查询药效团与数据库分子进行匹配所带来的计算成本限制。本研究提出 PharmacoMatch,这是一种基于神经子图匹配的新型对比学习方法。该方法将药效团筛选重新解释为近似子图匹配问题,并通过在嵌入空间中编码查询—靶点关系,实现对构象数据库的高效查询。我们对所学表征进行了全面研究,并在零样本设置下将 PharmacoMatch 作为预筛选工具进行评估。结果表明,其运行时间显著缩短,且性能指标与现有解决方案相当,为超大规模数据集筛选提供了颇具前景的加速方案。
英文摘要:
The increasing size of screening libraries poses a significant challenge for the development of virtual screening methods for drug discovery, necessitating a re-evaluation of traditional approaches in the era of big data. Although 3D pharmacophore screening remains a prevalent technique, its application to very large datasets is limited by the computational cost associated with matching query pharmacophores to database molecules. In this study, we introduce PharmacoMatch, a novel contrastive learning approach based on neural subgraph matching. Our method reinterprets pharmacophore screening as an approximate subgraph matching problem and enables efficient querying of conformational databases by encoding query-target relationships in the embedding space. We conduct comprehensive investigations of the learned representations and evaluate PharmacoMatch as pre-screening tool in a zero-shot setting. We demonstrate significantly shorter runtimes and comparable performance metrics to existing solutions, providing a promising speed-up for screening very large datasets.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。