Generalizing molecular design via flexible search space control

Abstract Recent advances in generative artificial intelligence have made in silico molecular design a powerful approach for exploring chemical space toward specific goals. However, despite the need for trial-and-error adjustment of generative strategies and reward formulations, most methods implicitly fix the searchable chemical space, significantly limiting flexibility in practical design. This paper introduces ChemTSv3, an exploration framework with a flexible architecture that accommodates diverse design scenarios for adaptive molecular design. Specifically, molecular representations are unified as nodes, including string-based encodings, molecular graphs, and protein sequences. Molecular generations and editing operations are abstracted as transitions between nodes, allowing graph-based modifications, sequential mutations, and large-language-model-driven transformations to be handled within the same formulation. Representations and transition types can be dynamically switched to adapt the search space to the stage and nature of the design task. Here we show that this flexibility enables efficient exploration across diverse design spaces, from drug-like small molecules to proteins.

Authors

Institutions

Publication Details

Journal
Communications Chemistry
Published
2026-08-21
DOI
https://doi.org/10.1038/s42004-026-02172-7
Primary Topic
Computational Drug Discovery Methods
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Generalizing molecular design via flexible search space control

Masateru Ohta, Nobuo Cho, Shoichi Ishida, Kazuki Yoshizoe et al.
Communications Chemistry
Computational Drug Discovery Methods
article

Generalizing molecular design via flexible search space control

Masateru Ohta, Nobuo Cho, Shoichi Ishida, Kazuki Yoshizoe, Koji Tsuda, Kei Terayama, Tatsuya Yoshizawa, Satoru Fujii, Masato Sumita, Yuki Murakami, Teruki Honma
article en

Abstract

Abstract Recent advances in generative artificial intelligence have made in silico molecular design a powerful approach for exploring chemical space toward specific goals. However, despite the need for trial-and-error adjustment of generative strategies and reward formulations, most methods implicitly fix the searchable chemical space, significantly limiting flexibility in practical design. This paper introduces ChemTSv3, an exploration framework with a flexible architecture that accommodates diverse design scenarios for adaptive molecular design. Specifically, molecular representations are unified as nodes, including string-based encodings, molecular graphs, and protein sequences. Molecular generations and editing operations are abstracted as transitions between nodes, allowing graph-based modifications, sequential mutations, and large-language-model-driven transformations to be handled within the same formulation. Representations and transition types can be dynamically switched to adapt the search space to the stage and nature of the design task. Here we show that this flexibility enables efficient exploration across diverse design spaces, from drug-like small molecules to proteins.

Communications Chemistry
Kyushu University (JP), RIKEN Center for Advanced Intelligence Project (JP), RIKEN Center for Computational Science (JP), RIKEN Center for Integrative Medical Sciences (JP), The University of Tokyo (JP), Yokohama City University (JP)
Ministry of Education, Culture, Sports, Science and Technology, Japan Society for the Promotion of Science
Openalex Percentile: Top 9%
Computational Drug Discovery Methods
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.