Tango*: Constrained synthesis planning using chemically informed value functions

Daniel Armstrong, Zlatko Joncev, Jeff Guo, Philippe Schwaller
12/4/2024
cs.CEcs.AI

No official code found. Best implementation: schwallergroup/TangoStar (6 stars, MIT, last commit 2025-07-25).

Abstract

Computer-aided synthesis planning (CASP) has made significant strides in generating retrosynthetic pathways for simple molecules in a non-constrained fashion. Recent work introduces a specialised bidirectional search algorithm with forward and retro expansion to address the starting material-constrained synthesis problem, allowing CASP systems to provide synthesis pathways from specified starting materials, such as waste products or renewable feed-stocks. In this work, we introduce a simple guided search which allows solving the starting material-constrained synthesis planning problem using an existing, uni-directional search algorithm, Retro*. We show that by optimising a single hyperparameter, Tango* outperforms existing methods in terms of efficiency and solve rate. We find the Tango* cost function catalyses strong improvements for the bidirectional DESP methods. Our method also achieves lower wall clock times while proposing synthetic routes of similar length, a common metric for route quality. Finally, we highlight potential reasons for the strong performance of Tango over neural guided search methods

View on arXivView PDF

Code Implementations(1)

MIT
60Shell, PythonDec 4, 20241 years agoMIT

Similar Papers

Cite this paper

@article{armstrong2024tango,
  title  = {Tango*: Constrained synthesis planning using chemically informed value functions},
  author = {Daniel Armstrong and Zlatko Joncev and Jeff Guo and Philippe Schwaller},
  year   = {2024},
  eprint = {2412.03424},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2412.03424v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2412.03424.svg)](https://codeofpaper.com/paper/2412.03424)

Discussion