LGAIFeb 2, 2023

De Novo Molecular Generation via Connection-aware Motif Mining

Microsoft
arXiv:2302.01129v256 citationsh-index: 91
AI Analysis

This work addresses the challenge of capturing common substructures in molecular generation for drug discovery or materials science, representing an incremental advance in fragment-based generative models.

The paper tackles the problem of generating novel molecules by proposing MiCaM, a method that mines connection-aware motifs from a molecule library using a data-driven algorithm, and achieves significant improvements over previous fragment-based baselines on distribution-learning and goal-directed benchmarks.

De novo molecular generation is an essential task for science discovery. Recently, fragment-based deep generative models have attracted much research attention due to their flexibility in generating novel molecules based on existing molecule fragments. However, the motif vocabulary, i.e., the collection of frequent fragments, is usually built upon heuristic rules, which brings difficulties to capturing common substructures from large amounts of molecules. In this work, we propose a new method, MiCaM, to generate molecules based on mined connection-aware motifs. Specifically, it leverages a data-driven algorithm to automatically discover motifs from a molecule library by iteratively merging subgraphs based on their frequency. The obtained motif vocabulary consists of not only molecular motifs (i.e., the frequent fragments), but also their connection information, indicating how the motifs are connected with each other. Based on the mined connection-aware motifs, MiCaM builds a connection-aware generator, which simultaneously picks up motifs and determines how they are connected. We test our method on distribution-learning benchmarks (i.e., generating novel molecules to resemble the distribution of a given training set) and goal-directed benchmarks (i.e., generating molecules with target properties), and achieve significant improvements over previous fragment-based baselines. Furthermore, we demonstrate that our method can effectively mine domain-specific motifs for different tasks.

Code Implementations1 repo
Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes