DeepGraphMol, a multi-objective, computational strategy for generating molecules with desirable properties: a graph convolution and reinforcement learning approach



Khemchandani, Yash, O'Hagan, Steve ORCID: 0000-0001-6235-5462, Samanta, Soumitra ORCID: 0000-0003-2200-3061, Swainston, Neil ORCID: 0000-0001-7020-1236, Roberts, Timothy ORCID: 0000-0002-1464-0151, Bollegala, Danushka ORCID: 0000-0003-4476-7003 and Kell, Douglas
(2020) DeepGraphMol, a multi-objective, computational strategy for generating molecules with desirable properties: a graph convolution and reinforcement learning approach.

[img] Text
2020.06.26.172908.full.pdf - Submitted Version

Download (1MB) | Preview

Abstract

Abstract We address the problem of generating novel molecules with desired interaction properties as a multi-objective optimization problem. Interaction binding models are learned from binding data using graph convolution networks (GCNs). Since the experimentally obtained property scores are recognised as having potentially gross errors, we adopted a robust loss for the model. Combinations of these terms, including drug likeness and synthetic accessibility, are then optimized using reinforcement learning based on a graph convolution policy approach. Some of the molecules generated, while legitimate chemically, can have excellent drug-likeness scores but appear unusual. We provide an example based on the binding potency of small molecules to dopamine transporters. We extend our method successfully to use a multi-objective reward function, in this case for generating novel molecules that bind with dopamine transporters but not with those for norepinephrine. Our method should be generally applicable to the generation in silico of molecules with desirable properties.

Item Type: Article
Depositing User: Symplectic Admin
Date Deposited: 03 Jul 2020 08:17
Last Modified: 15 Sep 2021 03:10
DOI: 10.21203/rs.3.rs-32446/v1
URI: https://livrepository.liverpool.ac.uk/id/eprint/3092518