Research Article | Open Access
Hailin Chen, Heng Zhang, Zuping Zhang, Yiqin Cao, Wenliang Tang, "Network-Based Inference Methods for Drug Repositioning", Computational and Mathematical Methods in Medicine, vol. 2015, Article ID 130620, 7 pages, 2015. https://doi.org/10.1155/2015/130620
Network-Based Inference Methods for Drug Repositioning
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.
Drug discovery is a costly and time-consuming process. Previous research reported that it takes around 15 years and $800 million to $1 billion for pharmaceutical companies to develop a new drug and bring it to market [1, 2]. Although such huge amount of time and money has been put into this industry, only a relatively small number (~20) of new drugs known as new molecular entities (NMEs) are approved by US Food and Drug Administration (FDA) each year (http://www.fda.gov/Drugs/DevelopmentApprovalProcess/HowDrugsareDevelopedandApproved/DrugandBiologicApprovalReports/default.htm). Even so, there is a declining trend in annual drug introductions and the most significant cause of this productivity decline has been the decrease in development survival rates, especially the attrition rate in Phase II trials . It was estimated that Phase II survival in drug development has dropped from near 50% to less than 30% [4, 5].
As the concept of “one drug, multiple targets”  is now widely recognized, drug repositioning or repurposing (i.e., finding a new use for an existing drug)  has been proposed to provide a solution to the above problems faced by pharmaceutical companies. For example, Rituxan was originally indicated for non-Hodgkin’s Lymphoma and it was later approved for chronic lymphocytic leukemia and rheumatoid arthritis. Since drug repositioning can benefit not only pharmaceutical companies but also patients, various efforts, including traditionally blind screening methods of chemical libraries against specific cell lines  or cellular organisms [9, 10], and serial testing of animal models , have been made to search new indications for existing drugs. Meanwhile, to reduce cost and time of in vivo and in vitro experiments, many computational methods have been published for drug repositioning [12–22]. These methods can be classified as “drug based” or “disease based” and they mainly take similarity measures (chemical similarity, molecular activity similarity, or side effect similarity), molecular docking, or shared molecular pathology to reveal potential repurposing opportunities . New drug targets, mainly proteins, genes, or pathways, are predicted by these methods for further drug repositioning. Applications and limitations coexist in these methods and comprehensive summaries of recent advancement of computational drug repositioning are available in the two reviews [23, 24].
More recently, several computational strategies have been proposed to predict direct drug-disease associations for drug repositioning. The Comparative Toxicogenomics Database (CTD; http://ctdbase.org/)  is a comprehensive and publicly available database which inferred chemical-disease associations by integrating chemical-gene interactions and gene-disease relationships received manually from published literature. Chiang and Butte  implemented a network-based, guilt-by-association method (GBA) for drug-disease association prediction and novel drug use suggestions were made based on shared treatment profile from disease pairs. This repositioning strategy is limited by the complex relationships between drugs and diseases as many drugs are indicated as palliative treatments for diseases, like cancers . Based on the observation that similar drugs are indicated for similar diseases, Gottlieb et al.  developed a novel algorithm, PREDICT, to infer potential drug-disease associations and predict new drug indications. Multiple drug-drug and disease-disease similarity measures were integrated into their method and excellent prediction accuracy can be obtained on cross validation. However, negative samples were needed in their model to implement the prediction procedure. Experimentally verified negative drug-disease associations are not available due to lack of research value. A comodule (important gene modules shared by both drugs and diseases) method was proposed by Zhao and Li  to understand how drugs and diseases are associated in the molecular level. Applying the method to simulations and real data demonstrated that it was able to identify new drug-disease associations and highlight their molecular basis. Huang et al.  designed a network propagation model and exploited existing chemical, genomic, and disease phenotype data to infer drug-protein/gene-disease phenotype relationships, in which genes with similar functional modules were related to not only drugs but also the disease phenotype. Daminelli et al.  integrated structural and chemical data to build a drug-target-disease network and mined the network for network motifs of bi-cliques where every drug is linked to every target and disease. Links from drugs to diseases were predicted by completing the incomplete bicliques. Ye et al.  collected known drug target information and disease pathway profile to develop a method for evaluating the relationships between drugs and a specific disease. Emig et al.  integrated disease gene expression signatures, drug targets, disease information, and molecular interaction network to prioritize drug targets for drug repositioning.
Computational inference methods are important ways to choose the most promising drug-disease associations for further drug repositioning. Current computational methods need biologically relevant information, including negative association results, similarity measures, or gene expression profiles, to assist drug-disease association prediction. Such additional information may not be easily available or may contain errors . Different from previous research, in this paper, two inference methods, ProbS and HeatS, were introduced to predict direct drug-disease associations based only on the basic network topology measure. We formulated the problem as recommending preferable diseases for drugs. Network topology was used to prioritize the potentially targeted diseases for drugs. We tested the two methods on an experimentally verified dataset with leave-one-out cross validation for performance evaluation. Experimental results showed that both methods can receive reliable prediction performance and achieve AUC values of 0.9192 and 0.9079, respectively. The method ProbS with a better performance was selected for potential drug-disease association prediction. Case studies demonstrated that some of the strongly predicted associations are confirmed by the publicly available database CTD , which indicated the practical applications of the method ProbS in a real environment. Finally, plenty of predicted drug-disease associations were publicly released for future drug repositioning. It is expected that these methods will provide help to facilitate further research on drug repositioning.
2. Materials and Methods
Experimentally confirmed drug-disease associations were downloaded from the supplementary material of . At the time of the paper  was written, Gottlieb et al. collected 1933 associations between 593 drugs taken from DrugBank  and 313 diseases listed in the Online Mendelian Inheritance in Man (OMIM) database . This set of known drug-disease associations is regarded as the “gold standard” data and is used for evaluating the performance of our introduced methods in the following cross validation experiments as well as training data in the comprehensive association prediction.
We denote the drug set as and the disease set as . The drug-disease associations can be described as a bipartite DP graph , where . An edge is drawn between the drug and the disease if there exists an association between them. The DP bipartite network can be presented by an adjacent matrix , where if and is linked, while all other unknown drug-disease pairs are labeled as 0 to indicate that their associations need to be predicted.
2.2. Method Description
The methods ProbS and HeatS we applied in this paper are based on the recommendation techniques developed by Zhou et al. [33, 36]. We formulated our problem as recommending diseases for a given drug by mining data on the drug-disease bipartite network properties.
Given the drug-disease bipartite network defined above, ProbS works by assigning diseases an initial resource denoted by the vector , and is the initial resource allocated to the th disease in the disease set . The initial resource of an associated disease is set to be 1 in our study; otherwise it is set to be 0. In the first step, all the resource in the disease set flows to the drug set according to where is the degree of node . Subsequently, all the resource in the drug set returns similarly back to the disease set . The final resource allocated to is calculated asThe final recommendation list of candidate diseases is sorted according to the results of (2) in a descending order. The disease(s) with the highest score(s) is chosen as the new indication(s) for the corresponding drug.
3.1. Construction and Characteristics of the Drug-Disease Association Network
In this study, we first focused on the verified drug-disease associations. There were 1933 experimentally confirmed drug-disease associations, including 593 drugs and 313 diseases, on our benchmark dataset. We used the 1933 associations to generate a bipartite graph (Figure 2). In the bipartite graph, the heterogeneous nodes correspond to either drugs or diseases, and edges correspond to associations between them. An edge is placed between a drug node and a disease node if the drug is known to have an association with the disease. It can be observed that drugs tend to bind known diseases, forming highly interconnected subnetworks.
Figure 3 gives the degree distributions of drugs and diseases in the drug-disease network. We found that more than 70% (422/593) of the drugs were associated with at least two diseases, and approximately 66% (206/313) diseases were associated with two or more drugs. The average number of associated diseases for each drug is 3.26 and the average number of associated drugs for each disease is 6.18. More details are available in Figure 3 and Table 1.
3.2. Leave-One-Out Cross Validation for Performance Evaluation
To assess the comparative performance of both methods in predicting new indications for existing drugs, we perform leave-one-out cross validation experiments on the benchmark dataset. For a given drug , each known associated disease was left out once in turn as test disease, whose initial resource was set to be 0, and the candidate disease set consisted of all the diseases which had no evidence to show their associations with the drug . The entire associations were prioritized according to the scores derived from the two methods.
We calculated the sensitivity and specificity for each threshold. Sensitivity refers to the percentage of the associations whose ranking is higher than a given threshold, namely, the ratio of the successfully predicted experimentally verified drug-disease associations to the total experimentally verified drug-disease associations. Specificity refers to the percentage of associations that are below the threshold. Receiver-operating characteristics (ROC) curves were plotted by varying the threshold, and the values of area under curves (AUC) were calculated. When the two methods, ProbS and HeatS, were tested on the 1933 experimentally verified drug-disease associations in the framework of leave-one-out cross validation, reliable AUC values of 0.9192 and 0.9079 were received, respectively. To be instructive, we also provided AUC values for each drug received by leave-one-out cross validation (see Supplementary Material S1 available online at http://dx.doi.org/10.1155/2015/130620 for the method ProbS and S2 for HeatS).
We also calculated the positions of preferably drug-disease associations ranked on the recommendation list for the two methods. For instance, if there are 100 candidate diseases for a drug and an associated disease is ranked 5th in the candidate diseases, we say the position of the disease is 5/100, denoted by = 0.05. A good algorithm is expected to give a small . Therefore, we used the average value of the position over all diseases in the candidate set to compare the algorithmic accuracy. The average values of the position for ProbS and HeatS were 0.0319 and 0.0434, respectively.
The reliable performance suggested that both the two methods can recover the confirmed drug-disease associations and therefore has the potential to predict new drug-disease associations for drug repositioning.
3.3. Comparison with Other Methods
Recently, several computational models, which were based on different data features, have been proposed for drug-disease association prediction. Some information, like protein-protein interactions adopted in , has a high rate of false-positive and false-negative results, which will influence experimental results. The most recent study related with our work is the computational model proposed by Gottlieb et al. , which was based on the observation that similar drugs are indicated for similar diseases. Excellent prediction performance can be received by this method. However, one limitation of this model is that negative samples were needed for association prediction. Our method is based on the experimentally verified drug-disease associations and does not make use of any prior biological knowledge.
3.4. Case Studies
To further explain the inference power of the method ProbS on drug-disease association prediction, we conducted case studies on three drugs (Felodipine, Aspirin, and Tamoxifen). The whole candidate diseases were ranked according to the method. We manually checked the top 10 predicted associations and confirmed that 4, 6, and 6 associations (Tables 2–4) are now annotated in the CTD (http://ctdbase.org/)  database. We take these as a strong evidence to support the practical application of the method ProbS. Note that the predicted associations that are not yet reported may also exist in reality and they provide opportunities for drug repositioning.
3.5. Comprehensive Prediction of Drug-Disease Associations
After comprehensively confirming the accuracy of both methods, we chose ProbS, which showed a better performance, to further predict novel drug-disease associations for future drug repositioning. In this scenario, we trained ProbS with all the known drug-disease associations on the benchmark dataset. For all the 593 drugs, we ranked and selected the top 10 predicted diseases for drug repositioning (Supplementary Material S3). We believe that these predicted associations would benefit drug research.
Searching novel drug-disease associations is a critical step in drug repositioning. Computational methods for drug-disease association prediction have received numerous interests and current computational strategies depend on prior biological information, including gene expression profiles, protein-protein interactions (PPI), or chemical structures. Such information may not be widely available and some may contain errors.
In this paper, two network topology-based inference methods were introduced to predict potential drug-disease associations. The essential difference between them is the resource-allocation strategies they applied. Even though both methods do not use any prior biological knowledge, experimental results showed that reliable prediction performance can be achieved by the two methods. Moreover both the two methods are easy to be implemented and they have a low time complexity of ().
Despite the encouraging results produced by the two methods, some limitations should be noted. First, as only network topology is applied, both the two methods cannot work for drugs without any known drug-disease associations. To predict drug-disease associations for novel drugs, reliable similarity measure needs to be taken into consideration. Meanwhile, the predicted results may be biased as our methods depend heavily on existing drug-disease associations for predictions and our current knowledge about drug-disease associations is far from complete. Therefore, the performance of the methods could be improved by integrating more verified drug-disease associations.
Conflict of Interests
The authors declare that there is no conflict of interests regarding the publication of this paper.
The authors are grateful to Dr. Jianguo Liu at University of Shanghai for Science and Technology for his help. This research was supported by the National Natural Science Foundation of China (Grants 60970095, 61365008, and 61165007) (http://www.nsfc.gov.cn/), the Nature Science Foundation of Jiangxi Province (no. 20132BAB211036), Grant 20123BBE50093 from Jiangxi Province, Jiangxi Province Science and Technology Department (no. 20132BBF60083), and the Science and Technology Supported Project of Jiangxi Province Education Department (no. GJJ13340).
Supplementary Material S1: AUC values for each drug received by leave-one-out cross-validation when ProbS was applied.
Supplementary Material S2: AUC values for each drug received by leave-one-out cross-validation when HeatS was applied.
Supplementary Material S3: The top 10 predicted associations between each drug and diseases.
- J. A. DiMasi, “New drug development in the United States from 1963 to 1999,” Clinical Pharmacology and Therapeutics, vol. 69, no. 5, pp. 286–296, 2001.
- C. P. Adams and V. Van Brantner, “Estimating the cost of new drug development: Is it really $802 million dollars?” Health Affairs, vol. 25, no. 2, pp. 420–428, 2006.
- B. Booth and R. Zemmel, “Prospects for productivity,” Nature Reviews Drug Discovery, vol. 3, no. 5, pp. 451–456, 2004.
- L. Brothers, The Fruits of Genomics, Lehman Brothers, New York, NY, USA, 2001.
- R. Edmunds, P. C. Ma, and C. P. Tanio, “Splicing a cost squeeze into the genomics revolution,” McKinsey Quarterly, vol. 2, pp. 15–18, 2001.
- I. Vogt and J. Mestres, “Drug-target networks,” Molecular Informatics, vol. 29, no. 1-2, pp. 10–14, 2010.
- T. T. Ashburn and K. B. Thor, “Drug repositioning: identifying and developing new uses for existing drugs,” Nature Reviews Drug Discovery, vol. 3, no. 8, pp. 673–683, 2004.
- J. N. Weinstein, T. G. Myers, P. M. O'Connor et al., “An information-intensive approach to the molecular pharmacology of cancer,” Science, vol. 275, no. 5298, pp. 343–349, 1997.
- T. Hughes, B. Andrews, and C. Boone, “Old drugs, new tricks: using genetically sensitized yeast to reveal drug targets,” Cell, vol. 116, no. 1, pp. 5–7, 2004.
- P. Y. Lum, C. D. Armour, S. B. Stepaniants et al., “Discovering modes of action for therapeutic compounds using a genome-wide screen of yeast heterozygotes,” Cell, vol. 116, no. 1, pp. 121–137, 2004.
- K. E. Kinnamon and W. E. Rothe, “Biological screening in the US Army antimalarial drug development program,” The American Journal of Tropical Medicine and Hygiene, vol. 24, no. 2, pp. 174–178, 1975.
- Y. Yamanishi, M. Araki, A. Gutteridge, W. Honda, and M. Kanehisa, “Prediction of drug-target interaction networks from the integration of chemical and genomic spaces,” Bioinformatics, vol. 24, no. 13, pp. i232–i240, 2008.
- Y. Yamanishi, M. Kotera, M. Kanehisa, and S. Goto, “Drug-target interaction prediction from chemical, genomic and pharmacological data in an integrated framework,” Bioinformatics, vol. 26, no. 12, pp. i246–i254, 2010.
- Z. Xia, L.-Y. Wu, X. Zhou, and S. T. C. Wong, “Semi-supervised drug-protein interaction prediction from heterogeneous biological spaces,” BMC Systems Biology, vol. 4, supplement 2, article S6, 2010.
- M. Gönen, “Predicting drug-target interactions from chemical and genomic kernels using Bayesian matrix factorization,” Bioinformatics, vol. 28, no. 18, pp. 2304–2310, 2012.
- X. Chen, M.-X. Liu, and G.-Y. Yan, “Drug-target interaction prediction by random walk on the heterogeneous network,” Molecular BioSystems, vol. 8, no. 7, pp. 1970–1978, 2012.
- H. Chen and Z. Zhang, “A semi-supervised method for drug-target interaction prediction with consistency in networks,” PLoS ONE, vol. 8, no. 5, Article ID e62975, 2013.
- D. Fourches, E. Muratov, and A. Tropsha, “Trust, but verify: on the importance of chemical structure curation in cheminformatics and QSAR modeling research,” Journal of Chemical Information and Modeling, vol. 50, no. 7, pp. 1189–1204, 2010.
- F. Iorio, R. Bosotti, E. Scacheri et al., “Discovery of drug mode of action and drug repositioning from transcriptional responses,” Proceedings of the National Academy of Sciences of the United States of America, vol. 107, no. 33, pp. 14621–14626, 2010.
- R. L. Chang, L. Xie, P. E. Bourne, and B. Ø. Palsson, “Drug off-target effects predicted using structural analysis in the context of a metabolic network model,” PLoS Computational Biology, vol. 6, no. 9, Article ID e1000938, 2010.
- S. Suthram, J. T. Dudley, A. P. Chiang, R. Chen, T. J. Hastie, and A. J. Butte, “Network-based elucidation of human disease similarities reveals common functional modules enriched for pluripotent drug targets,” PLoS Computational Biology, vol. 6, no. 2, Article ID e1000662, 2010.
- J. T. Dudley, E. Schadt, M. Sirota, A. J. Butte, and E. Ashley, “Drug discovery in a multidimensional world: systems, patterns, and networks,” Journal of Cardiovascular Translational Research, vol. 3, no. 5, pp. 438–447, 2010.
- J. T. Dudley, T. Deshpande, and A. J. Butte, “Exploiting drug-disease relationships for computational drug repositioning,” Briefings in Bioinformatics, vol. 12, no. 4, Article ID bbr013, pp. 303–311, 2011.
- Z. Wu, Y. Wang, and L. Chen, “Network-based drug repositioning,” Molecular BioSystems, vol. 9, no. 6, pp. 1268–1281, 2013.
- A. P. Davis, C. G. Murphy, R. Johnson et al., “The comparative toxicogenomics database: update 2013,” Nucleic Acids Research, vol. 41, no. 1, pp. D1104–D1114, 2013.
- A. P. Chiang and A. J. Butte, “Systematic evaluation of drug-disease relationships to identify leads for novel drug uses,” Clinical Pharmacology and Therapeutics, vol. 86, no. 5, pp. 507–510, 2009.
- A. Gottlieb, G. Y. Stein, E. Ruppin, and R. Sharan, “PREDICT: a method for inferring novel drug indications with application to personalized medicine,” Molecular Systems Biology, vol. 7, no. 1, article 496, 2011.
- S. Zhao and S. Li, “A co-module approach for elucidating drug-disease associations and revealing their molecular basis,” Bioinformatics, vol. 28, no. 7, pp. 955–961, 2012.
- Y.-F. Huang, H.-Y. Yeh, and V.-W. Soo, “Inferring drug-disease associations from integration of chemical, genomic and phenotype data using network propagation,” BMC Medical Genomics, vol. 6, supplement 3, article S4, 2013.
- S. Daminelli, V. J. Haupt, M. Reimann, and M. Schroeder, “Drug repositioning through incomplete bi-cliques in an integrated drug-target-disease network,” Integrative Biology, vol. 4, no. 7, pp. 778–788, 2012.
- H. Ye, L. L. Yang, Z. W. Cao, K. L. Tang, and Y. X. Li, “A pathway profile-based method for drug repositioning,” Chinese Science Bulletin, vol. 57, no. 17, pp. 2106–2112, 2012.
- D. Emig, A. Ivliev, O. Pustovalova et al., “Drug target prediction and repositioning using an integrated network-based approach,” PLoS ONE, vol. 8, no. 4, Article ID e60618, 2013.
- T. Zhou, J. Ren, M. Medo, and Y.-C. Zhang, “Bipartite network projection and personal recommendation,” Physical Review E, vol. 76, no. 4, Article ID 046115, 2007.
- D. S. Wishart, C. Knox, A. C. Guo et al., “DrugBank: a knowledgebase for drugs, drug actions and drug targets,” Nucleic Acids Research, vol. 36, supplement 1, pp. D901–D906, 2008.
- A. Hamosh, A. F. Scott, J. Amberger, C. Bocchini, D. Valle, and V. A. McKusick, “Onlined Mendelian Inheritance in Man (OMIM), a knowledgebase of human genes and genetic disorders,” Nucleic Acids Research, vol. 30, no. 1, pp. 52–55, 2002.
- T. Zhoua, Z. Kuscsik, J.-G. Liu, M. Medo, J. R. Wakeling, and Y.-C. Zhang, “Solving the apparent diversity-accuracy dilemma of recommender systems,” Proceedings of the National Academy of Sciences of the United States of America, vol. 107, no. 10, pp. 4511–4515, 2010.
Copyright © 2015 Hailin Chen et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.