Browse
Submit Data
Databases
API
Help

Dataset Information

76 Views

0 Connections

0 Citations

0 Reanalyses

0 Downloads

Omics score: 0

Prediction of chemical-protein interactions network with weighted network-based inference method.

ABSTRACT: Chemical-protein interaction (CPI) is the central topic of target identification and drug discovery. However, large scale determination of CPI is a big challenge for in vitro or in vivo experiments, while in silico prediction shows great advantages due to low cost and high accuracy. On the basis of our previous drug-target interaction prediction via network-based inference (NBI) method, we further developed node- and edge-weighted NBI methods for CPI prediction here. Two comprehensive CPI bipartite networks extracted from ChEMBL database were used to evaluate the methods, one containing 17,111 CPI pairs between 4,741 compounds and 97 G protein-coupled receptors, the other including 13,648 CPI pairs between 2,827 compounds and 206 kinases. The range of the area under receiver operating characteristic curves was 0.73 to 0.83 for the external validation sets, which confirmed the reliability of the prediction. The weak-interaction hypothesis in CPI network was identified by the edge-weighted NBI method. Moreover, to validate the methods, several candidate targets were predicted for five approved drugs, namely imatinib, dasatinib, sertindole, olanzapine and ziprasidone. The molecular hypotheses and experimental evidence for these predictions were further provided. These results confirmed that our methods have potential values in understanding molecular basis of drug polypharmacology and would be helpful for drug repositioning.

SUBMITTER: Cheng F

PROVIDER: S-EPMC3397956 | biostudies-literature |

REPOSITORIES: biostudies-literature

ACCESS DATA

Json Xml

Similar Datasets

Method for Essential Protein Prediction Based on a Novel Weighted Protein-Domain Interaction Network.

Project description:In recent years a number of calculative models based on protein-protein interaction (PPI) networks have been proposed successively. However, due to false positives, false negatives, and the incompleteness of PPI networks, there are still many challenges affecting the design of computational models with satisfactory predictive accuracy when inferring key proteins. This study proposes a prediction model called WPDINM for detecting key proteins based on a novel weighted protein-domain interaction (PDI) network. In WPDINM, a weighted PPI network is constructed first by combining the gene expression data of proteins with topological information extracted from the original PPI network. Simultaneously, a weighted domain-domain interaction (DDI) network is constructed based on the original PDI network. Next, through integrating the newly obtained weighted PPI network and weighted DDI network with the original PDI network, a weighted PDI network is further constructed. Then, based on topological features and biological information, including the subcellular localization and orthologous information of proteins, a novel PageRank-based iterative algorithm is designed and implemented on the newly constructed weighted PDI network to estimate the criticality of proteins. Finally, to assess the prediction performance of WPDINM, we compared it with 12 kinds of competitive measures. Experimental results show that WPDINM can achieve a predictive accuracy rate of 90.19, 81.96, 70.72, 62.04, 55.83, and 51.13% in the top 1%, top 5%, top 10%, top 15%, top 20%, and top 25% separately, which exceeds the prediction accuracy achieved by traditional state-of-the-art competing measures. Owing to the satisfactory identification effect, the WPDINM measure may contribute to the further development of key protein identification.

| S-EPMC8010314 | biostudies-literature

In silico prediction of chemical mechanism of action via an improved network-based inference method.

Project description:Background and purposeDeciphering chemical mechanism of action (MoA) enables the development of novel therapeutics (e.g. drug repositioning) and evaluation of drug side effects. Development of novel computational methods for chemical MoA assessment under a systems pharmacology framework would accelerate drug discovery and development with greater efficiency and low cost.Experimental approachIn this study, we proposed an improved network-based inference method, balanced substructure-drug-target network-based inference (bSDTNBI), to predict MoA for old drugs, clinically failed drugs and new chemical entities. Specifically, three parameters were introduced into network-based resource diffusion processes to adjust the initial resource allocation of different node types, the weighted values of different edge types and the influence of hub nodes. The performance of the method was systematically validated by benchmark datasets and bioassays.Key resultsHigh performance was yielded for bSDTNBI in both 10-fold and leave-one-out cross validations. A global drug-target network was built to explore MoA of anticancer drugs and repurpose old drugs for 15 cancer types/subtypes. In a case study, 27 predicted candidates among 56 commercially available compounds were experimentally validated to have binding affinities on oestrogen receptor ? with IC50 or EC50 values ?10 ?M. Furthermore, two dual ligands with both agonistic and antagonistic activities ?1 ?M would provide potential lead compounds for the development of novel targeted therapy in breast cancer or osteoporosis.Conclusion and implicationsIn summary, bSDTNBI would provide a powerful tool for the MoA assessment on both old drugs and novel compounds in drug discovery and development.

| S-EPMC5738663 | biostudies-literature

Network-based prediction of protein interactions.

Project description:Despite exceptional experimental efforts to map out the human interactome, the continued data incompleteness limits our ability to understand the molecular roots of human disease. Computational tools offer a promising alternative, helping identify biologically significant, yet unmapped protein-protein interactions (PPIs). While link prediction methods connect proteins on the basis of biological or network-based similarity, interacting proteins are not necessarily similar and similar proteins do not necessarily interact. Here, we offer structural and evolutionary evidence that proteins interact not if they are similar to each other, but if one of them is similar to the other's partners. This approach, that mathematically relies on network paths of length three (L3), significantly outperforms all existing link prediction methods. Given its high accuracy, we show that L3 can offer mechanistic insights into disease mechanisms and can complement future experimental efforts to complete the human interactome.

| S-EPMC6423278 | biostudies-literature

FCTP-WSRC: Protein-Protein Interactions Prediction via Weighted Sparse Representation Based Classification.

Project description:The task of predicting protein-protein interactions (PPIs) has been essential in the context of understanding biological processes. This paper proposes a novel computational model namely FCTP-WSRC to predict PPIs effectively. Initially, combinations of the F-vector, composition (C) and transition (T) are used to map each protein sequence onto numeric feature vectors. Afterwards, an effective feature extraction method PCA (principal component analysis) is employed to reconstruct the most discriminative feature subspaces, which is subsequently used as input in weighted sparse representation based classification (WSRC) for prediction. The FCTP-WSRC model achieves accuracies of 96.67%, 99.82%, and 98.09% for H. pylori, Human and Yeast datasets respectively. Furthermore, the FCTP-WSRC model performs well when predicting three significant PPIs networks: the single-core network (CD9), the multiple-core network (Ras-Raf-Mek-Erk-Elk-Srf pathway), and the cross-connection network (Wnt-related Network). Consequently, the promising results show that the proposed method can be a powerful tool for PPIs prediction with excellent performance and less time.

| S-EPMC7010952 | biostudies-literature

Prediction of drug-target interactions and drug repositioning via network-based inference.

Project description:Drug-target interaction (DTI) is the basis of drug discovery and design. It is time consuming and costly to determine DTI experimentally. Hence, it is necessary to develop computational methods for the prediction of potential DTI. Based on complex network theory, three supervised inference methods were developed here to predict DTI and used for drug repositioning, namely drug-based similarity inference (DBSI), target-based similarity inference (TBSI) and network-based inference (NBI). Among them, NBI performed best on four benchmark data sets. Then a drug-target network was created with NBI based on 12,483 FDA-approved and experimental drug-target binary links, and some new DTIs were further predicted. In vitro assays confirmed that five old drugs, namely montelukast, diclofenac, simvastatin, ketoconazole, and itraconazole, showed polypharmacological features on estrogen receptors or dipeptidyl peptidase-IV with half maximal inhibitory or effective concentration ranged from 0.2 to 10 µM. Moreover, simvastatin and ketoconazole showed potent antiproliferative activities on human MDA-MB-231 breast cancer cell line in MTT assays. The results indicated that these methods could be powerful tools in prediction of DTIs and drug repositioning.

| S-EPMC3349722 | biostudies-literature

A Bipartite Network-based Method for Prediction of Long Non-coding RNA-protein Interactions.

Project description:As one large class of non-coding RNAs (ncRNAs), long ncRNAs (lncRNAs) have gained considerable attention in recent years. Mutations and dysfunction of lncRNAs have been implicated in human disorders. Many lncRNAs exert their effects through interactions with the corresponding RNA-binding proteins. Several computational approaches have been developed, but only few are able to perform the prediction of these interactions from a network-based point of view. Here, we introduce a computational method named lncRNA-protein bipartite network inference (LPBNI). LPBNI aims to identify potential lncRNA-interacting proteins, by making full use of the known lncRNA-protein interactions. Leave-one-out cross validation (LOOCV) test shows that LPBNI significantly outperforms other network-based methods, including random walk (RWR) and protein-based collaborative filtering (ProCF). Furthermore, a case study was performed to demonstrate the performance of LPBNI using real data in predicting potential lncRNA-interacting proteins.

| S-EPMC4792848 | biostudies-literature

DLS: A Link Prediction Method Based on Network Local Structure for Predicting Drug-Protein Interactions.

Project description:The studies on drug-protein interactions (DPIs) had significant for drug repositioning, drug discovery, and clinical medicine. The biochemical experimentation (in vitro) requires a long time and high cost to be confirmed because it is difficult to estimate. Therefore, a feasible solution is to predict DPIs efficiently with computers. We propose a link prediction method based on drug-protein interaction (DPI) local structural similarity (DLS) for predicting the DPIs. The DLS method combines link prediction and binary network structure to predict DPIs. The ten-fold cross-validation method was applied in the experiment. After comparing the predictive capability of DLS with the improved similarity-based network prediction method, the results of DLS on the test set are significantly better. Moreover, several candidate proteins were predicted for three approved drugs, namely captopril, desferrioxamine and losartan, and these predictions are further validated by the literature. In addition, the combination of the Common Neighborhood (CN) method and the DLS method provides a new idea for the integrated application of the link prediction method.

| S-EPMC7193019 | biostudies-literature

A Novel Human Microbe-Disease Association Prediction Method Based on the Bidirectional Weighted Network.

Project description:The survival of human beings is inseparable from microbes. More and more studies have proved that microbes can affect human physiological processes in various aspects and are closely related to some human diseases. In this paper, based on known microbe-disease associations, a bidirectional weighted network was constructed by integrating the schemes of normalized Gaussian interactions and bidirectional recommendations firstly. And then, based on the newly constructed bidirectional network, a computational model called BWNMHMDA was developed to predict potential relationships between microbes and diseases. Finally, in order to evaluate the superiority of the new prediction model BWNMHMDA, the framework of LOOCV and 5-fold cross validation were implemented, and simulation results indicated that BWNMHMDA could achieve reliable AUCs of 0.9127 and 0.8967 ± 0.0027 in these two different frameworks respectively, which is outperformed some state-of-the-art methods. Moreover, case studies of asthma, colorectal carcinoma, and chronic obstructive pulmonary disease were implemented to further estimate the performance of BWNMHMDA. Experimental results showed that there are 10, 9, and 8 out of the top 10 predicted microbes having been confirmed by related literature in these three kinds of case studies separately, which also demonstrated that our new model BWNMHMDA could achieve satisfying prediction performance.

| S-EPMC6465552 | biostudies-literature

Prediction of seed gene function in progressive diabetic neuropathy by a network-based inference method.

Project description:Guilt by association (GBA) algorithm has been widely used to statistically predict gene functions, and network-based approach increases the confidence and veracity of identifying molecular signatures for diseases. This work proposed a network-based GBA method by integrating the GBA algorithm and network, to identify seed gene functions for progressive diabetic neuropathy (PDN). The inference of predicting seed gene functions comprised of three steps: i) Preparing gene lists and sets; ii) constructing a co-expression matrix (CEM) on gene lists by Spearman correlation coefficient (SCC) method and iii) predicting gene functions by GBA algorithm. Ultimately, seed gene functions were selected according to the area under the receiver operating characteristics curve (AUC) index. A total of 79 differentially expressed genes (DEGs) and 40 background gene ontology (GO) terms were regarded as gene lists and sets for the subsequent analyses, respectively. The predicted results obtained from the network-based GBA approach showed that 27.5% of all gene sets had a good classified performance with AUC >0.5. Most significantly, 3 gene sets with AUC >0.6 were denoted as seed gene functions for PDN, including binding, molecular function and regulation of the metabolic process. In summary, we predicted 3 seed gene functions for PDN compared with non-progressors utilizing network-based GBA algorithm. The findings provide insights to reveal pathological and molecular mechanism underlying PDN.

| S-EPMC6468912 | biostudies-literature

Predicting protein interactions via parsimonious network history inference.

Project description:MotivationReconstruction of the network-level evolutionary history of protein-protein interactions provides a principled way to relate interactions in several present-day networks. Here, we present a general framework for inferring such histories and demonstrate how it can be used to determine what interactions existed in the ancestral networks, which present-day interactions we might expect to exist based on evolutionary evidence and what information extant networks contain about the order of ancestral protein duplications.ResultsOur framework characterizes the space of likely parsimonious network histories. It results in a structure that can be used to find probabilities for a number of events associated with the histories. The framework is based on a directed hypergraph formulation of dynamic programming that we extend to enumerate many optimal and near-optimal solutions. The algorithm is applied to reconstructing ancestral interactions among bZIP transcription factors, imputing missing present-day interactions among the bZIPs and among proteins from five herpes viruses, and determining relative protein duplication order in the bZIP family. Our approach more accurately reconstructs ancestral interactions than existing approaches. In cross-validation tests, we find that our approach ranks the majority of the left-out present-day interactions among the top 2 and 17% of possible edges for the bZIP and herpes networks, respectively, making it a competitive approach for edge imputation. It also estimates relative bZIP protein duplication orders, using only interaction data and phylogenetic tree topology, which are significantly correlated with sequence-based estimates.AvailabilityThe algorithm is implemented in C++, is open source and is available at http://www.cs.cmu.edu/ckingsf/software/parana2.Supplementary informationSupplementary data are available at Bioinformatics online.

| S-EPMC3694678 | biostudies-literature

OmicsDI is part of the ELIXIR infrastructure

OmicsDI is an Elixir interoperability service. Learn more ›

Tweets

OmicsDI Databases

PRIDE
PeptideAtlas
MassIVE
JPOST Repository
Physiome Model Repository

EGA
EVA
ENA
LINCS
PAXDB
Cell Collective

MetaboLights
Metabolomics Workbench
MetabolomeExpress
GNPS
BioModels
FAIRDOMHub

ArrayExpress
dbGaP
ExpressionAtlas
GEO
NODE

Information

Databases
Help
API
Contact us
Code on GitHub
Terms of use
Submit Data