Drug repositioning based on weighted local information augmented graph neural network
Ontology highlight
ABSTRACT:
SUBMITTER:
PROVIDER: S-EPMC10686358 | biostudies-literature | 2023 Nov
REPOSITORIES: biostudies-literature
Similar Datasets
Project description:Mining potential drug-disease associations can speed up drug repositioning for pharmaceutical companies. Previous computational strategies focused on prior biological information for association inference. However, such information may not be comprehensively available and may contain errors. Different from previous research, two inference methods, ProbS and HeatS, were introduced in this paper to predict direct drug-disease associations based only on the basic network topology measure. Bipartite network topology was used to prioritize the potentially indicated diseases for a drug. Experimental results showed that both methods can receive reliable prediction performance and achieve AUC values of 0.9192 and 0.9079, respectively. Case studies on real drugs indicated that some of the strongly predicted associations were confirmed by results in the Comparative Toxicogenomics Database (CTD). Finally, a comprehensive prediction of drug-disease associations enables us to suggest many new drug indications for further studies.
| S-EPMC4410541 | biostudies-literature
Project description:MotivationThe emergence of network medicine not only offers more opportunities for better and more complete understanding of the molecular complexities of diseases, but also serves as a promising tool for identifying new drug targets and establishing new relationships among diseases that enable drug repositioning. Computational approaches for drug repositioning by integrating information from multiple sources and multiple levels have the potential to provide great insights to the complex relationships among drugs, targets, disease genes and diseases at a system level.ResultsIn this article, we have proposed a computational framework based on a heterogeneous network model and applied the approach on drug repositioning by using existing omics data about diseases, drugs and drug targets. The novelty of the framework lies in the fact that the strength between a disease-drug pair is calculated through an iterative algorithm on the heterogeneous graph that also incorporates drug-target information. Comprehensive experimental results show that the proposed approach significantly outperforms several recent approaches. Case studies further illustrate its practical usefulness.Availability and implementationhttp://cbc.case.eduContactjingli@cwru.eduSupplementary informationSupplementary data are available at Bioinformatics online.
| S-EPMC4184255 | biostudies-literature
Project description:Drug repurposing is the process of discovering new indications (i.e., diseases or conditions) for already approved drugs. Many computational methods have been proposed for predicting new associations between drugs and diseases. In this article, we proposed a new method, called DR-HGNN, an integrative heterogeneous graph neural network-based method for multi-labeled drug repurposing, to discover new indications for existing drugs. For this purpose, we first used the DTINet dataset to construct a heterogeneous drug-protein-disease (DPD) network, which is a graph composed of four types of nodes (drugs, proteins, diseases, and drug side effects) and eight types of edges. Second, we labeled each drug-protein edge, dp i,j = (d i , p j ), of the DPD network with a set of diseases, {δ i,j,1, … , δ i,j,k } associated with both d i and p j and then devised multi-label ranking approaches which incorporate neural network architecture that operates on the heterogeneous graph-structured data and which leverages both the interaction patterns and the features of drug and protein nodes. We used a derivative of the GraphSAGE algorithm, HinSAGE, on the heterogeneous DPD network to learn low-dimensional vector representation of features of drugs and proteins. Finally, we used the drug-protein network to learn the embeddings of the drug-protein edges and then predict the disease labels that act as bridges between drugs and proteins. The proposed method shows better results than existing methods applied to the DTINet dataset, with an AUC of 0.964.
| S-EPMC9298882 | biostudies-literature
Project description:MotivationDrug repositioning is an effective strategy to identify new indications for existing drugs, providing the quickest possible transition from bench to bedside. With the rapid development of deep learning, graph convolutional networks (GCNs) have been widely adopted for drug repositioning tasks. However, prior GCNs based methods exist limitations in deeply integrating node features and topological structures, which may hinder the capability of GCNs.ResultsIn this study, we propose an adaptive GCNs approach, termed AdaDR, for drug repositioning by deeply integrating node features and topological structures. Distinct from conventional graph convolution networks, AdaDR models interactive information between them with adaptive graph convolution operation, which enhances the expression of model. Concretely, AdaDR simultaneously extracts embeddings from node features and topological structures and then uses the attention mechanism to learn adaptive importance weights of the embeddings. Experimental results show that AdaDR achieves better performance than multiple baselines for drug repositioning. Moreover, in the case study, exploratory analyses are offered for finding novel drug-disease associations.Availability and implementationThe soure code of AdaDR is available at: https://github.com/xinliangSun/AdaDR.
| S-EPMC10761094 | biostudies-literature
Project description:BackgroundAn increasing number of biological and clinical evidences have indicated that the microorganisms significantly get involved in the pathological mechanism of extensive varieties of complex human diseases. Inferring potential related microbes for diseases can not only promote disease prevention, diagnosis and treatment, but also provide valuable information for drug development. Considering that experimental methods are expensive and time-consuming, developing computational methods is an alternative choice. However, most of existing methods are biased towards well-characterized diseases and microbes. Furthermore, existing computational methods are limited in predicting potential microbes for new diseases.ResultsHere, we developed a novel computational model to predict potential human microbe-disease associations (MDAs) based on Weighted Meta-Graph (WMGHMDA). We first constructed a heterogeneous information network (HIN) by combining the integrated microbe similarity network, the integrated disease similarity network and the known microbe-disease bipartite network. And then, we implemented iteratively pre-designed Weighted Meta-Graph search algorithm on the HIN to uncover possible microbe-disease pairs by cumulating the contribution values of weighted meta-graphs to the pairs as their probability scores. Depending on contribution potential, we described the contribution degree of different types of meta-graphs to a microbe-disease pair with bias rating. Meta-graph with higher bias rating will be assigned greater weight value when calculating probability scores.ConclusionsThe experimental results showed that WMGHMDA outperformed some state-of-the-art methods with average AUCs of 0.9288, 0.9068 ±0.0031 in global leave-one-out cross validation (LOOCV) and 5-fold cross validation (5-fold CV), respectively. In the case studies, 9, 19, 37 and 10, 20, 45 out of top-10, 20, 50 candidate microbes were manually verified by previous reports for asthma and inflammatory bowel disease (IBD), respectively. Furthermore, three common human diseases (Crohn's disease, Liver cirrhosis, Type 1 diabetes) were adopted to demonstrate that WMGHMDA could be efficiently applied to make predictions for new diseases. In summary, WMGHMDA has a high potential in predicting microbe-disease associations.
| S-EPMC6824056 | biostudies-literature
Project description:MotivationAccurate identification of target proteins that interact with drugs is a vital step in silico, which can significantly foster the development of drug repurposing and drug discovery. In recent years, numerous deep learning-based methods have been introduced to treat drug-target interaction (DTI) prediction as a classification task. The output of this task is binary identification suggesting the absence or presence of interactions. However, existing studies often (i) neglect the unique molecular attributes when embedding drugs and proteins, and (ii) determine the interaction of drug-target pairs without considering biological interaction information.ResultsIn this study, we propose an end-to-end attention-derived method based on the self-attention mechanism and graph neural network, termed SAGDTI. The aim of this method is to overcome the aforementioned drawbacks in the identification of DTI. SAGDTI is the first method to sufficiently consider the unique molecular attribute representations for both drugs and targets in the input form of the SMILES sequences and three-dimensional structure graphs. In addition, our method aggregates the feature attributes of biological information between drugs and targets through multi-scale topologies and diverse connections. Experimental results illustrate that SAGDTI outperforms existing prediction models, which benefit from the unique molecular attributes embedded by atom-level attention and biological interaction information representation aggregated by node-level attention. Moreover, a case study on severe acute respiratory syndrome coronavirus 2 (SARS-CoV-2) shows that our model is a powerful tool for identifying DTIs in real life.Availability and implementationThe data and codes underlying this article are available in Github at https://github.com/lixiaokun2020/SAGDTI.
| S-EPMC10818136 | biostudies-literature
Project description:Drug synergy is a crucial component in drug reuse since it solves the problem of sluggish drug development and the absence of corresponding drugs for several diseases. Predicting drug synergistic relationships can screen drug combinations in advance and reduce the waste of laboratory resources. In this research, we proposed a model that utilizes graph autoencoder and convolutional neural networks to predict drug synergy (GAECDS). Our methods include a graph convolutional neural network as an encoder to encode drug features and use a matrix factorization method as a decoder. Multilayer perceptron (MLP) was applied to process cell line features and combine them with drug features. Furthermore, the latent vectors generated during the encoding process are being used to predict drug synergistic scores using a convolutional neural network. By measuring prediction performance using AUC, AUPR, and F1 score, GAECDS superior to other state-of-the-art models. In addition, four pairs of the predicted top 10 drug combinations were found to work well enough for evaluation. The case study shows that the GAECDS approach is useful for identifying potential drug synergy.
| S-EPMC10029792 | biostudies-literature
Project description:MotivationProtein-protein interaction sites (PPIS) are crucial for deciphering protein action mechanisms and related medical research, which is the key issue in protein action research. Recent studies have shown that graph neural networks have achieved outstanding performance in predicting PPIS. However, these studies often neglect the modeling of information at different scales in the graph and the symmetry of protein molecules within three-dimensional space.ResultsIn response to this gap, this article proposes the MEG-PPIS approach, a PPIS prediction method based on multi-scale graph information and E(n) equivariant graph neural network (EGNN). There are two channels in MEG-PPIS: the original graph and the subgraph obtained by graph pooling. The model can iteratively update the features of the original graph and subgraph through the weight-sharing EGNN. Subsequently, the max-pooling operation aggregates the updated features of the original graph and subgraph. Ultimately, the model feeds node features into the prediction layer to obtain prediction results. Comparative assessments against other methods on benchmark datasets reveal that MEG-PPIS achieves optimal performance across all evaluation metrics and gets the fastest runtime. Furthermore, specific case studies demonstrate that our method can predict more true positive and true negative sites than the current best method, proving that our model achieves better performance in the PPIS prediction task.Availability and implementationThe data and code are available at https://github.com/dhz234/MEG-PPIS.git.
| S-EPMC11252844 | biostudies-literature
Project description:MotivationBreast cancer is one of the leading causes of cancer deaths among women worldwide. It is necessary to develop new breast cancer drugs because of the shortcomings of existing therapies. The traditional discovery process is time-consuming and expensive. Repositioning of clinically approved drugs has emerged as a novel approach for breast cancer therapy. However, serendipitous or experiential repurposing cannot be used as a routine method.ResultsIn this study, we proposed a graph neural network model GraphRepur based on GraphSAGE for drug repurposing against breast cancer. GraphRepur integrated two major classes of computational methods, drug network-based and drug signature-based. The differentially expressed genes of disease, drug-exposure gene expression data and the drug-drug links information were collected. By extracting the drug signatures and topological structure information contained in the drug relationships, GraphRepur can predict new drugs for breast cancer, outperforming previous state-of-the-art approaches and some classic machine learning methods. The high-ranked drugs have indeed been reported as new uses for breast cancer treatment recently.Availabilityand implementationThe source code of our model and datasets are available at: https://github.com/cckamy/GraphRepur and https://figshare.com/articles/software/GraphRepur_Breast_Cancer_Drug_Repurposing/14220050.Supplementary informationSupplementary data are available at Bioinformatics online.
| S-EPMC8479657 | biostudies-literature
Project description:BackgroundDiverse interactions occur between biomolecules, such as activation, inhibition, expression, or repression. However, previous network-based studies of drug repositioning have employed interaction on the binary protein-protein interaction (PPI) network without considering the characteristics of the interactions. Recently, some studies of drug repositioning using gene expression data found that associations between drug and disease genes are useful information for identifying novel drugs to treat diseases. However, the gene expression profiles for drugs and diseases are not always available. Although gene expression profiles of drugs and diseases are available, existing methods cannot use the drugs or diseases, when differentially expressed genes in the profiles are not included in their network.ResultsWe developed a novel method for identifying candidate indications of existing drugs considering types of interactions between biomolecules based on known drug-disease associations. To obtain associations between drug and disease genes, we constructed a directed network using protein interaction and gene regulation data obtained from various public databases providing diverse biological pathways. The network includes three types of edges depending on relationships between biomolecules. To quantify the association between a target gene and a disease gene, we explored the shortest paths from the target gene to the disease gene and calculated the types and weights of the shortest paths. For each drug-disease pair, we built a vector consisting of values for each disease gene influenced by the drug. Using the vectors and known drug-disease associations, we constructed classifiers to identify novel drugs for each disease.ConclusionWe propose a method for exploring candidate drugs of diseases using associations between drugs and disease genes derived from a directed gene network instead of gene regulation data obtained from gene expression profiles. Compared to existing methods that require information on gene relationships and gene expression data, our method can be applied to a greater number of drugs and diseases. Furthermore, to validate our predictions, we compared the predictions with drug-disease pairs in clinical trials using the hypergeometric test, which showed significant results. Our method also showed better performance compared to existing methods for the area under the receiver operating characteristic curve (AUC).
| S-EPMC6249928 | biostudies-literature