Efficient retrosynthetic planning with MCTS exploration enhanced A* search

被引:1
|
作者
Zhao, Dengwei [1 ]
Tu, Shikui [1 ]
Xu, Lei [1 ,2 ]
机构
[1] Shanghai Jiao Tong Univ, Dept Comp Sci & Engn, Shanghai, Peoples R China
[2] Guangdong Inst Intelligence Sci & Technol, Zhuhai, Peoples R China
基金
中国国家自然科学基金;
关键词
DEEP NEURAL-NETWORKS; TRANSFORMER; PREDICTION; MODEL; GAME; GO;
D O I
10.1038/s42004-024-01133-2
中图分类号
O6 [化学];
学科分类号
0703 ;
摘要
Retrosynthetic planning, which aims to identify synthetic pathways for target molecules from starting materials, is a fundamental problem in synthetic chemistry. Computer-aided retrosynthesis has made significant progress, in which heuristic search algorithms, including Monte Carlo Tree Search (MCTS) and A* search, have played a crucial role. However, unreliable guiding heuristics often cause search failure due to insufficient exploration. Conversely, excessive exploration also prevents the search from reaching the optimal solution. In this paper, MCTS exploration enhanced A* (MEEA*) search is proposed to incorporate the exploratory behavior of MCTS into A* by providing a look-ahead search. Path consistency is adopted as a regularization to improve the generalization performance of heuristics. Extensive experimental results on 10 molecule datasets demonstrate the effectiveness of MEEA*. Especially, on the widely used United States Patent and Trademark Office (USPTO) benchmark, MEEA* achieves a 100.0% success rate. Moreover, for natural products, MEEA* successfully identifies bio-retrosynthetic pathways for 97.68% test compounds.
引用
收藏
页数:12
相关论文
共 50 条
  • [1] Efficient retrosynthetic planning with MCTS exploration enhanced A* search
    Dengwei Zhao
    Shikui Tu
    Lei Xu
    Communications Chemistry, 7
  • [2] RetroGraph: Retrosynthetic Planning with Graph Search
    Xie, Shufang
    Yan, Rui
    Han, Peng
    Xia, Yingce
    Wu, Lijun
    Guo, Chenjuan
    Yang, Bin
    Qin, Tao
    PROCEEDINGS OF THE 28TH ACM SIGKDD CONFERENCE ON KNOWLEDGE DISCOVERY AND DATA MINING, KDD 2022, 2022, : 2120 - 2129
  • [3] Retro*: Learning Retrosynthetic Planning with Neural Guided A* Search
    Chen, Binghong
    Li, Chengtao
    Dai, Hanjun
    Song, Le
    25TH AMERICAS CONFERENCE ON INFORMATION SYSTEMS (AMCIS 2019), 2019,
  • [4] Retro*: Learning Retrosynthetic Planning with Neural Guided A* Search
    Chen, Binghong
    Li, Chengtao
    Dai, Hanjun
    Song, Le
    INTERNATIONAL CONFERENCE ON MACHINE LEARNING, VOL 119, 2020, 119
  • [5] Retrosynthetic planning with experience-guided Monte Carlo tree search
    Siqi Hong
    Hankz Hankui Zhuo
    Kebing Jin
    Guang Shao
    Zhanwen Zhou
    Communications Chemistry, 6
  • [6] Retrosynthetic planning with experience-guided Monte Carlo tree search
    Hong, Siqi
    Zhuo, Hankz Hankui
    Jin, Kebing
    Shao, Guang
    Zhou, Zhanwen
    COMMUNICATIONS CHEMISTRY, 2023, 6 (01)
  • [7] Data undersampling models for the efficient rule-based retrosynthetic planning
    Park, Min Sik
    Lee, Dongseon
    Kwon, Youngchun
    Kim, Eunji
    Choi, Youn-Suk
    PHYSICAL CHEMISTRY CHEMICAL PHYSICS, 2021, 23 (46) : 26510 - 26518
  • [8] SynRoute: A Retrosynthetic Planning Software
    Latendresse, Mario
    Malerich, Jeremiah P.
    Herson, James
    Krummenacker, Markus
    Szeto, Judy
    Vu, Vi-Anh
    Collins, Nathan
    Madrid, Peter B.
    JOURNAL OF CHEMICAL INFORMATION AND MODELING, 2023, 63 (17) : 5484 - 5495
  • [9] RADICAL REACTIONS AND RETROSYNTHETIC PLANNING
    CURRAN, DP
    SYNLETT, 1991, (02) : 63 - 72
  • [10] Self-Improved Retrosynthetic Planning
    Kim, Junsu
    Ahn, Sungsoo
    Lee, Hankook
    Shin, Jinwoo
    INTERNATIONAL CONFERENCE ON MACHINE LEARNING, VOL 139, 2021, 139