paper-with-me

홈 › Papers

Node-Aligned Graph-to-Graph (NAG2G): Elevating Template-Free Deep Learning Approaches in Single-Step Retrosynthesis

2023-09-27 · Lin Yao, Wentao Guo, Zhen Wang, Shang Xiang, Wentan Liu, Guolin Ke

Single-step retrosynthesis (SSR) in organic chemistry is increasingly benefiting from deep learning (DL) techniques in computer-aided synthesis design. While template-free DL models are flexible and promising for retrosynthesis prediction, they often ignore vital 2D molecular information and struggle with atom alignment for node generation, resulting in lower performance compared to the template-based and semi-template-based methods. To address these issues, we introduce Node-Aligned Graph-to-Graph (NAG2G), a transformer-based template-free DL model. NAG2G combines 2D molecular graphs and 3D conformations to retain comprehensive molecular details and incorporates product-reactant atom mapping through node alignment which determines the order of the node-by-node graph outputs process in an auto-regressive manner. Through rigorous benchmarking and detailed case studies, we have demonstrated that NAG2G stands out with its remarkable predictive accuracy on the expansive datasets of USPTO-50k and USPTO-FULL. Moreover, the model's practical utility is underscored by its successful prediction of synthesis pathways for multiple drug candidate molecules. This not only proves NAG2G's robustness but also its potential to revolutionize the prediction of complex chemical synthesis processes for future synthetic route design tasks.

📄 PDF Abstract BibTeX arXiv:2309.15798

Code (1)

dptech-corp/nag2g 공식 구현 pytorch

Tasks

BenchmarkingGraph GenerationPredictionRetrosynthesisSingle-step retrosynthesis

Similar Papers 제목 키워드 기반

TGHE: Template-based Graph Homomorphic Encryption for Privacy-Preserving GNN Inference in Edge-Cloud Systems

2026-06-25 · Ngoc Bao Anh Le, Thai T. Vu, John Le, Heath Cooper 외 arxiv

Existing homomorphic encryption (HE)-based GNN systems adopt a graph-centric paradigm that couples per-query cost to global graph size, limiting evaluations to at most ~20k nodes and making them incompatible with dynamic…

ALINC: Active Learning for Inductive Node Classification via Graph Sampling

2026-06-03 · Pascal Plettenberg, Denis Huseljic, André Alcalde, Bernhard Sick 외 arxiv

Active learning (AL) for node classification typically focuses on selecting the most informative nodes for annotation within one or a few large graphs (e.g., in social network analysis). However, in other domains, such a…

Node ClassificationActive Learning

Probabilistically Aligned View-unaligned Clustering with Adaptive Template Selection

2024-09-23 · Wenhua Dong, Xiao-Jun Wu, ZhenHua Feng, Sara Atito 외

In most existing multi-view modeling scenarios, cross-view correspondence (CVC) between instances of the same target from different views, like paired image-text data, is a crucial prerequisite for effortlessly deriving …

Clustering

Enhance Graph Alignment for Large Language Models

2024-10-15 · Haitong Luo, Xuying Meng, Suhang Wang, Tianxiang Zhao 외

Graph-structured data is prevalent in the real world. Recently, due to the powerful emergent capabilities, Large Language Models (LLMs) have shown promising performance in modeling graphs. The key to effectively applying…

General KnowledgeText Matching

RoSA: A Robust Self-Aligned Framework for Node-Node Graph Contrastive Learning

2022-04-29 · Yun Zhu, Jianhao Guo, Fei Wu, Siliang Tang

Graph contrastive learning has gained significant progress recently. However, existing works have rarely explored non-aligned node-node contrasting. In this paper, we propose a novel graph contrastive learning method nam…

Contrastive LearningDiversityNode ClassificationRepresentation Learning