mlsanityData to 7 Oct 2026

Retrosynthesis Prediction via Search in (Hyper) Graph

arXiv 2402.06772 ↗First posted 9 Feb 2024q-bio.QM cs.AI cs.CEcited by 1

Not on the map. Why?

Abstract (arXiv)

Predicting reactants from a specified core product stands as a fundamental challenge within organic synthesis, termed retrosynthesis prediction. Recently, semi-template-based methods and graph-edits-based methods have achieved good performance in terms of both interpretability and accuracy. However, due to their mechanisms these methods cannot predict complex reactions, e.g., reactions with multiple reaction center or attaching the same leaving group to more than one atom. In this study we propose a semi-template-based method, the Retrosynthesis via Search in (Hyper) Graph (RetroSiG) framework to alleviate these limitations. In the proposed method, we turn the reaction center identification and the leaving group completion tasks as tasks of searching in the product molecular graph and leaving group hypergraph respectively. As a semi-template-based method RetroSiG has several advantages. First, RetroSiG is able to handle the complex reactions mentioned above by its novel search mechanism. Second, RetroSiG naturally exploits the hypergraph to model the implicit dependencies between leaving groups. Third, RetroSiG makes full use of the prior, i.e., one-hop constraint. It reduces the search space and enhances overall performance. Comprehensive experiments demonstrated that RetroSiG achieved competitive results. Furthermore, we conducted experiments to show the capability of RetroSiG in predicting complex reactions. Ablation experiments verified the efficacy of specific elements, such as the one-hop constraint and the leaving group hypergraph.

Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 24 of its 58 references that are in the map. First posted on arXiv 9 Feb 2024.

Builds on

24 of 58 references.

References · 24

  1. 2017Attention Is All You Needcited by 59,932
  2. 2014Adam: A Method for Stochastic Optimizationcited by 36,960
  3. 2019PyTorch: An Imperative Style, High-Performance Deep Learning Librarycited by 20,160
  4. 2022Training language models to follow instructions with human feedbackcited by 15,712
  5. 2017Proximal Policy Optimization Algorithmscited by 14,441
  6. 2021Decision Transformer: Reinforcement Learning via Sequence Modelingcited by 1,528
  7. 2018Hypergraph Neural Networkscited by 482
  8. 2018MolGAN: An implicit generative model for small molecular graphscited by 392
  9. 2018Molecular Transformer - A Model for Uncertainty-Calibrated Chemical Reaction Predictioncited by 225
  10. 2020Retrosynthesis Prediction with Conditional Graph Logic Networkcited by 103
  11. 2018Multi-Objective De Novo Drug Design with Conditional Graph Generative Modelcited by 101
  12. 2019Molecular geometry prediction using a deep generative graph neural networkcited by 91
12 more
  1. 2020Molecule Edit Graph Attention Network: Modeling Chemical Reactions as Sequences of Graph Editscited by 87
  2. 2020A Graph to Graphs Framework for Retrosynthesis Predictioncited by 85
  3. 2020Molecular graph generation with Graph Neural Networkscited by 79
  4. 2020RetroXpert: Decompose Retrosynthesis Prediction like a Chemistcited by 66
  5. 2021Permutation invariant graph-to-sequence model for template-free retrosynthesis and reaction predictioncited by 66
  6. 2020Learning Graph Models for Retrosynthesis Predictioncited by 64
  7. 2020Energy-based View of Retrosynthesiscited by 24
  8. 2021RetroComposer: Composing Templates for Template-Based Retrosynthesis Predictioncited by 13
  9. 2020Global-aware Beam Search for Neural Abstractive Summarizationcited by 8
  10. 2022More Interpretable Graph Similarity Computation via Maximum Common Subgraph Inferencecited by 8
  11. 2021Sub-GMN: The Neural Subgraph Matching Network Modelcited by 5
  12. 2023RCsearcher: Reaction Center Identification in Retrosynthesis via Deep Q-Learningcited by 5

Built on by

Cited by year

Citing papers per year: 2024: 1.

1 paper.