Dataset Information

Repositioning Drugs on Human Influenza A Viruses Based on a Novel Nuclear Norm Minimization Method.

ABSTRACT: Influenza A viruses, especially H3N2 and H1N1 subtypes, are viruses that often spread among humans and cause influenza pandemic. There have been several big influenza pandemics that have caused millions of human deaths in history, and the threat of influenza viruses to public health is still serious nowadays due to the frequent antigenic drift and antigenic shift events. However, only few effective anti-flu drugs have been developed to date. The high development cost, long research and development time, and drug side effects are the major bottlenecks, which could be relieved by drug repositioning. In this study, we proposed a novel antiviral Drug Repositioning method based on minimizing Matrix Nuclear Norm (DRMNN). Specifically, a virus-drug correlation database consisting of 34 viruses and 205 antiviral drugs was first curated from public databases and published literature. Together with drug similarity on chemical structure and virus sequence similarity, we formulated the drug repositioning problem as a low-rank matrix completion problem, which was solved by minimizing the nuclear norm of a matrix with a few regularization terms. DRMNN was compared with three recent association prediction algorithms. The AUC of DRMNN in the global fivefold cross-validation (fivefold CV) is 0.8661, and the AUC in the local leave-one-out cross-validation (LOOCV) is 0.6929. Experiments have shown that DRMNN is better than other algorithms in predicting which drugs are effective against influenza A virus. With H3N2 as an example, 10 drugs most likely to be effective against H3N2 viruses were listed, among which six drugs were reported, in other literature, to have some effect on the viruses. The protein docking experiments between the chemical structure of the prioritized drugs and viral hemagglutinin protein also provided evidence for the potential of the predicted drugs for the treatment of influenza.

SUBMITTER: Liang H

PROVIDER: S-EPMC7849835 | biostudies-literature | 2020

REPOSITORIES: biostudies-literature

ACCESS DATA

Publications

Repositioning Drugs on Human Influenza A Viruses Based on a Novel Nuclear Norm Minimization Method.

Liang Hang H Zhang Li L Wang Lina L Gao Man M Meng Xiangfeng X Li Mengyao M Liu Junhui J Li Wei W Meng Fanzheng F

Frontiers in physiology 20210118

Influenza A viruses, especially H3N2 and H1N1 subtypes, are viruses that often spread among humans and cause influenza pandemic. There have been several big influenza pandemics that have caused millions of human deaths in history, and the threat of influenza viruses to public health is still serious nowadays due to the frequent antigenic drift and antigenic shift events. However, only few effective anti-flu drugs have been developed to date. The high development cost, long research and developme ...[more]

PMID: 33536933

Similar Datasets

Project description:MotivationComputational drug repositioning is a cost-effective strategy to identify novel indications for existing drugs. Drug repositioning is often modeled as a recommendation system problem. Taking advantage of the known drug-disease associations, the objective of the recommendation system is to identify new treatments by filling out the unknown entries in the drug-disease association matrix, which is known as matrix completion. Underpinned by the fact that common molecular pathways contribute to many different diseases, the recommendation system assumes that the underlying latent factors determining drug-disease associations are highly correlated. In other words, the drug-disease matrix to be completed is low-rank. Accordingly, matrix completion algorithms efficiently constructing low-rank drug-disease matrix approximations consistent with known associations can be of immense help in discovering the novel drug-disease associations.ResultsIn this article, we propose to use a bounded nuclear norm regularization (BNNR) method to complete the drug-disease matrix under the low-rank assumption. Instead of strictly fitting the known elements, BNNR is designed to tolerate the noisy drug-drug and disease-disease similarities by incorporating a regularization term to balance the approximation error and the rank properties. Moreover, additional constraints are incorporated into BNNR to ensure that all predicted matrix entry values are within the specific interval. BNNR is carried out on an adjacency matrix of a heterogeneous drug-disease network, which integrates the drug-drug, drug-disease and disease-disease networks. It not only makes full use of available drugs, diseases and their association information, but also is capable of dealing with cold start naturally. Our computational results show that BNNR yields higher drug-disease association prediction accuracy than the current state-of-the-art methods. The most significant gain is in prediction precision measured as the fraction of the positive predictions that are truly positive, which is particularly useful in drug design practice. Cases studies also confirm the accuracy and reliability of BNNR.Availability and implementationThe code of BNNR is freely available at https://github.com/BioinformaticsCSU/BNNR.Supplementary informationSupplementary data are available at Bioinformatics online.

Project description:Advances in high-throughput technologies in genomics and imaging yield unprecedentedly large numbers of prognostic biomarkers. To accommodate the scale of biomarkers and study their association with disease outcomes, penalized regression is often used to identify important biomarkers. The ideal variable selection procedure would search for the best subset of predictors, which is equivalent to imposing an ?0 -penalty on the regression coefficients. Since this optimization is a nondeterministic polynomial-time hard (NP-hard) problem that does not scale with number of biomarkers, alternative methods mostly place smooth penalties on the regression parameters, which lead to computationally feasible optimization problems. However, empirical studies and theoretical analyses show that convex approximation of ?0 -norm (eg, ?1 ) does not outperform their ?0 counterpart. The progress for ?0 -norm feature selection is relatively slower, where the main methods are greedy algorithms such as stepwise regression or orthogonal matching pursuit. Penalized regression based on regularizing ?0 -norm remains much less explored in the literature. In this work, inspired by the recently popular augmenting and data splitting algorithms including alternating direction method of multipliers, we propose a 2-stage procedure for ?0 -penalty variable selection, referred to as augmented penalized minimization-L0 (APM-L0 ). The APM-L0 targets ?0 -norm as closely as possible while keeping computation tractable, efficient, and simple, which is achieved by iterating between a convex regularized regression and a simple hard-thresholding estimation. The procedure can be viewed as arising from regularized optimization with truncated ?1 norm. Thus, we propose to treat regularization parameter and thresholding parameter as tuning parameters and select based on cross-validation. A 1-step coordinate descent algorithm is used in the first stage to significantly improve computational efficiency. Through extensive simulation studies and real data application, we demonstrate superior performance of the proposed method in terms of selection accuracy and computational speed as compared to existing methods. The proposed APM-L0 procedure is implemented in the R-package APML0.

Project description:Numerous clinical trials of drug candidates for Alzheimer's disease (AD) have failed, and computational drug repositioning approaches using omics data have been proposed as effective alternative approaches to the discovery of drug candidates. However, little multi-omics data is available for AD, due to limited availability of brain tissues. Even if omics data exist, systematic drug repurposing study for AD has suffered from lack of big data, insufficient clinical information, and difficulty in data integration on account of sample heterogeneity derived from poor diagnosis or shortage of qualified post-mortem tissue. In this study, we developed a proteotranscriptomic-based computational drug repositioning method named Drug Repositioning Perturbation Score/Class (DRPS/C) based on inverse associations between disease- and drug-induced gene and protein perturbation patterns, incorporating pharmacogenomic knowledge. We constructed a Drug-induced Gene Perturbation Signature Database (DGPSD) comprised of 61,019 gene signatures perturbed by 1,520 drugs from the Connectivity Map (CMap) and the L1000 CMap. Drugs were classified into three DRPCs (High, Intermediate, and Low) according to DRPSs that were calculated using drug- and disease-induced gene perturbation signatures from DGPSD and The Cancer Genome Atlas (TCGA), respectively. The DRPS/C method was evaluated using the area under the ROC curve, with a prescribed drug list from TCGA as the gold standard. Glioblastoma had the highest AUC. To predict anti-AD drugs, DRPS were calculated using DGPSD and AD-induced gene/protein perturbation signatures generated from RNA-seq, microarray and proteomic datasets in the Synapse database, and the drugs were classified into DRPCs. We predicted 31 potential anti-AD drug candidates commonly belonged to high DRPCs of transcriptomic and proteomic signatures. Of these, four drugs classified into the nervous system group of Anatomical Therapeutic Chemical (ATC) system are voltage-gated sodium channel blockers (bupivacaine, topiramate) and monamine oxidase inhibitors (selegiline, iproniazid), and their mechanism of action was inferred from a potential anti-AD drug perspective. Our approach suggests a shortcut to discover new efficacy of drugs for AD.

Dataset Information

Repositioning Drugs on Human Influenza A Viruses Based on a Novel Nuclear Norm Minimization Method.

Publications

Repositioning Drugs on Human Influenza A Viruses Based on a Novel Nuclear Norm Minimization Method.

Similar Datasets

OmicsDI is part of the ELIXIR infrastructure

Tweets