Search engine for discovering works of Art, research articles, and books related to Art and Culture
ShareThis
Javascript must be enabled to continue!

AEPMA: peptide–microbe association prediction based on autoevolutionary heterogeneous graph learning

View through CrossRef
Abstract The inappropriate use of antibiotics has precipitated the emergence of multidrug-resistant bacteria, prompting significant interest in antimicrobial peptides (AMPs) as potential alternatives to traditional antibiotics. Given the prohibitive costs and time-consuming nature of biological experiments, computational methods provide an efficient alternative for the development of AMP-based drugs. However, existing computational studies primarily focus on identifying AMPs with antimicrobial activity, lacking a targeted identification of AMPs against specific microbial species. To address this gap, we propose a peptide–microbe association (PMA) prediction framework, termed AEPMA, which is constructed based on an autoevolutionary heterogeneous graph. Within AEPMA, we construct an innovative peptide-microbe-disease network (PMDHAN). Furthermore, we design an autoevolutionary information aggregation mechanism that facilitates the representation learning of the heterogeneous graph. This model automatically aggregates semantic information within the heterogeneous network while thoroughly accounting for the spatiotemporal dependencies and heterogeneous interactions in the PMDHAN. Experiments conducted on one peptide-microbe and three drug–microbe association datasets demonstrate that the performance of AEPMA outperforms five state-of-the-art methods, demonstrating its robust modeling capability and exceptional generalization ability. In addition, this study identifies a novel anti-Staphylococcus aureus peptide and an anti-Escherichia coli peptide, thereby contributing valuable information for the development of antimicrobial drugs and strategies for mitigating antibiotic resistance.
Title: AEPMA: peptide–microbe association prediction based on autoevolutionary heterogeneous graph learning
Description:
Abstract The inappropriate use of antibiotics has precipitated the emergence of multidrug-resistant bacteria, prompting significant interest in antimicrobial peptides (AMPs) as potential alternatives to traditional antibiotics.
Given the prohibitive costs and time-consuming nature of biological experiments, computational methods provide an efficient alternative for the development of AMP-based drugs.
However, existing computational studies primarily focus on identifying AMPs with antimicrobial activity, lacking a targeted identification of AMPs against specific microbial species.
To address this gap, we propose a peptide–microbe association (PMA) prediction framework, termed AEPMA, which is constructed based on an autoevolutionary heterogeneous graph.
Within AEPMA, we construct an innovative peptide-microbe-disease network (PMDHAN).
Furthermore, we design an autoevolutionary information aggregation mechanism that facilitates the representation learning of the heterogeneous graph.
This model automatically aggregates semantic information within the heterogeneous network while thoroughly accounting for the spatiotemporal dependencies and heterogeneous interactions in the PMDHAN.
Experiments conducted on one peptide-microbe and three drug–microbe association datasets demonstrate that the performance of AEPMA outperforms five state-of-the-art methods, demonstrating its robust modeling capability and exceptional generalization ability.
In addition, this study identifies a novel anti-Staphylococcus aureus peptide and an anti-Escherichia coli peptide, thereby contributing valuable information for the development of antimicrobial drugs and strategies for mitigating antibiotic resistance.

Related Results

Abstract 902: Explainable AI: Graph machine learning for response prediction and biomarker discovery
Abstract 902: Explainable AI: Graph machine learning for response prediction and biomarker discovery
Abstract Accurately predicting drug sensitivity and understanding what is driving it are major challenges in drug discovery. Graphs are a natural framework for captu...
Anemia Is Inversely Associated with Serum C-Peptide Concentrations in Patients with Type 2 Diabetes
Anemia Is Inversely Associated with Serum C-Peptide Concentrations in Patients with Type 2 Diabetes
Results: The aim of the study was to investigate the relationship between anemia and serum C-peptide concentrations in Korean patients with type 2 diabetes. A total of 1,300 subjec...
Selection of Injectable Drug Product Composition using Machine Learning Models (Preprint)
Selection of Injectable Drug Product Composition using Machine Learning Models (Preprint)
BACKGROUND As of July 2020, a Web of Science search of “machine learning (ML)” nested within the search of “pharmacokinetics or pharmacodynamics” yielded over 100...
Drug–target affinity prediction with extended graph learning-convolutional networks
Drug–target affinity prediction with extended graph learning-convolutional networks
Abstract Background High-performance computing plays a pivotal role in computer-aided drug design, a field that holds significant promise in pharmac...
EHAI: Enhanced Human Microbe-Disease Association Identification
EHAI: Enhanced Human Microbe-Disease Association Identification
: Recently, an increasing number of biological and clinical reports have demonstrated that imbalance of microbial community has the ability to play important roles among several co...
Data Analytics on Graphs Part I: Graphs and Spectra on Graphs
Data Analytics on Graphs Part I: Graphs and Spectra on Graphs
The area of Data Analytics on graphs promises a paradigm shift, as we approach information processing of new classes of data which are typically acquired on irregular but structure...
E-Cordial Labeling of Some Families of Graphs
E-Cordial Labeling of Some Families of Graphs
An E-cordial labeling σ: E →{0,1} induces σ∗: V →{0,1} on graph G=(V,E), where (σ(v)=(∑_(u∈V)▒〖σ(uv)〗) mod 2 is taken over all edges uv∈E, and the labelling satisfies the condition...

Back to Top