Daniel Armstrong, Zlatko Jončev, Jeff Guo
‡
and Philippe Schwaller
{"title":"Tango*: constrained synthesis planning using chemically informed value functions","authors":"Daniel Armstrong, Zlatko Jončev, Jeff Guo\r\n ‡\r\n and Philippe Schwaller","doi":"10.1039/D5DD00130G","DOIUrl":null,"url":null,"abstract":"<p >Computer-aided synthesis planning (CASP) has made significant strides in generating retrosynthetic pathways for simple molecules in a non-constrained fashion. Recent work has introduced specialized bidirectional search algorithms to find synthesis pathways that incorporate pre-selected starting materials, tackling a specific formulation of the starting material-constrained problem. In this work, we introduce a simple guided search—Tango*-which allows solving the starting material-constrained synthesis planning problem using an existing unidirectional search algorithm, Retro*. We show that by optimising a single hyperparameter, Tango* outperforms existing methods in terms of efficiency and solve rate. We also highlight the effectiveness of our computed node cost function in steering synthesis pathways.</p>","PeriodicalId":72816,"journal":{"name":"Digital discovery","volume":" 9","pages":" 2570-2578"},"PeriodicalIF":6.2000,"publicationDate":"2025-08-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC12355204/pdf/","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Digital discovery","FirstCategoryId":"1085","ListUrlMain":"https://pubs.rsc.org/en/content/articlelanding/2025/dd/d5dd00130g","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"CHEMISTRY, MULTIDISCIPLINARY","Score":null,"Total":0}
引用次数: 0
Abstract
Computer-aided synthesis planning (CASP) has made significant strides in generating retrosynthetic pathways for simple molecules in a non-constrained fashion. Recent work has introduced specialized bidirectional search algorithms to find synthesis pathways that incorporate pre-selected starting materials, tackling a specific formulation of the starting material-constrained problem. In this work, we introduce a simple guided search—Tango*-which allows solving the starting material-constrained synthesis planning problem using an existing unidirectional search algorithm, Retro*. We show that by optimising a single hyperparameter, Tango* outperforms existing methods in terms of efficiency and solve rate. We also highlight the effectiveness of our computed node cost function in steering synthesis pathways.