Javascript must be enabled to continue!
Gargoyles: An Open Source Graph-based molecular optimization method based on Deep Reinforcement Learning
View through CrossRef
Automatic optimization methods for compounds in the vast compound space are important for drug discovery and material design. Several machine learning-based molecular generative models for drug discovery have been proposed, but most of these methods generate compounds from scratch and are not suitable for exploring and optimizing around arbitrary compounds. In this study, we developed a compound optimization method based on molecular graphs using deep reinforcement learning. This method searches for compounds on a fragment-by-fragment basis and at high density by generating fragments to be added atom by atom. Experimental results confirmed that the QED, the optimization target set in this study, was enhanced by searching around the starting compound. This means that the generated compounds are structurally similar to the starting compounds, indicating that the method is suitable for starting generation from a given compound. The source code is available at https://github.com/sekijima-lab/GARGOYLES.
Title: Gargoyles: An Open Source Graph-based molecular optimization method based on Deep Reinforcement Learning
Description:
Automatic optimization methods for compounds in the vast compound space are important for drug discovery and material design.
Several machine learning-based molecular generative models for drug discovery have been proposed, but most of these methods generate compounds from scratch and are not suitable for exploring and optimizing around arbitrary compounds.
In this study, we developed a compound optimization method based on molecular graphs using deep reinforcement learning.
This method searches for compounds on a fragment-by-fragment basis and at high density by generating fragments to be added atom by atom.
Experimental results confirmed that the QED, the optimization target set in this study, was enhanced by searching around the starting compound.
This means that the generated compounds are structurally similar to the starting compounds, indicating that the method is suitable for starting generation from a given compound.
The source code is available at https://github.
com/sekijima-lab/GARGOYLES.
Related Results
Multiple surface segmentation using novel deep learning and graph based methods
Multiple surface segmentation using novel deep learning and graph based methods
<p>The task of automatically segmenting 3-D surfaces representing object boundaries is important in quantitative analysis of volumetric images, which plays a vital role in nu...
Drug–target affinity prediction with extended graph learning-convolutional networks
Drug–target affinity prediction with extended graph learning-convolutional networks
Abstract
Background
High-performance computing plays a pivotal role in computer-aided drug design, a field that holds significant promise in pharmac...
Abstract 902: Explainable AI: Graph machine learning for response prediction and biomarker discovery
Abstract 902: Explainable AI: Graph machine learning for response prediction and biomarker discovery
Abstract
Accurately predicting drug sensitivity and understanding what is driving it are major challenges in drug discovery. Graphs are a natural framework for captu...
Study on Scheme Optimization of bridge reinforcement increasing ratio
Study on Scheme Optimization of bridge reinforcement increasing ratio
Abstract
The bridge reinforcement methods, each method has its advantages and disadvantages. The load-bearing capacity of bridge members is controlled by the ultimat...
The Effect of Compression Reinforcement on the Shear Behavior of Concrete Beams with Hybrid Reinforcement
The Effect of Compression Reinforcement on the Shear Behavior of Concrete Beams with Hybrid Reinforcement
Abstract
This study examines the impact of steel compression reinforcement on the shear behavior of concrete beams reinforced with glass fiber reinforced polymer (GFRP) bar...
Domination of Polynomial with Application
Domination of Polynomial with Application
In this paper, .We .initiate the study of domination. polynomial , consider G=(V,E) be a simple, finite, and directed graph without. isolated. vertex .We present a study of the Ira...
E-Cordial Labeling of Some Families of Graphs
E-Cordial Labeling of Some Families of Graphs
An E-cordial labeling σ: E →{0,1} induces σ∗: V →{0,1} on graph G=(V,E), where (σ(v)=(∑_(u∈V)▒〖σ(uv)〗) mod 2 is taken over all edges uv∈E, and the labelling satisfies the condition...
Data Analytics on Graphs Part I: Graphs and Spectra on Graphs
Data Analytics on Graphs Part I: Graphs and Spectra on Graphs
The area of Data Analytics on graphs promises a paradigm shift, as we approach information processing of new classes of data which are typically acquired on irregular but structure...

