• Login
    View Item 
    •   Home
    • Research
    • Conference Papers
    • View Item
    •   Home
    • Research
    • Conference Papers
    • View Item
    JavaScript is disabled for your browser. Some features of this site may not work without it.

    Browse

    All of KAUSTCommunitiesIssue DateSubmit DateThis CollectionIssue DateSubmit Date

    My Account

    Login

    Quick Links

    Open Access PolicyORCID LibguideTheses and Dissertations LibguideSubmit an Item

    Statistics

    Display statistics

    GNN-Retro: Retrosynthetic Planning with Graph Neural Networks

    • CSV
    • RefMan
    • EndNote
    • BibTex
    • RefWorks
    Type
    Conference Paper
    Authors
    Han, Peng
    Zhao, Peilin
    Lu, Chan
    Huang, Junzhou
    Wu, Jiaxiang
    Shang, Shuo
    Yao, Bin
    Zhang, Xiangliang cc
    KAUST Department
    Computational Bioscience Research Center (CBRC)
    Computer Science Program
    Computer, Electrical and Mathematical Science and Engineering (CEMSE) Division
    King Abdullah University of Science and Technology
    Machine Intelligence & kNowledge Engineering Lab
    KAUST Grant Number
    BAS/1/1635-01-01
    Date
    2022-06-28
    Permanent link to this record
    http://hdl.handle.net/10754/681597
    
    Metadata
    Show full item record
    Abstract
    Retrosynthetic planning plays an important role in the field of organic chemistry, which could generate a synthetic route for the target product. The synthetic route is a series of reactions which are started from the available molecules. The most challenging problem in the generation of the synthetic route is the large search space of the candidate reactions. Estimating the cost of candidate reactions has been proved effectively to prune the search space, which could achieve a higher accuracy with the same search iteration. And the estimation of one reaction is comprised of the estimations of all its reactants. So, how to estimate the cost of these reactants will directly influence the quality of results. To get a better performance, we propose a new framework, named GNN-Retro, for retrosynthetic planning problem by combining graph neural networks(GNN) and the latest search algorithm. The structure of GNN in our framework could incorporate the information of neighboring molecules, which will improve the estimation accuracy of our framework. The experiments on the USPTO dataset show that our framework could outperform the state-of-the-art methods with a large margin under the same settings.
    Citation
    Han, P., Zhao, P., Lu, C., Huang, J., Wu, J., Shang, S., Yao, B., & Zhang, X. (2022). GNN-Retro: Retrosynthetic Planning with Graph Neural Networks. Proceedings of the AAAI Conference on Artificial Intelligence, 36(4), 4014–4021. https://doi.org/10.1609/aaai.v36i4.20318
    Sponsors
    The research reported in this publication was supported by funding from King Abdullah University of Science and Technology (KAUST) under award number BAS/1/1635-01-01, and the NSFC (U2001212, 62032001, and 61932004). Bin Yao was supported by the NSFC (61922054, 61872235, 61832017, and 61729202), and the National Key Research and Development Program of China (2020YFB1710202, and 2018YFC1504504).
    Publisher
    Association for the Advancement of Artificial Intelligence (AAAI)
    Conference/Event name
    The Thirty-Sixth AAAI Conference on Artificial Intelligence (AAAI-22)
    DOI
    10.1609/aaai.v36i4.20318
    Additional Links
    https://ojs.aaai.org/index.php/AAAI/article/view/20318
    ae974a485f413a2113503eed53cd6c53
    10.1609/aaai.v36i4.20318
    Scopus Count
    Collections
    Conference Papers; Computer Science Program; Computational Bioscience Research Center (CBRC); Computer, Electrical and Mathematical Science and Engineering (CEMSE) Division

    entitlement

     
    DSpace software copyright © 2002-2023  DuraSpace
    Quick Guide | Contact Us | KAUST University Library
    Open Repository is a service hosted by 
    Atmire NV
     

    Export search results

    The export option will allow you to export the current search results of the entered query to a file. Different formats are available for download. To export the items, click on the button corresponding with the preferred download format.

    By default, clicking on the export buttons will result in a download of the allowed maximum amount of items. For anonymous users the allowed maximum amount is 50 search results.

    To select a subset of the search results, click "Selective Export" button and make a selection of the items you want to export. The amount of items that can be exported at once is similarly restricted as the full export.

    After making a selection, click one of the export format buttons. The amount of items that will be exported is indicated in the bubble next to export format.