Retrosynthesis Prediction via Search in (Hyper) Graph

Predicting reactants from a specified core product remains a critical challenge in retrosynthesis prediction. While semi-template-based and graph-edit-based methods have shown promising results in accuracy and interpretability, they struggle to handle complex reactions. In this paper, complex reactions refer to chemical reactions involving the participation of multiple bonds, such as those involving the multiple reaction center or the same leaving group being attached to multiple atoms. To address these limitations, we propose RetroSiG (Retrosynthesis via Search in (Hyper) Graph), a semi-template-based framework that reformulates retrosynthesis as a two-phase search problem: (i) reaction center identification as a search task in the product molecular graph, and (ii) leaving group completion as a search task in the leaving group hypergraph. RetroSiG’s novel search mechanism systematically explores subgraphs by leveraging reinforcement learning to guide node selection at each step. This approach ensures connectivity and efficient decision-making, thereby enabling the effective handling of complex reaction predictions. In addition, RetroSiG incorporates the one-hop constraint, a domain-specific prior inspired by the observation that reaction center molecular subgraphs and leaving group subgraphs are almost always connected. This constraint focuses exploration on first-order neighbors, significantly reducing the search space and improving computational efficiency without compromising accuracy. Furthermore, RetroSiG leverages a hypergraph structure to model implicit dependencies among leaving groups, which enhances robustness for reactions with multiple leaving group configurations. Comprehensive experiments demonstrate RetroSiG’s competitive performance across standard benchmarks, while ablation studies confirm the contributions of its key design components, including the hypergraph and the one-hop constraint. Our results highlight RetroSiG’s scalability and effectiveness in handling diverse and complex retrosynthesis tasks.

Authors

Institutions

Publication Details

Journal
IEEE Transactions on Automation Science and Engineering
Published
2025-01-01
DOI
https://doi.org/10.1109/tase.2025.3585129
Citations
1
Primary Topic
Advanced Graph Neural Networks
Type
article
Field-Weighted Citation Impact
2.48
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Retrosynthesis Prediction via Search in (Hyper) Graph

Binjie Hong, Limin Yu, Zixun Lan, Fei Ma et al.
1 citations
IEEE Transactions on Automation Science and Engineering
Advanced Graph Neural Networks
2.48
article

Retrosynthesis Prediction via Search in (Hyper) Graph

Binjie Hong, Limin Yu, Zixun Lan, Fei Ma, Zhenfu Liu, Maochun Xu, Zuo Zeng
article en
1 citations

Abstract

Predicting reactants from a specified core product remains a critical challenge in retrosynthesis prediction. While semi-template-based and graph-edit-based methods have shown promising results in accuracy and interpretability, they struggle to handle complex reactions. In this paper, complex reactions refer to chemical reactions involving the participation of multiple bonds, such as those involving the multiple reaction center or the same leaving group being attached to multiple atoms. To address these limitations, we propose RetroSiG (Retrosynthesis via Search in (Hyper) Graph), a semi-template-based framework that reformulates retrosynthesis as a two-phase search problem: (i) reaction center identification as a search task in the product molecular graph, and (ii) leaving group completion as a search task in the leaving group hypergraph. RetroSiG’s novel search mechanism systematically explores subgraphs by leveraging reinforcement learning to guide node selection at each step. This approach ensures connectivity and efficient decision-making, thereby enabling the effective handling of complex reaction predictions. In addition, RetroSiG incorporates the one-hop constraint, a domain-specific prior inspired by the observation that reaction center molecular subgraphs and leaving group subgraphs are almost always connected. This constraint focuses exploration on first-order neighbors, significantly reducing the search space and improving computational efficiency without compromising accuracy. Furthermore, RetroSiG leverages a hypergraph structure to model implicit dependencies among leaving groups, which enhances robustness for reactions with multiple leaving group configurations. Comprehensive experiments demonstrate RetroSiG’s competitive performance across standard benchmarks, while ablation studies confirm the contributions of its key design components, including the hypergraph and the one-hop constraint. Our results highlight RetroSiG’s scalability and effectiveness in handling diverse and complex retrosynthesis tasks.

IEEE Transactions on Automation Science and EngineeringVol. 22
University of Manchester (GB), Hanoi Open University (VN), Xi’an Jiaotong-Liverpool University (CN)
Openalex Percentile: Top 10%
Advanced Graph Neural Networks
2.48
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.