Complex biological systems usually pose a trade-off between robustness and fragility where a small number of perturbations can substantially disrupt the system. Although biological systems are robust against changes in many external and internal conditions, even a single mutation can perturb the system substantially, giving rise to a pathophenotype. Recent advances in identifying and analyzing the sequential variations beneath human disorders help to comprehend a systemic view of the mechanisms underlying various disease phenotypes. Network-based disease-gene prioritization methods rank the relevance of genes in a disease under the hypothesis that genes whose proteins interact with each other tend to exhibit similar phenotypes. In this study, we have tested the robustness of several network-based disease-gene prioritization methods with respect to the perturbations of the system using various disease phenotypes from the Online Mendelian Inheritance in Man database. These perturbations have been introduced either in the protein-protein interaction network or in the set of known disease-gene associations. As the network-based disease-gene prioritization methods are based on the connectivity between known disease-gene associations, we have further used these methods to categorize the pathophenotypes with respect to the recoverability of hidden disease-genes. Our results have suggested that, in general, disease-genes are connected through multiple paths in the human interactome. Moreover, even when these paths are disturbed, network-based prioritization can reveal hidden disease-gene associations in some pathophenotypes such as breast cancer, cardiomyopathy, diabetes, leukemia, parkinson disease and obesity to a greater extend compared to the rest of the pathophenotypes tested in this study. Gene Ontology (GO) analysis highlighted the role of functional diversity for such diseases.
Citation: Guney E, Oliva B (2014) Analysis of the Robustness of Network-Based Disease-Gene Prioritization Methods Reveals Redundancy in the Human Interactome and Functional Diversity of Disease-Genes. PLoS ONE 9(4): e94686. https://doi.org/10.1371/journal.pone.0094686
Editor: Vince Grolmusz, Mathematical Institute, Hungary
Received: February 13, 2014; Accepted: March 13, 2014; Published: April 14, 2014
Copyright: © 2014 Guney, Oliva. This is an open-access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited.
Funding: Spanish Ministry of Science and Innovation (MICINN) FEDER BIO2011-22568 (http://www.mineco.gob.es/portal/site/mineco/); and by EU grant EraSysbio+ (SHIPREC http://www.erasysbio.net/index.php?index=279) Euroinvestigación (EUI2009-04018). The funders had no role in study design, data collection and analysis, decision to publish, or preparation of the manuscript.
Competing interests: The authors have declared that no competing interests exist.
A fundamental characteristic of biological systems is tolerance to noise. The ability to counteract both internal mechanistic failures and changes in environmental conditions plays a central role in the survival of the organism. The main components of robustness are controlling the system through negative and positive feedback , splitting the parts of the system as functional units  (modularity and decoupling), and phenotypic plasticity  (typically achieved by redundancy). In a biological system, groups of genes are optimized in functional decoupling, redundancy and diversity such that the effects of perturbations are minimized . However, complex biological systems have to balance between robustness and fragility which implies that a small number of rare perturbations can substantially disrupt the system . In particular, some mutations are the main cause of diseases by exploiting the fragility of the biological system.
During the past decade, genome-wide efforts such as linkage analysis and association studies have successfully associated numerous causal loci with human disorders . Still, much effort needs to be taken to fully understand the complex implications on the whole system. For this purpose, several methods have been developed recently to amplify available disease-gene associations using the principle of “guilt-by-association” through underlying biomolecular networks. These methods typically exploit relationships of the disease causing genes with other candidate genes, using the neighborhood of known associations in the physical ,  or functional  interaction network. Recent methods extend the definition of the neighborhood to account for the global topology of the underlying network (network-based disease-gene prioritization) , . Such global topology based methods have been showed to improve disease-gene association prediction –.
Following the emergence of high-throughput experimental techniques that produce large amount of biological data, several studies have investigated robustness of a complex system in respect to the underlying network topology. Different types of networks have been studied with this purpose, such as metabolic networks , protein-protein interaction networks ,  and regulatory interaction networks . However, to our knowledge, robustness of network-based disease-gene prioritization methods, where the underlying network itself is perturbed, has not been extensively investigated. Due to the fact that network-based disease-gene prioritization methods use the connectivity between genes associated with the disease, we hypothesize that they may serve to distinguish diseases with respect to the predictability of causative genes via examining the behavior of network-based prioritization under noisy network models. The definition of robustness is problem specific  and here we define the robustness as the observed change in the prediction capacity of the prioritization methods when perturbing the underlying network.
In this work, our main goal has been to test the quality and robustness of several network-based disease-gene prioritization methods against perturbations introduced either in the underlying network or to known disease-gene associations. Next, to look into the relationship between robustness, functional diversity and modularity, we have examined the capability of these methods to identify disease modules (groups of genes that are enriched with the functions relevant to the disease). Through the analysis of the prediction performance of the network-based prioritization method under in silico perturbations and adopting a jackknifing scheme, we have categorized various disease-phenotypes (pathophenotypes) in Online Mendelian Inheritance in Man (OMIM) database  based on the level of recovery of the hidden disease-gene associations. Our results suggest that hidden disease-gene associations in several pathophenotypes, particularly the ones with high prevalence such as breast cancer and diabetes, can be recovered easier than the rest of the compared pathophenotypes, even when the underlying network is substantially perturbed. We have found that this was independent of the number of initial genes associated with the disease and rather mediated by the diversity of functions deduced by them. These findings provide evidence on the role of functional diversity in defining robustness of biological systems.
Results and Discussion
Network-based prioritization is sensitive to known disease-gene associations
Network-based disease gene prioritization methods rank the relevance of genes to a disease using known disease-gene associations (seeds) and the network topology. Any perturbation in the network topology or seeds induces a change on the ranking of the genes for the disease in concern. Systematically introducing perturbations at different levels and analyzing the changes in the ranking of the disease-genes provide a way to measure the robustness of the prioritization (see Figure 1 for an overview of the perturbations applied in this study). In order to assess the tolerance of a prioritization method to the noise in the underlying network or in the known disease-genes we used the jackknifing technique. This is a blind test in which we hid the disease-gene association of some seeds and we used the remaining seeds and a prioritization method to predict genes associated with the disease. Then, we checked whether the hidden seeds were predicted accurately by the prioritization. We tested five prioritization algorithms: NetShort, NetZcore and NetScore, three algorithms we have recently proposed that use global network topology ; and two existing algorithms, Functional Flow  and PageRank with priors . The human protein-protein interaction (PPI) network (referred simply as network hereafter, unless otherwise stated) was obtained by integrating protein-protein interactions from several publicly available repositories. The network consisted of 11250 nodes (gene products) and 59220 edges (physical interactions) connecting them. We analyzed 19 disease phenotypes that were compiled among the human disorders in OMIM . The phenotypes were created by merging disorders in OMIM using keywords describing the phenotype (see Methods and Table S1).
(A) Original network, (B) seed swapping, (C) interaction rewiring, (D) interaction removal. N(p,k) represents the kth instance of the network with a perturbation level of p in a random ensemble of networks for a given perturbation type (see Methods).
We first questioned the robustness of the prioritization methods by means of testing the quality of the genes associated with a disorder. To address the dependence on the number of seeds, we replaced the seeds with non-seeds in the network at varying percentages (10% to 80%). That is, we disturbed the initial disease-gene associations at different levels by introducing wrong associations between genes and pathophenotypes. Then we calculated the area under Receiver Operating Characteristic (ROC) curve of network-based prioritization methods using a five-fold cross-validation setting on the perturbed disease-gene annotations. An increased percentage of mis-annotated seeds reduced the reliability of predictions for all methods (Figure 2a). If more than 70% of seeds were false, the area under ROC curve (AUC) reduced to less than 50% for all methods. Only NetShort resulted in an AUC higher than 50% when using 40% false seeds. In conclusion, all methods were dependent on the quality of the initial associations, but NetShort was less affected, compared to the rest, in predicting new genes associated with the disease. In order to ensure that this was not an artifact of the network, we repeated the analysis on the network used by Goh et al. . This network contained a set of high confident protein-protein interactions in human (we refer to this network as Goh network hereafter, see Methods). The AUCs for the methods at different perturbation percentages using Goh network are given in Figure S1a and confirmed our observation.
The interactions of the bPPI network were perturbed (A) by swapping the links in order to make false interactions or (B) by removing links. Plots show the average AUC and 95% confidence intervals calculated for the prediction of gene-disease associations for 19 diseases using NetScore (red), NetZcore (yellow), NetShort (green), Functional Flow (blue), and ToppGene (purple). The percentage of interactions swapped or removed varied between 0 and 80%. (C) Dependence on the number and quality of seeds. The average AUCs are given as the percentage of mis-annotated seeds goes from 0% to 80%.
In silico analysis highlights the existence of alternative routes connecting disease-genes
To examine the effect of the quality of the interactions in prioritization, we randomly swapped the edges of the network. Also, to observe the relevance of the number of interactions, we randomly deleted edges of the network. The variation in the edges of the network ranged between 10% and 80%. We applied the prioritization methods to these perturbed networks and calculated the average AUC over all diseases as before. Figure 2b shows the decrease in AUC produced using false interactions (randomly swapped edges) for all methods. It is noteworthy that PageRank was the most robust method, the prediction performance of which was less affected from the perturbation of edges than the rest. On the other hand, edge deletion decreased the AUC for NetScore, Functional Flow and PageRank, but NetZcore and NetShort improved the prediction quality by increasing the AUC, and it only began to drop after more than 60% of the interactions were removed (Figure 2c). Repeating the same analysis with the Goh network revealed that the prioritization approaches exhibited a similar behavior (Figures S1b and S1c), indicating that these features were independent of the underlying network. Although this behavior was unexpected, it could be explained by the way the prioritization algorithms work . These algorithms used the seed nodes to disseminate information through the network. For each disease, there were very few number of seeds compared to non-seeds in the network (varying in the range of 0.1–0.9% of all nodes, see Table S1). Therefore, random deletion of edges disconnected fewer seeds because the number of edges connecting a seed (either one seed with another seed or one seed with a non-seed) was much less than the number of edges connecting two non-seeds (only <2% of all edges involve a seed, see Table S2). Consequently, Functional Flow and NetScore were more affected than others because of their dependence on the number of paths that connected seeds with each other (Functional Flow simulates flow of information through links of the network and NetScore exploits multiple shortest paths connecting seeds). However, the effect of deletion diminished in the case of NetZcore since it normalized the score using random networks. Considering that disease-genes tend to be highly connected to each other, the scores of the nodes connected with seeds and thus the prioritization of the hidden disease-genes was improved. To understand this with an example, let's take a node u that is relatively more connected to seeds in comparison to any of the random networks. The random deletion of an edge would be more likely to remove a link connecting at least one non-seed. Hence, it would be more likely that node u would remain relatively more connected to seeds in comparison to random networks. NetShort, which accounted for the number of seeds involved in a path to identify shortest paths leading to seeds, also improved the quality of the predictions, due to the seeds being connected by alternative routes unaffected by the deletion of links (see Table S3 for the number of all shortest paths between pairs of seeds in each pathophenotype). Such backup circuits constitute a fail-safe mechanism and explain the resilient nature of cells .
In order to gain an insight on the consequences of the changes in the network and explain the behavior of the prioritization algorithms independent of the jackknifing test described above, we focused on Alzheimer's Disease (AD), a relatively well studied pathophenotype for which we had an expert curated set of disease-gene associations . We analyzed the connectedness of the genes associated with the AD in the perturbed networks introduced above. We used the genes associated with AD in OMIM  as seeds (AD-seeds). We took the neighbors of seeds in the network and checked how many of their neighbors are implicated in AD using an independent set of genes taken from literature (AD-related genes) . We repeated this procedure on perturbed networks, interactions of which were either randomly swapped (permuted) or deleted (pruned) at different percentages (see Methods). Figure 3 shows the total number of genes and AD-related genes in the neighborhood of seeds. Not surprisingly, as the percentage of perturbation increased, the number of AD-related genes in the neighborhood of AD-seeds decreased. However, in the case of interaction pruning, the ratio of AD-related genes versus the total number of genes in the neighborhood of AD-seeds increased. This suggested that AD-related genes tended to remain connected with at least one AD-seed in the network. To confirm that this behavior was arising from the AD phenotype and not an artifact of the perturbations in the network, we checked the expected number of genes that would be covered at each perturbation level using 100 random sets of genes with sizes equal to the set of AD-related genes. The ratio of random gene sets covered in the neighborhood was substantially lower compared to the observed ratio of coverage of AD-related genes (Figure 3).
The interactions of bPPI network were perturbed (A) by swapping the links in order to make false interactions or (B) by removing interactions. The percentage of interactions swapped or removed varied between 0 and 80%. The bars correspond to the average number of genes over perturbed networks (except the first bar in which the number of genes in the original network are given) whereas the line shows the ratio of the number of AD-related genes in the neighborhood of AD-seeds to the number of all genes in the neighborhood in the perturbed networks.
Discovery of disease-genes under noisy network models varies among pathophenotypes
The analysis of the prediction performance caused by perturbations showed that disease-gene associations could still be discovered using network-based prioritization methods even when half of the interactions were perturbed (see Figures 2b and 2c). We questioned whether the emergence of such network-centric robustness of the prioritization methods depended on the pathophenotype. For this purpose, we defined, “prioritization tolerance” of a disease as the amount of perturbations required to cause a “critical” AUC change when we applied a network-based prioritization approach to predict its associated genes (see Methods for details). Among the different approaches to prioritize candidate genes we used NetScore for this analysis, since it had good overall prediction accuracy (Figure 2) and produced the smallest number of clusters coherently enriched in the functions associated with the corresponding disease (see Supplementary Results in Text S1 and Figure S2). Note that NetZcore had also similar properties, however the perturbation analysis above shoved that NetZcore was robust against perturbations whereas the AUC for NetScore fell down linearly as the percentage of perturbations increased (Figure 2). In order to minimize the bias on the prediction performance due to using a robust prioritization method and focus on the network-centric tolerance of the disease, we selected NetScore over NetZcore.
We grouped diseases into two categories based on the differences of the prioritization performance (assessed by the AUC) between the original network and perturbed networks using NetScore. For each pathophenotype, we checked the amount of perturbation (both for edge swapping and removal) required in the network that caused the prioritization performance fall below the critical AUC (table 1). If after perturbing more than 50% of the interactions, the prioritization of a disease still achieved a performance higher than the critical AUC, we labeled this disease as bearing high tolerance (referred as “tolerant” hereafter) in prioritization. On the other hand, if the critical AUC was reached with perturbations affecting less than 50% of the interactions in the network, we labeled the disease as bearing low tolerance (referred as “non-tolerant” hereafter). See Figure S3 for the changes in the NetScore prioritization AUC upon perturbations in the network for tolerant and non-tolerant diseases. According to our criteria, pathophenotypes such as breast cancer, cardiomyopathy, diabetes, leukemia, obesity and parkinson disease were tolerant and thus higher capability of adaptation against perturbations in the underlying network than the rest of the pathophenotypes. Tolerant pathophenotypes have been extensively studied and might have a larger number of known disease-gene associations than the rest. Therefore, it may be argued that this is the cause to be classified as tolerant diseases under our criterion. However, in the following section we show that this is not true.
Comparison between pathophenotypes implies a role for functional diversity in determining prioritization tolerance
We checked whether the diseases in different categories bore similar properties: 1) in terms of known disease annotations associated with disease (seeds); 2) in terms of connectivity of these seeds; and 3) in terms of functions enriched among these seeds. In principle, it is reasonable to think that the prioritization tolerance might depend on the number of seeds of the phenotype. This would also suggest an explanation to the fact that diseases of high prevalence were categorized as tolerant, simply because they were more studied. Tolerant diseases had slightly higher number of seeds, nevertheless, there was not a significant difference between the number of seeds of tolerant and non-tolerant diseases (Figure 4a, associated p-value with the two-sided Wilcoxon rank sum test, p = 0.27). In order to make sure that number of seeds has no significant effect on the categorization, we took the diseases with less than 50 seeds in each category and confirmed that tolerant diseases (with less than 50 seeds) still had higher AUC values on average compared to non-tolerant diseases (with less than 50 seeds) upon perturbations (one-sided p-values were 5.5e-3 and 0.04 for interaction swapping and deletion respectively). In our previous study , we had shown that the prediction performance of network-based disease-gene prioritization methods was inversely correlated with the average shortest path length between seeds of a phenotype. Nevertheless, seeds of tolerant pathophenotypes were not distinguished significantly from the rest with respect to the average length of shortest paths between seeds (Figure 4b, p = 0.13). We have to note that the average length of shortest paths connecting two seeds is independent of the number of seeds. We also investigated the difference between the number of shortest paths connecting seeds (normalized by the number of seeds per pathophenotype) among two groups of diseases and found not significant discrepancy (p = 0.15). No significant difference between the number of interaction partners (degrees) of the seeds of tolerant and non-tolerant diseases were observed either (p = 0.24).
With respect to (A) known disease annotations associated with disease, (B) the connectivity of these seeds (assessed by the average shortest path length between seeds), (C) the ratio of the number of seed GO terms to the number of seeds associated with the diseases, and (D) the number of GO terms enriched within the high scoring subnetwork of the diseases.
Next, we looked at the functional enrichment of seeds involved in the two groups of diseases. We calculated the enrichment of GO terms of seeds (i.e., seed GO terms, see Methods for details) for both categories. In order to avoid possible bias towards the number of seeds, we normalized the number of seed GO terms dividing them by the total number of seeds for each pathophenotype. Considering that tolerant diseases had slightly more number of seeds (as mentioned above), normalizing by total number of seeds ensures that the observed number of GO terms are penalized more for tolerant diseases. Still, pathophenotypes with high prioritization tolerance contained higher ratio of seed GO terms per seed (around 3 times more than that of non-tolerant pathophenotypes), proving that a larger number of biological functions associated with seeds were involved in tolerant diseases than in pathophenotypes with low prioritization tolerance (Figure 4c, p = 3.29e-3). Likewise, on average there were almost twice as many GO terms enriched within the high scoring subnetworks (top 5% scored nodes in the network using NetScore) of tolerant diseases compared to non-tolerant diseases (Figure 4d, p = 0.03). These findings suggested that tolerant pathophenotypes tended to be functionally more diverse, being involved in a larger number of functions compared to non-tolerant phenotypes. Further analysis on the GO terms shared between pathophenotypes suggested that tolerant diseases tended to share more GO terms among themselves than non-tolerant diseases (Figure S4 and Figure S5).
Differential network analysis reveals a connected core machinery in breast cancer
Breast cancer was one of the pathophenotypes that was observed to bear high prioritization tolerance upon the analysis of network-based prioritization on the ensemble of randomly perturbed networks. To gain insights on the interactions giving rise to network-centric tolerance in breast cancer, we focused on the perturbed networks in which 80% of the interactions were randomly removed and chose among the random networks those with highest and lowest prediction accuracy when the network-based prioritization method was applied. We selected two networks in each case, two networks with AUCs of 82% and 73.9% and two networks with AUCs of 46.1% and 46.9%. Then, we checked the set of interactions yielding the difference between highest and lowest AUC. For this, we considered the interactions that were common in the two networks with highest AUC but were not among the common interactions of the two networks with lowest AUC. These interactions potentially caused that breast cancer phenotype was classified as tolerant. The network consisting of these interactions was named differential network (see Figure 5a). One key observation in this network was that the largest connected component (referred as module hereafter) of the differential network contained one third of the seed genes and this included proteins encoded by BRCA1, TP53, ESR1, AR, AKT1. This is an interesting result, because the networks from which the differential network was obtained contained only one out of five of the original interactions. Moreover, the GO terms enriched in this module covered 65.7% of all 35 seed GO terms of breast cancer (see Tables S4 and S5). Next, we checked the GO terms enriched using only non-seeds in this module. Among 312 GO terms enriched with these genes, 22 were seed GO terms yielding a highly significant enrichment of seed GO terms (p = 5.97e-7). This confirmed that the enrichment was not originated solely from the 10 seeds of the component. Figure 5b shows the seed GO terms covered by seed and non-seed genes of this module. We concluded that the observed prioritization tolerance was due to i) redundancy, being difficult to disconnect seed proteins with the random deletion of interactions and ii) functional diversity, the existence of a large connected module involving genes with the characteristic functions of the disease.
(A) The network containing interactions common to the two pruned networks with which the NetScore obtained the best prediction performance for breast cancer but did not exist among the common interactions in the worst performing two pruned networks. The red nodes are seeds. (B) The seed GO terms that are covered in the largest connected component of this differential network via using only seed genes (red) and only non-seed genes (blue) in the component.
Implications of this study and future directions
In this study, we have analyzed the robustness of several disease-gene prioritization algorithms using known gene-disease associations and protein-protein interaction networks. Our analysis on randomly perturbed interaction networks pointed to the existence of backup circuits within the PPI network constituting a fail-safe mechanism. Strikingly, the performance of the methods might tolerate up to 50% of interactions being removed, the point at which methods using alternative paths start suffering from low prediction performance. NetZcore and NetShort showed to be consistently effective in ranking genes when interactions were removed, while PageRank was more robust against the introduction of false interactions (we have to note that though it was more robust than NetShort, its overall performance was worse). Furthermore, NetShort, the method that calculated the distance to another gene in the network taking into account number of known disease-genes included in the path, yielded better prioritization performance when the known disease-gene information was noisy.
We categorized diseases with respect to their prioritization tolerance based on the performance of a network-based prioritization method under the perturbation of the network. Interestingly, pathophenotypes with high prioritization tolerance included many diseases with high prevalence in society. We further investigated whether there were characteristic differences between diseases involved in these categories. Neither the number of seeds, nor the average length of the shortest paths between them were significantly different between tolerant and non-tolerant diseases. On the other hand, the number of GO-terms enriched among seed genes (known disease-genes) per seed stood out as the most important factor in defining prioritization tolerance of a pathphenotype. That is, a disease was more likely to be tolerant to noise in the interaction network if the genes involved in that pathophenotype were functionally more diverse. Futhermore, tolerant diseases showed a higher tendency to share functions with other pathophenotypes. Such common features at the functional level might be useful for understanding the etiology of complex genetic disorders . We have presented a way of systematically assessing the prioritization tolerance of pathophenotypes emerging from the underlying protein-interaction network. Although the robustness of a disease cannot possibly be explained only by the topology of the network, intuitively the prioritization tolerance of a disease could imply its robustness. Previous studies have argued that cancer  and diabetes  are robust diseases through a holistic analysis pointing out the redundancy and feedback mechanisms in these diseases. These studies are in agreement with our results on several diseases with high prioritization tolerance such as breast cancer, diabetes and leukemia. Furthermore, in addition to functional redundancy and decoupling, two key features mediating robustness of biological systems , , functional diversity (i.e. involving multiple pathways) may be related to the robustness of diseases. On the other hand, we did not find lung and prostate cancers as bearing high prioritization tolerance. Considering the heterogeneity among different cancer types, it is not very surprising to see such differences with respect to prioritization tolerance for various types of cancer. In fact, even within a certain type of cancer, such as breast cancer, a certain level of heterogeneity is expected at the patient level. In this sense, the genes involved in the pathophenotype and the underlying PPI network might be significantly different compared to another patient –. Therefore, the major limitations of our study are the incompleteness and inaccuracy of the disease-gene associations and protein-protein interactions. Nonetheless, the developments in high throughput genomics and proteomics screening, as well as experimental and computational efforts in identifying context-specific interaction networks (e.g., tissue-specific) , , will help to build more comprehensive models explaining the plasticity of diseases.
The findings presented here may help developing novel network-medicine approaches that try to characterize the interconnected pathways implicated in diseases and possibly suggest points of action to compensate the changes induced by the disease . Functional diversity can explain why polypharmacological approaches, which typically target many gene products simultaneously via administration of multiple drugs , may work better on some diseases such as cancer –.
Genes and their associated disorders were taken from Online Mendelian Inheritance in Man (OMIM) database . OMIM is one of the most comprehensive and reliable repositories of genes with Mendelian mutations and the disorders associated with them. Phenotypic associations for genes were extracted from the OMIM Morbid Map (ftp://ftp.ncbi.nih.gov/repository/OMIM/morbidmap retrieved August 27, 2009) by searching for keyword entries associated with the disorders given in Table S1. A disorder was considered if at least 25 genes were associated with it in the Morbid Map after merging several diseases under the same keyword (e.g., for Alzheimer's disease we collected Alzheimer's disease types 1, 2, etc. using the keyword “alzheimer”). Table S1 summarizes all diseases used under the context of this study, the number of genes associated with them and number of protein products these genes encode in the PPI network. Asthma, neuropathy and spastic paraplegia also satisfied the criterion of having at least 25 genes, however they were excluded from the robustness analysis since the AUCs using the original network were lower than 50% (see below).
Genes associated with a disorder were mapped to their products (proteins) in the PPI network and assigned an initial score for their phenotypic relevance. Thus, proteins translated by genes known to be involved in a particular pathology were termed seeds and have the highest score (1.0) in the network. All other proteins in the network were assigned a non-seed score (lowest score in the network: 0.01). The correspondence between genes and their products (proteins) was determined using the data integration protocol of BIANA .
Protein–protein interaction network
We used the human PPI network presented in our recent work . The interaction network was compiled from publicly available major interaction data repositories using BIANA integration tool (Table S6). First, protein-protein interactions from different sources were integrated with BIANA  to obtain a human interactome. High throughput pull down interaction detection methods introduce many indirect relationships (such as being involved in the same complex) in addition to direct physical interactions. Thus, we removed the subset of interactions obtained by tandem affinity purification and called this network as the bPPI (binary protein-protein interaction) network. We also used the human interactome from Goh et al.  (referred to as the Goh network), which combined two high quality yeast two-hybrid experiments ,  and protein-protein interactions obtained from the literature.
Network-based prioritization of disease-genes
To assess the tolerance of a given phenotype to the noise in the underlying network or in the seeds, we used five network-based prioritization algorithms available in GUILD software package. GUILD (Genes Underlying Inheritance Linked Disorders) is a network-based disease gene prioritization framework , . The prioritization methods rank the nodes of the network according to their implication in the pathopheontype. The network-based prioritization approaches obtain this rank by disseminating the information of seeds through the network. GUILD framework provides several methods that use known disease-genes and their interactions to rank the relevance of genes in a disease or disorder. The basic hypothesis is that genes whose proteins interact with each other tend to exhibit similar features, such as function and/or phenotype. These methods require an initial set of genes associated with a particular phenotype (e.g., a Mendelian disorder) and interactions between the products of these genes. We chose three topology-based ranking algorithms: NetShort, NetZcore, and NetScore (see Supplementary Methods in Text S1 for details); and two state-of-the-art algorithms PageRank with priors  (as used in ToppNet ) and Functional Flow . PageRank with priors has recently been proven its success in network-based disease-gene prioritization , , .
To evaluate the prioritization methods, we used five-fold cross validation and calculated area under ROC curve (AUC). The AUCs were averaged over all folds. The details of the evaluation has been described elsewhere .
Dependency of prioritization methods on network features and gene associations
We evaluated the dependencies of the methods by modifying the input data using three tests: 1) permuting interactions at random, 2) randomly removing interactions of the network, and 3) permuting the seeds at random. We tested the effect of the modifications on the bPPI and Goh networks using OMIM gene-phenotype associations. The degree of modifications ranged from 10% to 80% for each network and seed set. Ensembles of 100 random networks and random seed-sets were used to assess average prediction performance for each perturbation level. For the first test, nine groups of 100 networks were generated by swapping the edges of the original network (randomly creating new edges and removing old ones), and each group contained a different number of random permutations corresponding to the 10% to 80% of the number of edges. For the second test, the edges were randomly deleted to create nine groups of 100 networks in which the number of deletions varied between 10% and 80% of the number of edges. For the third test, a varying percentage of seed nodes (10% to 80%) was replaced with non-seed nodes 100 times, yielding nine groups of seed-sets and the percentage of non-seeds in each group ranged between 10 and 80. The prioritization methods were applied to these modified data sets and for each group, the AUC was averaged over the 100 randomly modified networks or seed sets. That is, for each level of perturbation p (%), the average AUC over an ensemble of randomly perturbed networks of size n can be written as follows;where N(p,k) is kth instance of the network with a perturbation level of p in a random ensemble of networks for a given perturbation type
Functional enrichment analysis
GO terms enriched among genes corresponding to high scoring proteins in a network (top 5% nodes in the network with respect to their prioritization score) were identified using the FuncAssociate2.0  web service. Proteins in the network were mapped to the genes using the gene symbols provided by UniProt, and these symbols were fed to the web service. All genes in the network were used as the background gene list. A GO term was associated with the gene set, if and only if, the adjusted p-value associated with the term was less or equal to 0.05. Similarly, seed GO terms of pathophenotypes (or disease GO terms) were defined as the GO terms enriched among the seeds used in the prioritization method for that disease. For the comparison analysis of tolerant and non-tolerant pathophenotypes, the semantically non-redundant GO terms that belonged to biological process ontology were taken into consideration. GoSemSim R package  used to calculate the semantic similarity based on the metric proposed by Wang et al.  and semantically non-redundant GO terms were identified by removing the term that had at least 90% similarity to another term and that was closer to the root of the ontology (in case of a tie, one of the two terms was taken randomly). In the differential network analysis of breast cancer, a p-value was calculated assuming a hypergeometric distribution and using 1320 GO biological process terms enriched among all the genes in the original network as the set of all possible GO terms (all human genes were used as background in this case).
Defining network-centric tolerance of a pathophenotype
For the analysis of network-centric tolerance, we used the NetScore method of the GUILD package since 1) it had the highest prediction performance, 2) it produced clusters that are functionally more relevant to the disease compared to the rest of the prioritization methods, and 3) the method itself was not robust against perturbations (Figure 2 and Figure S2). We defined network-centric tolerance based on the amount of interaction perturbation required to cause a “critical AUC change” in network-based prioritization of a disease. For each disease, the “critical AUC change” was set as half of the AUC difference and the expected AUC that would be obtained by random predictions (i.e. 0.5). That is, for each pathophenotype, the “critical AUC change” was calculated using the following formula:and accordingly the “critical AUC” of a pathophenotype was given by:Figure S6 gives a schematic explanation of the critical AUC change. A disease phenotype was called tolerant if the amount of interaction perturbation (both interaction swapping and removal) required to cause a “critical AUC change” was lower than 50%. Similarly we called a disease phenotype non-tolerant if the amount of interaction perturbation for “critical AUC change” was higher than 50%. This can be formulated as follows:For testing the significance of differences in the distribution of values between robust and non-robust diseases we used Wilcoxon rank-sum test. Alpha values were set to 0.05. R software (http://www.r-project.org) was used to compute the statistics.
Robustness of the methods against the perturbation of the edges of the Goh network. Plot of the average AUC (shown in bars) and confidence interval (shown with error lines) calculated for the prediction of gene-disease associations by NetScore (red), NetZcore (yellow), NetShort (green), Functional Flow (blue), and PageRank (purple). The interactions of Goh network were perturbed (A) by swapping the links in order to make false interactions or (B) by removing interactions. The percentage of interactions swapped or removed varied between 0 and 80%. (C) Plot of the average AUC and confidence intervals calculated for the prediction of gene-disease associations as the percentage of mis-annotated seeds goes from 0% to 80%.
Module-based functional enrichment analysis of prioritized subnetworks. (A) Number of modules identified in the neighborhood of known disease associations (N.hood) and in high scoring subnetworks identified by NetScore (N.Score), NetZcore (N.Zcore), NetShort (N.Short), Functional Flow (F.Flow) or PageRank with priors (P.Rank) prioritization methods. (B) Percentage of seed GO terms (GO terms significantly enriched in the set of genes associated with the disease) among all GO terms significantly enriched in the identified modules.
AUC change at different levels of perturbations in the network. (A) Tolerant and (B) non-tolerant pathophenotypes. Solid lines correspond to AUC of the disease when NetScore prioritization method is applied to the interaction network whose edges are randomly swapped (averaged over all such networks) and dashes correspond to AUC of the disease when the prioritization method is applied to the interaction network whose edges are randomly deleted.
Heatmap representation of Jaccard indices calculated for every pair of pathophenotypes. We used GO terms in the high scoring (top 5%) modules identified by NetScore prioritization method. Tolerant pathophenotypes are on the top of the heatmap (green), whereas non-tolerant pathophenotypes are at the bottom (orange). No overlap is represented with gray color and the degree of overlap increases as color gets darker (from white to blue).
GO terms shared in the high scoring modules of at least 4 diseases. Tolerant pathophenotypes are on the left of the heatmap (green) and non-tolerant pathophenotypes are on the left (orange).
Schematic explanation of the critical AUC change.
The number of genes associated with the diseases used in this study and the number of gene products corresponding to these genes in the interaction networks.
The number of seed connecting and non-seed connecting edges in the interaction networks for each disease.
The number of shortest paths connecting pairs of seeds in each disease.
GO term enrichment of the genes in the largest connected component of the differential network for breast cancer.
Seed GO terms (GO terms enriched by the seed genes) for all diseases.
The interaction sources used to create the human protein-protein interaction network.
Conceived and designed the experiments: EG BO. Performed the experiments: EG. Analyzed the data: EG. Wrote the paper: EG BO.
- 1. Morohashi M, Winn AE, Borisuk MT, Bolouri H, Doyle J, et al. (2002) Robustness as a measure of plausibility in models of biochemical networks. Journal of theoretical biology 216: 19–30.
- 2. Hartwell LH, Hopfield JJ, Leibler S, Murray AW (1999) From molecular to modular cell biology. Nature 402: C47–52.
- 3. Agrawal AA (2001) Phenotypic plasticity in the interactions and evolution of species. Science 294: 321–326.
- 4. Kitano H (2004) Biological robustness. Nat Rev Genet 5: 826–837.
- 5. Carlson JM, Doyle J (2002) Complexity and robustness. Proc Natl Acad Sci U S A 99 Suppl 12538–2545.
- 6. Altshuler D, Daly MJ, Lander ES (2008) Genetic Mapping in Human Disease. Science 322: 881–888
- 7. Oti M, Snel B, Huynen MA, Brunner HG (2006) Predicting disease genes using protein-protein interactions. J Med Genet 43: 691–698.
- 8. Xu J, Li Y (2006) Discovering disease-genes by topological features in human protein-protein interaction network. Bioinformatics 22: 2800–2805.
- 9. Pujana MA, Han JD, Starita LM, Stevens KN, Tewari M, et al. (2007) Network modeling links breast cancer susceptibility and centrosome dysfunction. Nat Genet 39: 1338–1349.
- 10. Kohler S, Bauer S, Horn D, Robinson PN (2008) Walking the Interactome for Prioritization of Candidate Disease Genes. The American Journal of Human Genetics 82: 949–958
- 11. Chen J, Aronow B, Jegga A (2009) Disease candidate gene identification and prioritization using protein interaction networks. BMC bioinformatics 10: 73.
- 12. Navlakha S, Kingsford C (2010) The Power of Protein Interaction Networks for Associating Genes with Diseases. Bioinformatics 26: 1057–1063
- 13. Akula N, Baranova A, Seto D, Solka J, Nalls MA, et al. (2011) A Network-Based Approach to Prioritize Results from Genome-Wide Association Studies. PloS one 6: e24220.
- 14. Lee I, Blom UM, Wang PI, Shim JE, Marcotte EM (2011) Prioritizing candidate disease genes by network-based boosting of genome-wide association data. Genome Res 21: 1109–1121
- 15. Guney E, Oliva B (2012) Exploiting Protein-Protein Interaction Networks for Genome-Wide Disease-Gene Prioritization. PLoS ONE 7: e43557
- 16. Jeong H, Tombor B, Albert R, Oltvai ZN, Barabasi AL (2000) The large-scale organization of metabolic networks. Nature 407: 651–654.
- 17. Jeong H, Mason SP, Barabasi AL, Oltvai ZN (2001) Lethality and centrality in protein networks. Nature 411: 41–42.
- 18. Huang C-H, Fang J-F, Tsai J, Ng K-L (2006) Topological Robustness of the Protein-Protein Interaction Networks Systems Biology and Regulatory Genomics. In: Eskin E, Ideker T, Raphael B, Workman C, editors. Lecture Notes in Computer Science. Springer Berlin/Heidelberg. pp. 166–177. Available: http://dx.doi.org/10.1007/978-3-540-48540-7_14 DO - 10.1007/978-3-540-48540-7_14.
- 19. Demongeot J, Ben Amor H, Elena A, Gillois P, Noual M, et al. (2009) Robustness in regulatory interaction networks. A generic approach with applications at different levels: physiologic, metabolic and genetic. Int J Mol Sci 10: 4437–4473.
- 20. Rizk A, Batt G, Fages F, Soliman S (2009) A General Computational Method for Robustness Analysis with Applications to Synthetic Gene Networks. Bioinformatics 25: i169–i178
- 21. Amberger J, Bocchini CA, Scott AF, Hamosh A (2009) McKusick's Online Mendelian Inheritance in Man (OMIM). Nucleic Acids Res 37: D793–D796
- 22. Nabieva E, Jim K, Agarwal A, Chazelle B, Singh M (2005) Whole-proteome prediction of protein function via graph-theoretic analysis of interaction maps. Bioinformatics 21: i302–i310
- 23. Goh KI, Cusick ME, Valle D, Childs B, Vidal M, et al. (2007) The human disease network. Proc Natl Acad Sci U S A 104: 8685.
- 24. Krauthammer M, Kaufmann CA, Gilliam TC, Rzhetsky A (2004) Molecular triangulation: bridging linkage and molecular-network information for identifying candidate genes in Alzheimer's disease. Proc Natl Acad Sci U S A 101: 15148–15153.
- 25. Cotterchio M, Nadalin V, Sauer M (2002) Human breast cancer and lymphomas may share a common aetiology involving Mouse Mammary Tumour Virus (MMTV). Medical hypotheses 59: 492–494.
- 26. Kitano H (2004) Cancer as a robust system: implications for anticancer therapy. Nature Reviews Cancer 4: 227–235.
- 27. Kitano H, Oda K, Kimura T, Matsuoka Y, Csete M, et al. (2004) Metabolic syndrome and robustness tradeoffs. Diabetes 53: S6–S15.
- 28. Whitacre JM (2012) Biological robustness: paradigms, mechanisms, and systems principles. Front Gene 3: 67
- 29. Chuang H-Y, Hofree M, Ideker T (2010) A Decade of Systems Biology. Annual Review of Cell and Developmental Biology 26: 721–744
- 30. Tian T, Olson S, Whitacre JM, Harding A (2011) The origins of cancer robustness and evolvability. Integr Biol 3: 17–30
- 31. Guney E, Sanz-Pamplona R, Sierra A, Oliva B (2012) Understanding Cancer Progression Using Protein Interaction Networks. In: Azmi AS, editor. Systems Biology in Cancer Research and Drug Discovery. Springer Netherlands. pp. 167–195. Available: http://link.springer.com/chapter/10.1007/978-94-007-4819-4_7. Accessed 10 February 2014.
- 32. Ellis JD, Barrios-Rodiles M, Çolak R, Irimia M, Kim T, et al. (2012) Tissue-Specific Alternative Splicing Remodels Protein-Protein Interaction Networks. Molecular Cell 46: 884–892
- 33. Guan Y, Gorenshteyn D, Burmeister M, Wong AK, Schimenti JC, et al. (2012) Tissue-Specific Functional Networks for Prioritizing Phenotype and Disease Genes. PLoS Comput Biol 8: e1002694
- 34. Zanzoni A, Soler-Lopez M, Aloy P (2009) A network medicine approach to human disease. FEBS Letters 583: 1759–1765
- 35. Hopkins AL (2008) Network pharmacology: the next paradigm in drug discovery. Nature Chemical Biology 4: 682–690
- 36. Yang K, Bai H, Ouyang Q, Lai L, Tang C (2008) Finding multiple target optimal intervention in disease-related molecular network. Molecular Systems Biology 4.
- 37. Vazquez A (2009) Optimal drug combinations and minimal hitting sets. BMC systems biology 3: 81.
- 38. Motter AE (2010) Improved network performance via antagonism: From synthetic rescues to multi-drug combinations. BioEssays 32: 236–245
- 39. Garcia-Garcia J, Guney E, Aragues R, Planas-Iglesias J, Oliva B (2010) Biana: a software framework for compiling biological interactions and analyzing networks. BMC Bioinformatics 11: 56
- 40. Rual JF, Venkatesan K, Hao T, Hirozane-Kishikawa T, Dricot A, et al. (2005) Towards a proteome-scale map of the human protein-protein interaction network. Nature 437: 1173–1178.
- 41. Stelzl U, Worm U, Lalowski M, Haenig C, Brembeck FH, et al. (2005) A human protein-protein interaction network: a resource for annotating the proteome. Cell 122: 957–968.
- 42. Guney E, Oliva B (2011) Toward PWAS: discovering pathways associated with human disorders. BMC Bioinformatics 12: A12
- 43. White S, Smyth P (2003) Algorithms for estimating relative importance in networks. Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining. KDD '03. New York, NY, USA: ACM. pp. 266–275. Available: http://doi.acm.org/10.1145/956750.956782. Accessed 22 February 2012.
- 44. Berriz GF, Beaver JE, Cenik C, Tasan M, Roth FP (2009) Next generation software for functional trend analysis. Bioinformatics 25: 3043–3044.
- 45. Yu G, Li F, Qin Y, Bo X, Wu Y, et al. (2010) GOSemSim: an R package for measuring semantic similarity among GO terms and gene products. Bioinformatics 26: 976–978
- 46. Wang JZ, Du Z, Payattakool R, Yu PS, Chen C-F (2007) A new method to measure the semantic similarity of GO terms. Bioinformatics 23: 1274–1281