PGCLODA: Prompt-Guided Graph Contrastive Learning for Oligopeptide-Infectious Disease Association Prediction

• URL: http://arxiv.org/abs/2509.20290v1
• Date: Wed, 24 Sep 2025 16:25:13 GMT
• Title: PGCLODA: Prompt-Guided Graph Contrastive Learning for Oligopeptide-Infectious Disease Association Prediction
• Authors: Dayu Tan, Jing Chen, Xiaoping Zhou, Yansen Su, Chunhou Zheng,
• Abstract summary: Infectious diseases continue to pose a serious threat to public health, underscoring the urgent need for effective computational approaches.<n>This study introduces a prompt-guided graph-based contrast learning framework (PGODA) to uncover potential associations.<n>Case studies further validate the ability of PGODA and its potential to uncover novel, biologically relevant associations.
• Score: 11.867921399312701
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Infectious diseases continue to pose a serious threat to public health, underscoring the urgent need for effective computational approaches to screen novel anti-infective agents. Oligopeptides have emerged as promising candidates in antimicrobial research due to their structural simplicity, high bioavailability, and low susceptibility to resistance. Despite their potential, computational models specifically designed to predict associations between oligopeptides and infectious diseases remain scarce. This study introduces a prompt-guided graph-based contrastive learning framework (PGCLODA) to uncover potential associations. A tripartite graph is constructed with oligopeptides, microbes, and diseases as nodes, incorporating both structural and semantic information. To preserve critical regions during contrastive learning, a prompt-guided graph augmentation strategy is employed to generate meaningful paired views. A dual encoder architecture, integrating Graph Convolutional Network (GCN) and Transformer, is used to jointly capture local and global features. The fused embeddings are subsequently input into a multilayer perceptron (MLP) classifier for final prediction. Experimental results on a benchmark dataset indicate that PGCLODA consistently outperforms state-of-the-art models in AUROC, AUPRC, and accuracy. Ablation and hyperparameter studies confirm the contribution of each module. Case studies further validate the generalization ability of PGCLODA and its potential to uncover novel, biologically relevant associations. These findings offer valuable insights for mechanism-driven discovery and oligopeptide-based drug development. The source code of PGCLODA is available online at https://github.com/jjnlcode/PGCLODA.

Related papers

• GLaDiGAtor: Language-Model-Augmented Multi-Relation Graph Learning for Predicting Disease-Gene Associations [0.0]
  Understanding disease-gene associations is essential to unravelling disease mechanisms and advancing diagnostics and therapeutics.<n>To address limitations in existing models, we propose GLaDiGAtor, a novel GNN framework with an encoder-decoder architecture for disease-gene association prediction.<n>GLaDiGAtor constructs a heterogeneous biological graph integrating gene-gene, disease-disease, and gene-disease interactions from curated databases.
  arXiv  Detail & Related papers  (2026-02-21T09:26:44Z)
• PRING: Rethinking Protein-Protein Interaction Prediction from Pairs to Graphs [88.98041407783502]
  PRING is the first benchmark that evaluates protein-protein interaction prediction from a graph-level perspective.<n> PRING curates a high-quality, multi-species PPI network dataset comprising 21,484 proteins and 186,818 interactions.
  arXiv  Detail & Related papers  (2025-07-07T15:21:05Z)
• KEPLA: A Knowledge-Enhanced Deep Learning Framework for Accurate Protein-Ligand Binding Affinity Prediction [60.23701115249195]
  KEPLA is a novel deep learning framework that integrates prior knowledge from Gene Ontology and ligand properties to enhance prediction performance.<n> Experiments on two benchmark datasets demonstrate that KEPLA consistently outperforms state-of-the-art baselines.
  arXiv  Detail & Related papers  (2025-06-16T08:02:42Z)
• Node2Vec-DGI-EL: A Hierarchical Graph Representation Learning Model for Ingredient-Disease Association Prediction [8.749982610059874]
  This study proposes an ingredient-disease association prediction model (Node2Vec-DGI-EL) based on hierarchical graph representation learning.<n>To improve prediction accuracy and robustness, an ensemble learning method is incorporated to achieve more accurate ingredient-disease association predictions.
  arXiv  Detail & Related papers  (2025-05-01T01:06:05Z)
• A deep graph model for the signed interaction prediction in biological network [1.03121181235382]
  Predicting signed interactions in biological networks is crucial for understanding drug mechanisms and facilitating drug repurposing.<n>textbfRGCNTD is designed to predict both polar (e.g. activation, inhibition) and non-polar (e.g. binding, affect) chemical-gene interactions.<n>We introduce new evaluation metrics, textitAUCtextsubscriptpolarity and textitCP@500, to assess the model's ability to differentiate interaction types.
  arXiv  Detail & Related papers  (2024-07-10T04:28:21Z)
• Learning to Denoise Biomedical Knowledge Graph for Robust Molecular Interaction Prediction [50.7901190642594]
  We propose BioKDN (Biomedical Knowledge Graph Denoising Network) for robust molecular interaction prediction. BioKDN refines the reliable structure of local subgraphs by denoising noisy links in a learnable manner. It maintains consistent and robust semantics by smoothing relations around the target interaction.
  arXiv  Detail & Related papers  (2023-12-09T07:08:00Z)
• Energy-based Out-of-Distribution Detection for Graph Neural Networks [76.0242218180483]
  We propose a simple, powerful and efficient OOD detection model for GNN-based learning on graphs, which we call GNNSafe. GNNSafe achieves up to $17.0%$ AUROC improvement over state-of-the-arts and it could serve as simple yet strong baselines in such an under-developed area.
  arXiv  Detail & Related papers  (2023-02-06T16:38:43Z)
• Drug Synergistic Combinations Predictions via Large-Scale Pre-Training and Graph Structure Learning [82.93806087715507]
  Drug combination therapy is a well-established strategy for disease treatment with better effectiveness and less safety degradation. Deep learning models have emerged as an efficient way to discover synergistic combinations. Our framework achieves state-of-the-art results in comparison with other deep learning-based methods.
  arXiv  Detail & Related papers  (2023-01-14T15:07:43Z)
• Interpreting the Mechanism of Synergism for Drug Combinations Using Attention-Based Hierarchical Graph Pooling [10.898133007285638]
  We develop an interpretable graph neural network (GNN) that reveals the underlying essential therapeutic targets and the mechanism of the synergy (MoS) The proposed GNN model provides a systematic way to predict and interpret the drug combination synergism based on the detected crucial sub-molecular network.
  arXiv  Detail & Related papers  (2022-09-19T11:18:45Z)
• AI-Bind: Improving Binding Predictions for Novel Protein Targets and Ligands [9.135203550164833]
  We show that state-of-the-art models fail to generalize to novel structures. We introduce AI-Bind, a pipeline that combines network-based sampling strategies with unsupervised pre-training. We illustrate the value of AI-Bind by predicting drugs and natural compounds with binding affinity to SARS-CoV-2 viral proteins.
  arXiv  Detail & Related papers  (2021-12-25T01:52:58Z)
• Explainable Deep Relational Networks for Predicting Compound-Protein Affinities and Contacts [80.69440684790925]
  DeepRelations is a physics-inspired deep relational network with intrinsically explainable architecture. It shows superior interpretability to the state-of-the-art. It boosts the AUPRC of contact prediction 9.5, 16.9, 19.3 and 5.7-fold for the test, compound-unique, protein-unique, and both-unique sets.
  arXiv  Detail & Related papers  (2019-12-29T00:14:07Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.