- Methodology article
- Open Access
Detecting recurrent gene mutation in interaction network context using multi-scale graph diffusion
BMC Bioinformatics volume 14, Article number: 29 (2013)
Delineating the molecular drivers of cancer, i.e. determining cancer genes and the pathways which they deregulate, is an important challenge in cancer research. In this study, we aim to identify pathways of frequently mutated genes by exploiting their network neighborhood encoded in the protein-protein interaction network. To this end, we introduce a multi-scale diffusion kernel and apply it to a large collection of murine retroviral insertional mutagenesis data. The diffusion strength plays the role of scale parameter, determining the size of the network neighborhood that is taken into account. As a result, in addition to detecting genes with frequent mutations in their genomic vicinity, we find genes that harbor frequent mutations in their interaction network context.
We identify densely connected components of known and putatively novel cancer genes and demonstrate that they are strongly enriched for cancer related pathways across the diffusion scales. Moreover, the mutations in the clusters exhibit a significant pattern of mutual exclusion, supporting the conjecture that such genes are functionally linked. Using multi-scale diffusion kernel, various infrequently mutated genes are found to harbor significant numbers of mutations in their interaction network neighborhood. Many of them are well-known cancer genes.
The results demonstrate the importance of defining recurrent mutations while taking into account the interaction network context. Importantly, the putative cancer genes and networks detected in this study are found to be significant at different diffusion scales, confirming the necessity of a multi-scale analysis.
Cancer is a complex genetic disease, caused by a multistep process in which several collaborating mutations allow a cell to evade the checkpoints that normally safeguard it against DNA damage and other disruptions of healthy cell growth [1-3]. Among all human genes more than 1% are implicated in cancer by somatic or germline mutations . This implies that hundreds of genes may contribute to tumor formation. This percentage is expected to increase since cancer genome sequencing of human tumors  and forward genetics screens in model organisms [6-8] are providing evidence for thousands more . Arguably, cancer genes are thus better considered as contributing to cancer rather than causal for cancer , as their effect is dependent on many other genetic aberrations.
One of the major challenges in cancer research is to determine all genes that contribute to the disease as well as delineate the pathways through which these genes exert their malicious effects on a cellular process. A potent way of discovering genes driving carcinogenesis is to perform forward genetic screens in animal models such as retroviral or transposon insertional mutagenesis (IM). Retroviral insertional mutagenesis (RIM) is based on integration of a retrovirus into the host cell’s genome, mutating the host cell’s DNA in the process. Putative cancer genes in the RIM datasets are determined by searching for genes in the vicinity of genomic regions that harbor recurrent mutations across multiple independent tumors [6, 7, 11]. Such regions in the genome are called Common Insertion Sites (CIS). Statistical significance of CIS can be determined by means of permutation strategies .
A major problem in this approach is that, assuming realistic sample sizes, not all cancer-associated genes harbor sufficient mutations in multiple tumors to be called significant. This is because mutations in the vicinity of different genes can exert the same deleterious effect on the same pathway . This explains that mutations of different genes represent alternative routes to the acquisition of the same cancer hallmark [13, 14]. A compelling example is given by the Rb pathway. Mutations in four genes RB1, CDKN2A, CDK4, and CCND1 can be considered equivalent because their effect on controlling transition to replication phase is similar . On the other hand, acquisitions of some cancer hallmarks require mutations of multiple genes. Examples of this include the frequently observed co-mutation of RAS and TP53. Co-mutated genes can thus be considered to collaborate in carcinogenesis .
An important implication of this fact is that the definition of a recurrent gene mutation, defined as a gene that harbors frequent mutations in its genomic vicinity in more tumors than expected by chance, is no longer appropriate. Instead, recurrent mutations should be defined at the scale of a pathway, rather than the scale of a single gene.
A straightforward approach would be to regard mutations affecting different genes in the same pathway as recurrent by a summarization across pathways defined in databases such as KEGG  and using enrichment statistics such as GSEA . Here, we argue against such an approach for the following reasons. First, such approaches consider a pathway as a group of genes, and thus, disregard any topological information in the gene interaction network that describes a pathway. Edge weights, capturing confidence in a certain relation, are also not taken into account. Most importantly, however, gene sets that are defined based on a pathway represent only one of many scales at which this pathway can be defined. In reality, mutations may target very specific components of a pathway (i.e. small-scale), whereas in other cases summarization across a collection of functionally similar pathways (i.e. large-scale) may be justified.
When a pathway is defined at a scale which is too small, mutations are split across different distinct pathways. As a result, mutations are only recurrent across a relatively small number of tumors. This implies loss of power to detect relevant mutation patterns. On the other hand, when a pathway is defined at a scale which is too large, many irrelevant genes are considered that do not harbor mutation. This also implies reduced power to detect recurrence. Since it is a priori unknown at which scale it is most appropriate to summarize mutations and define a pattern of recurrent mutation, a multi-scale approach that evaluates pathway descriptions of different scales is required.
For this reason, we propose to consider gene mutations in the context of its pathway neighborhood as encoded in a functional protein-protein interaction (PPI) network . This network describes a variety of gene and protein interactions (including experimentally verified physical interactions, co-expressed genes, interactions mined from literature, known pathway interactions, interactions predicted from protein homology, etc.). Importantly, this offers the possibility to obtain a more continuous definition of the size of the pathway neighborhood, or, in other words, a less discrete definition of the scale at which the interaction network context is considered. Using a multi-scale diffusion kernel  (detailed in the Methods section), this scale can be varied across a range of values. This enables analysis of the mutations in interaction contexts of different scale, ranging from small-scale signaling cascades to large-scale molecular pathways.
The PPI network has been successfully used to define subnetworks with predictive value for patient prognosis from gene expression data [21-26]. Other approaches use PPI information to identify subnetworks with frequent mutations, since these may point to commonly mutated pathways [27, 28]. In both cases, a scoring function is optimized to identify high-scoring subnetworks. However, these types of optimizations are NP-hard and therefore require heuristic strategies that are computationally expensive [25-27].
Here, we propose a different approach, based on diffusion kernel, to determine genes recurrently mutated in interaction context (ReMIC genes). ReMIC genes are detected when the gene itself or the interaction network neighborhood of the gene harbors more mutations than expected by chance (Figure 1). The amount of diffusion determines the scale of the network neighborhood that will be taken into account. A permutation analysis is employed to determine the significance of a ReMIC gene within the context of its network neighborhood at a particular scale. By varying this scale across a range of values, ReMIC genes that arise as a result of mutations in small, well-connected subnetworks (small-scale) as well as those that arise as a result of mutations in large pathway components (large-scale) can be identified.
The proposed approach establishes significance estimates per gene, mitigating the need of excessive correction for multiple testing that arises when testing many networks of different sizes. It also requires no prior assumptions on the size of subnetworks. However, the major benefit is that our method explicitly takes care of the scale at which a subnetwork is considered.
In the following, we outline the proposed methodology and show results on a large collection of viral mutation data from two large RIM screens [6, 11]. In particular, we show that different networks of recurrent mutations arise at different scales. Many genes that do not harbor sufficient mutations to be called significant in a genome-based analysis are identified using the proposed approach. A significant portion of these genes are well-known cancer genes. In addition, we determine densely connected subnetworks of the significant genes which are highly enriched for cancer related pathways at different diffusion strength. These clusters also show significant patterns of mutual exclusion, indicating a functional relation between the mutated genes.
Retroviral insertional mutation data is acquired from Mutapedia (available on http://mutapedia.nki.nl). In total, the dataset contains 19 997 viral insertions in 933 tumors that have been produced in mice with various genetic backgrounds . All insertions in this dataset are mapped to Ensembl genes by employing a flat-top Gaussian scoring function (Figure 1B). This scoring function is uniform within a gene and has Gaussian tails outside the gene. The width (standard deviation) of the Gaussian is chosen to be 25kb, based on observations made in de Jong et al.. Insertions further than 50kb from the gene start or gene termination site are not associated to that gene. In this way, we obtain a (t × g) mutation matrix M where t is the number of tumors in the study, g is the number of genes in the PPI network and M ij indicates the mutation score of gene j in tumor i. The mutation score vector S capturs the insertion frequency in the vicinity of each gene and is computed as: (Figure 1).
Interaction graph construction
A PPI graph is obtained from STRING . The combined scores are used as interaction weights between proteins. To associate proteins in the PPI network to their corresponding genes, Ensembl gene IDs are mapped to protein IDs. In case of multiple proteins mapping to the same gene, interaction weights are collapsed into a single gene-to-gene interaction weight by averaging. We retain reliable interactions by removing all links with a weight below threshold T I . As a result, we obtain an undirected and weighted interaction network N = (G, I, S, W), where G denotes a set of nodes representing the genes, I denotes a set of edges representing interaction edges between proteins associated with the Ensembl genes, vector S denotes mutation scores per gene, and weight matrix W denotes the interaction weights between the genes.
To represent the interaction network context of a gene, it is desirable to obtain a global similarity metric that captures the local topology of the network connecting two genes. To this end, we use the diffusion kernel approach proposed by Kondor and Lafferty .
The diffusion kernel of a weighted interaction graph N is described by:
where eβL denotes the matrix exponential and the β >= 0 is the diffusion parameter that controls the extent of diffusion (i.e. the scale). Matrix L is equivalent to the Laplacian matrix of the weighted graph N, and is defined by:
The Laplacian matrix L thus represents the graph topology of graph N, while the diffusion kernel K β provides a smooth global similarity measure on N.
The diffusion parameter β plays an important role as it controls the extent of the diffusion. For β equal to 0, there is no diffusion (i.e. K0 = I) while for β approaching infinity the diffusion reaches equilibrium where all (connected) nodes receive the same diffusion contribution. Diffusion Diffusion kernel matrices are created for a range of β values. Finally, each diffusion kernel matrix is applied to the gene mutation score vector, to obtain diffused mutation scores, by calculating S K β .
Significance estimates, establishing whether a gene’s diffusion score is higher than expected by chance, are calculated on a per gene and per scale basis by permutation analysis. To this end, we randomize the association between genes and mutations by permuting the mutation scores in each tumor independently and recalculating the overall mutation score vector S. The diffusion kernel at a particular scale is then applied to the randomized S. This procedure is repeated 107 times, resulting in a null-distribution per gene from which an empirical p-value (including pseudocount) can be calculated.
To reduce the computational burden, we precompute 105 random score vectors S and store these in vector Srnd. In every permutation iteration, g scores are randomly selected from Srnd. Moreover, the permutation procedure for a gene is discontinued when more than 10 permuted diffused scores exceed its non-permuted diffused score. As a result, the permutation procedure is procedure is carried out for fewer genes, reducing the computational burden considerably. Correction for multiple testing is achieved by using the method of Storey and Tibshirani to calculate a false discovery rate (FDR) per gene . The p-values are adjusted by considering the number of genes in the PPI network as well as the number of scales at which the diffusion kernel is employed. Genes exceeding the α-level are called ReMIC genes. The source code is available in Additional file 1.
In this study, we divide subnetworks of significant genes into densely connected subgroups by applying the Girvan-Newman graph clustering method that uses a natural division of the graph into clusters based on the strength of connections between the nodes . In this algorithm, a betweenness score of an edge is computed based on the number of shortest paths that flow through that edge. A high betweenness score means that this particular edge connects clusters with densely connected nodes. A dendrogram is constructed by gradually removing the edges with the highest betweenness score. The root of the dendrogram represents the original network and the leaves are individual genes (Additional file 2: Figure S6-S11). For each division of the network into clusters a modularity measure is calculated which indicates the fraction of edges in the network that connect nodes in the same clusters. The dendrogram is cut at the point where the maximum modularity is achieved.
To calculate a modularity measure for a particular division of the network with n clusters a symmetric (n × n) matrix E is defined. The matrix entry E ij is the fraction of all edges in the network that connect nodes in cluster i to nodes in cluster j. The trace of E (T E ) indicates the fraction of edges in the network that link nodes in the same cluster. Accordingly, a high value of T E demonstrates a good division of the network into densely connected clusters. However, T E itself yields no information about the structure of clusters, since, for example, a single cluster consisting of all nodes results in a maximal value of T E while it is not a good division of the network. For this reason the trace of E - ∥E2∥ is used as a modularity measure where ∥E2∥ indicates the sum of the entries of the matrix E2. This modularity measure is the fraction of the edges in the network that link nodes in the same cluster minus the expected value of the same quantity for randomized network (in which edges are distributed at random without considering the structure of clusters). A modularity measure equal to zero means that the number of within-cluster edges is not better than random connections. A good division of densely connected clusters results in a modularity measure close to one. The modularity measure is calculated for each division of the network and the best cut-level of the dendrogram is determined based on the maximum modularity. In this work, we use Cytoscape plugin  GLay community structure analysis that implements the Girvan-Newman algorithm .
KEGG pathway enrichment
In order to get a general idea of the function of ReMIC gene clusters, KOBAS  is applied to calculate KEGG pathway enrichments. More specifically, we use KOBAS to determine overlap of a ReMIC gene cluster with all known pathways in the KEGG database . For each pathway that occurs in the input gene set, KOBAS counts the total number of input genes that are involved in the pathway. It also counts the total number of genes in the background gene set (all genes in the interaction network) that are involved in the same pathway. A p-value of the pathway enrichment is calculated using the Fisher exact test with Benjamini FDR correction to adjust for multiple testing.
Mutual exclusivity analysis
To determine whether the genes in a subnetwork exhibit more than random mutual exclusion of mutations (i.e. mutations in different genes of the subnetwork tend not to co-occur within the same tumor), we employ the mutual exclusivity module (MEMo) approach . The mutation matrix M is considered as the adjacency matrix of a graph where M gt > 0, represents an edge connecting gene g to tumor t. The switching permutation technique is applied to generate 104 random mutation matrices .
In the switching permutation method, a randomized mutation matrix is generated from the original mutation matrix M while the overall adjacency distribution between genes and tumors is preserved. To do this, two edges are randomly selected between gene g1 and tumor t1(g1, t1) and gene g2 and tumor t2(g2, t2). If these edges appear in the adjacency graph of M (i.e. and are non-zero entries) the ends of the are non-zero entries) the ends of the edges are swapped to give (g1, t2) and (g2, t1). This exchange is only allowed if it generates no duplicate edges between a gene and a tumor. The process is repeated for k×q iterations where k is the total number of edges in the adjacency graph of M and q is a constant number. It has been empirically shown that q = 100 is adequate for many networks .
The resulting random mutation matrices are then used to calculate an empirical p-value for a gene cluster. The p-values are calculated as the fraction of permutations that lead to a greater or equal number of mutations than those observed in M. Genes within significant clusters (with α-level of 0.05) are considered to be more mutually exclusive than expected by chance.
Results and discussion
Identifying Genes Recurrently Mutated in Interaction Context (ReMIC)
We apply our method to the obtained interaction graph (N) as described in the Methods section. This graph contains reliable interaction links with scores more than the median value of the combined scores of all interactions (T I = 500). This is a trade-off between high-confidence interactions (score > 700) and low-confidence interactions (score < 400) . The resulting interaction graph N with edge weights W, contains 14 842 nodes and 448 472 edges. The mutation scores S are computed as described in the Methods section for all genes present in the interaction network.
The diffusion kernel is applied to the complete PPI graph N for a range of scales by varying β in the range [0, 0.03]. A permutation procedure is performed to obtain p-values for each gene and each scale separately. Genes recurrently mutated in their interaction context (ReMIC genes) are defined as nodes that are significant at an α-level of 0.001 (Additional file 3). ReMIC genes are presented within the context of their original protein-protein interactions. The resulting ReMIC network is clustered using Girvan-Newman clustering technique (Additional file 2: Figure S6-S11). The resulting clusters are called ReMIC gene clusters.
ReMIC genes are organized in connected components
Inspection of the significant genes at the various diffusion scales reveals that the vast majority of them are organized in connected components. This demonstrates that, even though the significance estimates are performed on a per gene bases, the diffusion process captures groups of significant genes that are connected in the PPI network.
For β equal to 0 there is no diffusion. Hence, all significant genes at this scale harbor sufficient mutations to be called significant irrespective of their protein interaction context. Indeed, the collection of significant genes at this scale represents the known CIS network, since virtually all of these genes have been previously discovered in the analysis of the original screen using traditional CIS analysis . A substantial fraction of them are known tumor suppressors or oncogenes such as Gfi1, Notch1 and Myc. Figure 2A shows these CISs and the protein-protein interactions between them.
When the scale is increased, genes gradually diffuse their scores across the network. High scoring nodes that are connected to many low scoring nodes diffuse their score rapidly, whereas low scoring nodes with few connections diffuse their score more slowly. As a result, genes with relatively low (pink) or zero (white) mutation score are more included at higher scales as demonstrated in Figure 2B for three specific diffusion scale levels (β) representing small-, medium- and large-scale. Therefore, while CIS genes have high initial scores, the ReMIC genes arise as a result of mutations in their network neighborhood rather than in their genomic vicinity alone. It should be noted that the CIS genes do contribute to the significance of ReMIC genes by virtue of score diffusion through the local graph topology.
ReMIC gene clusters strongly enriched for cancer related pathways
A striking observation from the ReMIC gene clusters across the scales is that, in addition to some small clusters, two major gene clusters are apparent (indicated in Figure 2B). It is apparent that these clusters gradually increase size as the scale parameter increases. In the following, we refer to these clusters as the Runx- and Pik3-cluster.
To examine if one scale is more relevant than other scales, we investigate KEGG pathway enrichments of the genes in the Runx- and Pik3-cluster across different scales (Additional file 4). The results of this analysis are presented in Figure 2C, and show that both clusters are highly enriched for the general pathways in cancer category. It furthermore shows that the enrichment becomes more pronounced when the scale is increased and the minimum p-value is attained at different scales for each cluster. The highest enrichments occur at the small-scale for the Runx-cluster (Figure 3A) and the large-scale for the Pik3-cluster (Figure 3B). Similar observations can be made for leukemia pathways (dashed lines in Figure 2C). Notably, overlaps between the insertional mutations in mouse lymphomas and copy number variation in human acute myeloid leukemia and SNPs in human chronic myeloid leukemia have been observed previously .
In addition to the Runx- and Pik3-cluster, the Gfi-cluster is apparent at the medium-scale. This cluster includes important cancer related genes such as Gfi1, Myb and Nocht1 (Figure 3C). The Gfi-cluster is enriched for pathways in cancer category (p-value = 0.06) and chronic myeloid leukemia pathway (p-value = 0.04). Interestingly, this cluster is exclusively apparent at the medium-scale.
Next, for the Runx- and Pik3-cluster, we select the scales for which the minimum p-value is attained and determined enrichments in other KEGG pathways. Table 1 summarizes the results by showing the p-value and rank of the most enriched pathways. Although most prominent cancer related pathways are enriched for both clusters, the top-ranked pathways are notably different. Taken together, these results clearly illustrate the benefit of multi-scale analysis when determining ReMIC gene clusters.
ReMIC gene clusters exhibit a pattern of mutual exclusive mutation
A hallmark of cancer is that mutations of many different genes can lead to alteration of the same pathway. Moreover, once the proliferative advantaged is conferred, additional mutations in the deregulated pathway are less likely to occur. Mutually exclusive mutations, therefore, provide evidence that the altered genes are functionally linked in a common biological pathway . To test this conjecture, we employ the test for mutual exclusion presented in the MEMo algorithm . To this end, the MEMo permutation procedure is applied to identify whether the clustered ReMIC genes exhibit a pattern of mutual exclusion that extends beyond one expected by chance. The results are shown at Figure 2D for the Runx- and Pik3-cluster across the scales.
From these results it follows that both clusters exhibit a significant pattern of mutual exclusion (p<0.05). It is particularly striking that the strongest significance levels for both clusters arise at different scales. For ReMIC genes within the Runx-cluster, mutual exclusion is strongest at the small diffusion scale (Additional file 2: Figure S4), whereas for the Pik3-cluster this occurs at the large-scale (Additional file 2: Figure S5). These scales coincide with the scales of maximum functional enrichment (Figure 2D). These results illustrate the importance of a multi-scale definition of the pathway context in which mutations occur.
ReMIC clusters include many non-CIS genes
For all ReMIC clusters with β > 0 it is apparent that they contain genes that harbored no or only few mutations (indicated by white or pink nodes in Figure 2B). Therefore, these genes would not have been discovered in a traditional CIS analysis.
Many of the white ReMIC genes are also known and prominent cancer genes. Examples include Ctnnb1, Jun, Bcr and Src, which are detected across all the scales. Other cancer genes are exclusively detected at larger scales, such as Smad4 and Ntrk1 in the Pik3-cluster. These genes harbor no mutations in the RIM dataset and are thus undetectable unless the interaction context is taken into account.
Also, many pink ReMIC genes represent well-characterized cancer genes. A prominent example is the Rbl1 gene in the Runx-cluster. Rbl1 is a tumor-suppressor gene found to be dysfunctional in many human tumors including leukemia . Other examples include Raf1 and Ptk2 in the Pik3-cluster . In our data, these genes are hit in only few tumors, and hence, mutation scores are insufficient to reach significance thresholds.
The question arises whether pink ReMIC genes are selected simply because they are part of the network neighborhood of important cancer genes (i.e. the CIS genes) or, more interestingly, that they are selected due to the combination of local graph topology and distribution of mutations across this topology.
To examine this hypothesis, we compare the pink ReMIC genes from the Runx- and Pik3-cluster with sets of genes that are not significant in our analysis but that are connected to one of the high-scoring genes in the same cluster. For both groups of genes, that both harbor few mutations, enrichments in the two leukemia pathways and pathways in cancer are determined. The results are summarized in Table 2. From these results it follows that pink ReMIC genes from both clusters rank higher in the enrichment test for two out of three tested relevant pathways. This is especially apparent for the larger Pik3-cluster, for which substantially lower p-values are obtained for enrichment in the two leukemia pathways. We therefore conclude that the local network topology plays an important role in determining whether genes are involved in deregulating a pathway.
ReMIC genes co-localize in leukemia pathways
The overlaps between retroviral mutations in mouse lymphomas and human myeloid leukemia have been previously observed . Therefore, most of the selected CIS genes are implicated in leukemia pathways. To identify whether the white and pink ReMIC genes are also part of these pathways we superimpose non-CIS ReMIC genes that are detected in the Runx- and Pik3-cluster at the scales for which the strongest KEGG enrichments are observed and the acute myeloid leukemia KEGG pathway. ReMIC genes are labeled according to their appearance in either the Runx- (red) or Pik3-cluster (blue) cluster (with circle size indicating the number of ReMIC genes within each KEGG meta-node). The result is illustrated for the acute myeloid leukemia pathway in Figure 4 (similar observations can be made for the chronic myeloid leukemia pathway, shown in the Additional file 2: Figure S1).
This reveals that a clear co-localization of the ReMIC genes in a confined part of the pathway is found. It is particularly striking that non-CIS ReMIC genes from the Pik3-cluster all co-localize in the top left of this KEGG pathway (blue circles in Figure 4). These genes play important roles in the ErbB and Mtor signaling pathways, among others. The non-CIS ReMIC genes in the Runx-cluster, on the other hand, co-localize in the bottom right. Similar observations are made in case CIS genes (red ReMIC genes) are included (shown in the Additional file 2: Figure S2 and S3).
Consequently, although this KEGG pathway is enriched for ReMIC genes, mutations appear to be clustered in clear mutation hot-spots of the pathway. Moreover, the ReMIC gene clusters comprise many other genes that are part of other pathways or not present in any of the pathways. This demonstrates the importance of a multi-scale approach that is based on protein-protein interactions as opposed to restricting the search for recurrent mutations to single genes (CIS analysis) or enrichment of whole discretely defined pathways.
Recently, several methods in computational cancer biology have been developed to identify significantly mutated pathways using biological networks such as a PPI graph [21, 24-27]. The main strategy of these approaches is to search for high-scoring subnetworks in terms of a specific scoring function. Due to the fact that such problems are NP-hard, greedy and heuristic approaches are employed [25-27]. In this study, we propose a graph diffusion framework to overcome this difficulty.
The multi-scale graph diffusion is applied to detect recurrent gene mutation in the context of the functional protein-protein interaction network. Using graph diffusion, it is possible to capture the local topology of the interaction network and diffuse gene mutation scores across the interaction graph. The diffusion strength acts as a scale parameter, determining the size of the network neighborhood across which recurrence is detected. Recurrently mutated genes in interaction context (ReMIC genes) are identified by permutation analysis per gene and scale. This reduces the computational complexity of examining the virtually limitless number of possible subnetworks within the complete PPI network.
We apply this method to discover recurrent gene mutations in a large collection of viral mutation data. We demonstrate that significant genes (called ReMIC genes) are organized in connected components even though the significance estimates are performed on a per gene bases. These clusters of ReMIC genes are apparent across multiple diffusion scales. In addition to some small clusters, two major gene clusters are apparent: the Runx- and Pik3-cluster. We demonstrate that these clusters are strongly enriched for cancer related pathways. Moreover, genes within these clusters are significantly mutually exclusive at particular diffusion scales, supporting their functional relation in tumorigenesis. Many ReMIC genes harbor no or infrequent mutations such as Ctnnb1, Bcr, Src and are, therefore, not detectable in an ordinary CIS analysis. Literature provides substantial evidence for their roles in cancer, particularly in leukemia, illustrating the efficacy of identifying cancer genes in the context of their functional interaction network.
Graph diffusion has been explored previously to identify subnetworks harboring frequent mutations in a method called HotNet . One of the most important differences with our method is the way in which the significance estimates are calculated. In HotNet, an approximate solution for the connected maximum coverage problem is adopted to find significant mutated subnetworks. This solution is heuristic and computationally expensive since a myriad of subnetworks of different sizes need to be evaluated. Importantly, in order for this to become computationally tractable, white nodes need to be removed and are thereby excluded from appearing in the resulting subnetworks. In our method, on the other hand, the whole PPI network is considered.
HotNet furthermore requires the user to predefine the size of the subnetworks that it will find. Our approach, on the other hand, mitigates the need of making prior assumptions on the size of the ReMIC gene clusters. As a case in point, we analyze our insertional mutagenesis data with the HotNet algorithm and demonstrate that, at a particular diffusion scale, our method outperforms HotNet to detect distinct subnetworks that are related to known cancer pathways (see Additional file 2: Supplemental text).
Most importantly, however, we show that for different scale levels different functional enrichments, mutual exclusion patterns and ReMIC genes are observed. Moreover, for certain scale levels, clusters of ReMIC genes exhibit a clear co-localization in specific hot-spots of the KEGG representation of the leukemia pathway. Taken together, this demonstrates the importance of analyzing gene mutation in the context of their interaction network in a multi-scale fashion.
Greaves M: Cancer causation: the Darwinian downside of past success? Lancet Oncol 2002,3(4):244-251. 10.1016/S1470-2045(02)00716-7
Maley CC, Galipeau PC, Li X, Sanchez CA, Paulson TG, Reid BJ: Selectively advantageous mutations and hitchhikers in neoplasms: p16 lesions are selected in Barrett’s esophagus. Cancer Res 2004,64(10):3414-327. 10.1158/0008-5472.CAN-03-3249
Nowell PC: The clonal evolution of tumor cell populations. Science 1976,194(4260):23-28. 10.1126/science.959840
Futreal PA, Coin L, Marshall M, Down T, Hubbard T, Wooster R, Rahman N, Stratton MR: A census of human cancer genes. Nat Rev Cancer 2004,4(3):177-183. 10.1038/nrc1299
Sjöblom T, Jones S, Wood L, Parsons D, Lin J, Barber T, Mandelker D, Leary R, Ptak J, Silliman N, Szabo S, Buckhaults P, Farrell C, Meeh P, Markowitz S, Willis J, Dawson D, Willson J, Gazdar A, Hartigan J, Wu L, Liu C, Parmigiani G, Park B, Bachman K, Papadopoulos N, Vogelstein B, Kinzler K, Velculescu V: The Consensus Coding Sequences of Human Breast and Colorectal Cancers. Science 2006,314(5797):268-274. 10.1126/science.1133427
Uren A, Kool J, Berns A, van Lohuizen M: Retroviral insertional mutagenesis: past, present and future. Oncogene 2005, 24: 7656-7672. 10.1038/sj.onc.1209043
Mikkers H, Nawijn M, Allen J, Brouwers C, Verhoeven E, Jonkers J, Berns A: Mice deficient for all PIM kinases display reduced body size and impaired responses to hematopoietic growth factors. Mol Cell Biol 2004, 24: 6104-6115. 10.1128/MCB.24.13.6104-6115.2004
Akagi K, Suzuki T, Stephens R, Jenkins N, Copeland N: RTCGD: retroviral tagged cancer gene database. Nucleic Acids Res 2004, 32: D523-D527. 10.1093/nar/gkh013
Erkeland S, Verhaak R, Valk P, Delwel R, Löwenberg B, Touw I: Significance of murine retroviral mutagenesis foridentification of disease genes in human acute myeloid leukemia. Cancer Res 2006, 66: 622-626. 10.1158/0008-5472.CAN-05-2908
Vogelstein B, Kinzler KW: Cancer genes and the pathways they control. Nat Med 2004,10(8):789-799. 10.1038/nm1087
Kool J, Berns A: High-throughput insertional mutagenesis screens in mice to identify oncogenic networks. Nature Rev Cancer 2009,9(6):389-399.
de Ridder J, Uren A, Kool J, Reinders M, Wessels L: Detecting statistically significant common insertion sites in retroviral insertional mutagenesis screens. PLoS Comput Biol 2006,2(12):e166. 10.1371/journal.pcbi.0020166
Hanahan D, Weinberg RA: The hallmarks of cancer. Cell 2000, 100: 57-70. 10.1016/S0092-8674(00)81683-9
Hanahan D, Weinberg RA: Hallmarks of cancer: the next generation. Cell 2011,144(5):646-674. 10.1016/j.cell.2011.02.013
Pan ZZ, Wan DS, Chen G, Li LR, Lu ZH, Huang BJ: Co-mutation of p53, K-ras genes and accumulation of p53 protein and its correlation to clinicopathological features in rectal cancer. World J Gastroenterol 2004,10(24):3688-3690.
de Ridder J, Kool J, Uren A, Bot J, Wessels L, Reinders M: Co-occurrence analysis of insertional mutagenesis data reveals cooperating oncogenes. Bioinformatics 2007,23(13):i133-i141. 10.1093/bioinformatics/btm202
Kanehisa M, Araki M, Goto S, Hattori M, Hirakawa M, Itoh M, Katayama T, Kawashima S, Okuda S, Tokimatsu T, Yamanishi Y: KEGG for linking genomes to life and the environment. Nucleic Acids Res 2008,36(Database issue):D480-D484.
Subramanian A, Tamayo P, Mootha VK, Mukherjee S, Ebert BL, Gillette MA, Paulovich A, Pomeroy SL, Golub TR, Lander ES, Mesirov JP: Gene set enrichment analysis: a knowledge-based approach for interpreting genome-wide expression profiles. Proc Natl Acad Sci U S A 2005,102(43):15545-15550. 10.1073/pnas.0506580102
Jensen LJ, Kuhn M, Stark M, Chaffron S, Creevey C, Muller J, Doerks T, Julien P, Roth A, Simonovic M, Bork P, von Mering C: STRING 8-a global view on proteins and their functional interactions in 630 organisms. Nucleic Acids Res 2009,37(Database issue):D412-D416.
Kondor R, Lafferty J: Diffusion kernels on graphs and other discrete input spaces. Proceedings of the the Nineteenth International Conference on Machine Learning ICML: 8-12 July 2002; Sydney 2002, 315-322.
Babaei S, van den Akker E, de Ridder J, Reinders M: Integrating protein family sequence similarities with gene expression to find signature gene networks in breast cancer metastasis. Pattern Recognit Bioinform, Lecture Notes in Computer Science 2011, 7036: 247-259. 10.1007/978-3-642-24855-9_22
Chuang HY, Lee E, Liu YT, Lee D, Ideker T: Network-based classification of breast cancer metastasis. Mol Syst Biol 2007, 3: 140.
Nitsch D, Gonçalves J, Ojeda F, de Moor B, Moreau Y: Candidate gene prioritization by network analysis of differential expression using machine learning approaches. BMC Bioinformatics 2010,11(1):460. 10.1186/1471-2105-11-460
Dittrich M, Klau G, Rosenwald A, Dandekar T, Müller T: Identifying functional modules in protein-protein interaction networks: an integrated exact approach. Bioinformatics 2008, 24: i223-i231. 10.1093/bioinformatics/btn161
Ideker T, Ozier O, Schwikowski B, Siegel A: Discovering regulatory and signaling circuits in molecular interaction networks. Bioinformatics 2002, 18: S233-S240. 10.1093/bioinformatics/18.suppl_1.S233
Ulitsky I, Krishnamurthy A, Karp R, Shamir R: DEGAS: De Novo discovery of Dysregulated pathways in human diseases. PLoS ONE 2010,5(10):e13367. 10.1371/journal.pone.0013367
Vandin F, Upfal E, Raphael B: Algorithms for detecting significantly mutated pathways in cancer. J Comput Biol 2011,18(3):507-522. 10.1089/cmb.2010.0265
Chen J, Li J, Stadler W, Lussier Y: Protein-network modeling of prostate cancer gene signatures reveals essential pathways in disease recurrence. J Am Med Inform Assoc 2011, 18: 392-402. 10.1136/amiajnl-2011-000178
de Jong J, de Ridder J, van der Weyden L, Sun N, van Uitert M, Berns A, van Lohuizen M, Jonkers J, Adams D, Wessels L: Computational identification of insertional mutagenesis targets for cancer gene discovery. Nucleic Acids Res 2011,39(14):e105.
Storey J, Tibshirani R: Statistical significance for genomewide studies. PNAS 2003,100(16):9440-9445. 10.1073/pnas.1530509100
Newman M, Girvan M: Finding and evaluating community structure in networks. Phys Rev 2004,69(2):026113.
Smoot M, Ono K, Ruscheinski J, Wang P, Ideker T: Cytoscape 2.8: new features for data integration and network visualization. Bioinformatics 2011,27(3):431-432. 10.1093/bioinformatics/btq675
Su G, Kuchinsky A, Morris J, States D, Meng F: GLay: community structure analysis of biological networks. Bioinformatics 2010,26(24):3135-3137. 10.1093/bioinformatics/btq596
Xie C, Mao X, Huang J, Ding Y, Wu J, Dong S, Kong L, Gao G, Li C, Wei L: KOBAS 2.0: a web server for annotation and identification of enriched pathways and diseases. Nucleic Acids Res 2011, 39: W316-W322. 10.1093/nar/gkr483
Ciriello G, Cerami E, Sander C, Schultz N: Mutual exclusivity analysis identifies oncogenic network modules. Genome Res 2012,22(2):398-406. 10.1101/gr.125567.111
Milo R, Kashtan N, Itzkovitz S, Newman M, Alon U: On the uniform generation of random graphs with prescribed degree sequences. eprint arXiv:cond-mat/0312028 2004.
Suzuki T, Minehata K, Akagi K, Jenkins N, Copeland N: Tumour suppressor gene identification using retroviral insertional mutagenesis in Blm-deficient mice. EMBO J 2006, 25: 3422-3431. 10.1038/sj.emboj.7601215
Rajagopalan H, Bardelli A, Lengauer C, Kinzler K, Vogelstein B, Velculescu V: Tumorigenesis: RAF/RAS oncogenes and mismatch repair status. Nature 2002,418(6901):934-934. 10.1038/418934a
This work is part of the BioRange program of the Netherlands Bioinformatics Centre (NBIC), which is supported by the Netherlands Genomics Initiative (NGI).
The authors declare that they have no competing interests.
SB implemented the methodologies and analysed the data. MH contributed to design of the diffusion framework. MR and JdR conceived the experiments and mentored the project. JdR and SB wrote the manuscript with contributions from MR. All authors revised, discussed, and amended the manuscript and approved its final version.
Electronic supplementary material
Additional file 2:Supplementary text. A PDF file containing the supplemental figures and text. It includes a figure of the ReMIC genes superimposed on the leukemia KEGG pathways, results of the analysis of the insertional mutagenesis data with the HotNet algorithm, dendrograms extracted by the graph clustering technique as well as figures of the mutation profiles of the ReMIC genes. (PDF 3 MB)
Authors’ original submitted files for images
Below are the links to the authors’ original submitted files for images.
About this article
Cite this article
Babaei, S., Hulsman, M., Reinders, M. et al. Detecting recurrent gene mutation in interaction network context using multi-scale graph diffusion. BMC Bioinformatics 14, 29 (2013). https://doi.org/10.1186/1471-2105-14-29
- Mutual Exclusion
- Diffusion Kernel
- Network Neighborhood
- Diffusion Scale
- Mutation Score