Abstract

Drug design is both a time consuming and expensive endeavour. Computational strategies offer viable options to address this task; deep learning approaches in particular are indeed gaining traction for their capability of dealing with chemical structures. A straightforward way to represent such structures is via their molecular graph, which in turn can be naturally processed by graph neural networks. This paper introduces AMCG, a dual atomic-molecular, conditional, latent-space, generative model built around graph processing layers able to support both unconditional and conditional molecular graph generation. Among other features, AMCG is a one-shot model allowing for fast sampling, explicit atomic type histogram assignation and property optimization via gradient ascent. The model was trained on the Quantum Machines 9 (QM9) and ZINC datasets, achieving state-of-the-art performances. Together with classic benchmarks, AMCG was also tested by generating large-scale sampled sets, showing robustness in terms of sustainable throughput of valid, novel and unique molecules.

Details

Title
AMCG: a graph dual atomic-molecular conditional molecular generator
Author
Abate, Carlo 1   VIAFID ORCID Logo  ; Decherchi, Sergio 2   VIAFID ORCID Logo  ; Cavalli, Andrea 3 

 Department of Pharmacy and Biotechnology (FaBiT), Alma Mater Studiorum, University of Bologna , Bologna, Italy; Computational & Chemical Biology, Fondazione Istituto Italiano di Tecnologia , Genoa, Italy 
 Data Science and Computation Facility, Fondazione Istituto Italiano di Tecnologia , Genoa, Italy 
 Computational & Chemical Biology, Fondazione Istituto Italiano di Tecnologia , Genoa, Italy; Centre Européen de Calcul Atomique et Moléculaire (CECAM), Ecole Polytechnique Fédérale de Lausanne , Lausanne, Switzerland 
First page
035004
Publication year
2024
Publication date
Sep 2024
Publisher
IOP Publishing
e-ISSN
26322153
Source type
Scholarly Journal
Language of publication
English
ProQuest document ID
3076284991
Copyright
© 2024 The Author(s). Published by IOP Publishing Ltd. This work is published under http://creativecommons.org/licenses/by/4.0 (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.