Improving route development using convergent retrosynthesis planning
Retrosynthesis consists of recursively breaking down a target molecule to produce a synthesis route composed of readily accessible building blocks. In recent years, computer-aided synthesis planning methods have allowed a greater exploration of potential synthesis routes, combining state-of-the-art machine-learning methods with chemical knowledge. However, these methods are generally developed to produce individual routes from a singular product to a set of proposed building blocks and are not designed to leverage potential shared paths between targets. These methods do not necessarily encompass real-world use cases in medicinal chemistry, where one seeks to synthesize sets of target compounds in a library mode, looking for maximal convergence into a shared retrosynthetic path going via advanced key intermediate compounds. Using a graph-based processing pipeline, we explore Johnson & Johnson Electronic Laboratory Notebooks (J&J ELN) and publicly available datasets to identify complex routes with multiple target molecules sharing common intermediates, producing convergent synthesis routes. We find that over 70% of all reactions are involved in convergent synthesis, covering over 80% of all projects in the case of J&J ELN data. Scientific contributionWe introduce a novel planning approach to develop convergent synthesis routes, which can search multiple products and intermediates simultaneously guided by state-of-the-art machine learning single-step retrosynthesis models, enhancing the overall efficiency and practical applicability of retrosynthetic planning. We evaluate the multi-step synthesis planning approach using the extracted convergent routes and observe that solvability is generally high across those routes, being able to identify a convergent route for over 80% of the test routes and showing an individual compound solvability of over 90%. We find that by using a convergent search approach, we can synthesize almost 30% more compounds simultaneously for J&J ELN as compared to using an individual search, while providing an increased use of common intermediates.
Authors
- Dorota Herman (ORCID: https://orcid.org/0000-0001-7836-8989)
- Hugo Ceulemans (ORCID: https://orcid.org/0000-0002-7059-4399)
- Jonas Verhoeven (ORCID: https://orcid.org/0000-0002-4125-8759)
- Igor V. Tetko (ORCID: https://orcid.org/0000-0002-6855-0012)
- Jörg K. Wegner (ORCID: https://orcid.org/0000-0002-1852-9434)
- Paula Torren-Peraire (ORCID: https://orcid.org/0000-0003-4390-4598)
Institutions
- Johnson & Johnson (United States) (US)
- Helmholtz Zentrum München (DE)
- Target (Germany) (DE)
Publication Details
- Journal
- Journal of Cheminformatics
- Published
- 2025-02-27
- DOI
- https://doi.org/10.1186/s13321-025-00953-1
- Citations
- 5
- Primary Topic
- Computational Drug Discovery Methods
- Type
- article
- Field-Weighted Citation Impact
- 7.52
Funders
- Horizon 2020 Framework Programme