PharmacoMatch: Efficient 3D Pharmacophore Screening via Neural Subgraph Matching
This addresses the challenge of efficient virtual screening for drug discovery, offering a promising speed-up for large datasets, though it appears incremental as it builds on existing subgraph matching and contrastive learning techniques.
The paper tackled the computational bottleneck in 3D pharmacophore screening for large drug discovery datasets by introducing PharmacoMatch, a contrastive learning method based on neural subgraph matching, which achieved significantly shorter runtimes while maintaining comparable performance metrics.
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.