Papers › Permutation invariant graph-to-sequence model for template-free retrosynthesis and...

Permutation invariant graph-to-sequence model for template-free retrosynthesis and reaction prediction

19 Oct 2021arXiv:2110.09681archive 2025-07-28

Zhengkai Tu, Connor W. Coley

Synthesis planning and reaction outcome prediction are two fundamental problems in computer-aided organic chemistry for which a variety of data-driven approaches have emerged. Natural language approaches that model each problem as a SMILES-to-SMILES translation lead to a simple end-to-end formulation, reduce the need for data preprocessing, and enable the use of well-optimized machine translation model architectures. However, SMILES representations are not an efficient representation for capturing information about molecular structures, as evidenced by the success of SMILES augmentation to boost empirical performance. Here, we describe a novel Graph2SMILES model that combines the power of Transformer models for text generation with the permutation invariance of molecular graph encoders that mitigates the need for input data augmentation. As an end-to-end architecture, Graph2SMILES can be used as a drop-in replacement for the Transformer in any task involving molecule(s)-to-molecule(s) transformations. In our encoder, an attention-augmented directed message passing neural network (D-MPNN) captures local chemical environments, and the global attention encoder allows for long-range and intermolecular interactions, enhanced by graph-aware positional embedding. Graph2SMILES improves the top-1 accuracy of the Transformer baselines by 1.7% and 1.9% for reaction outcome prediction on USPTO_480k and USPTO_STEREO datasets respectively, and by 9.8% for one-step retrosynthesis on the USPTO_50k dataset.

PaperPDFConference PDFCodeCode Syntology ran

In Syntology Open this paper in Syntology's Atlas, the map of the papers in Syntology's graph and their citations.

For agents, Syntology's MCP tool lists every function and class Syntology harvested from this paper and whether it ran (how to connect): get_harvested_code_for_paper(arxiv_id="2110.09681")

Code

Syntology Ran 0 of 6 code samples harvested from 1 repository linked to this paper; 6 have no recorded run.

By repository: official repository: 6 samples from 1 repository, 0 ran. The run record, sample by sample. “Ran” means executed on a synthesized input, not that the code is correct or reproduces the paper.

coleygroup/graph2smiles officialmentioned in paperpytorchMIT report

Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.

Code Syntology ran Syntology

6 samples harvested; 0 ran; 0 honoured the contract we drafted; 6 have no recorded run. Read from Syntology's graph 2026-09-24; that is when this build read the record, not when the samples ran.

6unverified

Licence: 0 of the 6 samples are pointer only, meaning Syntology does not serve that copy's text. This page shows no code text for any sample; each one links to its file in the repository.

Harvested from coleygroup/graph2smiles. “Ran” means the sample executed on a synthesized input. It does not mean the output is correct, and nothing here reproduces the paper's results. “Honoured” and “violated” refer to a contract Syntology drafted from the code itself; “our draft was wrong” and “fixture could not drive it” are failures of Syntology's instrument, not of the code.

Each sample ends with its code_sha256, Syntology's identity for that exact code. An agent fetches the stored sample with Syntology's MCP tool get_code(code_sha256="…") (how to connect); click an identity to copy that call.

Repository labels, per sample. official repository: The archive marks this repository official for the paper. named in the paper: The archive records that the paper mentions this repository; it is not marked official. community (archive-listed): In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper. found in paper text by Syntology: Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted. community: Not in the archive's code links for this paper; a community repository Syntology harvested. Samples from a repository marked official are listed first. Licence labels name the repository's licence as recorded at harvest. “Pointer only” means Syntology does not serve that copy's text, for one of four reasons: no licence file was found; the licence was not identified; the licence is recorded as permissive but that copy's record is not marked cleared; or the licence is outside the permissive list Syntology serves text under (MIT, Apache-2.0, BSD and similar). Some licences outside that list permit redistribution, such as WTFPL, and GPL-3.0 under its conditions; they are simply not on the list. Hover a licence label for the reason. File links open the file on GitHub at the default branch, which may have changed since the harvest.

get_seq_features_from_line coleygroup/graph2smiles/preprocess.py official repository unverified MIT (permissive) · 83a7b894e024a84e · report
get_sin_encodings coleygroup/graph2smiles/models/attention_xl.py official repository unverified MIT (permissive) · 90a6779b5bfe7978 · report
get_token_ids coleygroup/graph2smiles/preprocess.py official repository unverified MIT (permissive) · 0087614c4f578615 · report
index_scatter coleygroup/graph2smiles/models/model_utils.py official repository unverified MIT (permissive) · 0971a9bc73485df2 · report
index_select_ND coleygroup/graph2smiles/models/model_utils.py official repository unverified MIT (permissive) · 6cfa3e07a37cd10c · report
tokenize_smiles coleygroup/graph2smiles/utils/data_utils.py official repository unverified MIT (permissive) · 0cbe25907544a30e · report

Tasks

Data AugmentationGraph-to-SequenceMachine TranslationRetrosynthesisSingle-step retrosynthesisText GenerationTranslation

Results from the paper archive 2025-07-28

TaskDatasetModelMetricValueRank at snapshotLeaderboardReport
Single-step retrosynthesis USPTO-50k Graph2SMILES-D-GCN (reaction class unknown) Top-1 accuracy 52.9 #26 of 35 Archive leaderboard report
Single-step retrosynthesis USPTO-50k Graph2SMILES-D-GCN (reaction class unknown) Top-10 accuracy 72.9 #26 of 35 Archive leaderboard report
Single-step retrosynthesis USPTO-50k Graph2SMILES-D-GCN (reaction class unknown) Top-3 accuracy 66.5 #26 of 35 Archive leaderboard report
Single-step retrosynthesis USPTO-50k Graph2SMILES-D-GCN (reaction class unknown) Top-5 accuracy 70.0 #26 of 35 Archive leaderboard report
Single-step retrosynthesis USPTO-50k Graph2SMILES-D-GAT (reaction class unknown) Top-1 accuracy 51.2 #30 of 35 Archive leaderboard report
Single-step retrosynthesis USPTO-50k Graph2SMILES-D-GAT (reaction class unknown) Top-10 accuracy 73.9 #30 of 35 Archive leaderboard report
Single-step retrosynthesis USPTO-50k Graph2SMILES-D-GAT (reaction class unknown) Top-3 accuracy 66.3 #30 of 35 Archive leaderboard report
Single-step retrosynthesis USPTO-50k Graph2SMILES-D-GAT (reaction class unknown) Top-5 accuracy 70.4 #30 of 35 Archive leaderboard report

Ranks are positions in the archive's leaderboards as they stood at the 2025-07-28 snapshot. Results published since then are not among these rows, so a rank here is not a current standing.

Methods

Absolute Position EncodingsAdamAttentionBPEDense ConnectionsDropoutLabel SmoothingLayer NormalizationLinear LayerMulti-Head AttentionPosition-Wise Feed-Forward LayerResidual ConnectionSoftmaxTransformer

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections