Integrative bayesian network analysis of genomic data.

Rapid development of genome-wide profiling technologies has made it possible to conduct integrative analysis on genomic data from multiple platforms. In this study, we develop a novel integrative Bayesian network approach to investigate the relationships between genetic and epigenetic alterations as well as how these mutations affect a patient's clinical outcome. We take a Bayesian network approach that admits a convenient decomposition of the joint distribution into local distributions. Exploiting the prior biological knowledge about regulatory mechanisms, we model each local distribution as linear regressions. This allows us to analyze multi-platform genome-wide data in a computationally efficient manner. We illustrate the performance of our approach through simulation studies. Our methods are motivated by and applied to a multi-platform glioblastoma dataset, from which we reveal several biologically relevant relationships that have been validated in the literature as well as new genes that could potentially be novel biomarkers for cancer progression.

Introduction

Cancer is a disease caused by multiple genetic mutations. To explore the underlying biological system, numerous methods based on genomic data from single platforms have been proposed. For example, methods for reverse engineering gene regulatory networks from mRNA gene expression data can successfully describe complex biological systems1–3 but are applicable to just one platform. However, cancer arises from a series of genome-wide genetic mutations (eg, DNA copy number alterations) and epigenetic mutations (eg, DNA methylation) rather than a small number of platform-specific mutations.4 Given this complexity, recovering a regulatory network from a single platform can only provide a partial view of the cancer genome. Therefore, the focus should shift from single-platform analysis to integrative analysis of data arising from multiple genomic platforms. This is feasible, in part, because of the rapid development of high-throughput genome-wide profiling technologies such as microarrays5 and array comparative genomic hybridization, aCGH.6 Thus, multi-platform data of matched tumor/patient samples are now widely available, which motivates integrative network analysis to elucidate mechanisms of cancer development and progression. Specifically, since 2006, the Cancer Genome Atlas (TCGA) research network1 has made a great effort to collect and make publicly available such data (including mRNA gene expression, DNA methylation) for over 30 types of cancer, including glioblastoma multiforme (GBM), squamous cell lung carcinoma, and ovarian serous cystadenocarcinoma, among others.

In this study, we are particularly interested in GBM as it is the most common and most lethal malignant primary brain tumor in human adults.7 Due to its aggressiveness, GBM was the first cancer profiled by TCGA. Multiple-platform genomic data were collected by TCGA, which included DNA copy number, DNA methylation, and mRNA gene expression for the same set of samples. Associated with each sample, the clinical outcome (eg, the patient’s survival time) was also recorded.

Our goal is to integrate multiple types of genetic data with the clinical outcome of interest to better understand the relationships between genetic and epigenetic alterations and also how these mutations affect a patient’s clinical outcome. Multiple integrative network approaches have been proposed in the literature. Stingo et al.8 integrated microRNA and mRNA expression data to construct microRNA regulatory networks. Cheng et al.9 presented integrative regulatory networks of transcription factors, genes, and microRNA. Zhang et al.10 integrated gene expression profiles with high-throughput protein–protein interaction data. Rhodes and Chinnaiyan11 discussed integrative network analysis of cancer transcriptome data. However, these approaches only deal with interactions between genetic and/or epigenetic mutations without studying their relationships with clinical outcome information, which is of great importance in cancer research. Recently, Wang et al.12 proposed an undirected integrative network-based analysis of two platforms (mRNA gene expression and microRNA expression) and patients’ clinical outcomes (survival times). They adopted a Gaussian graphical model approach (treating different platforms and clinical outcome as nodes) to model joint dependencies among platforms and survival times. In their case study, they found many mRNA–microRNA pairs associated with patients’ clinical outcomes, some of which are consistent with the findings in the literature. With similar motivation, we construct a method based on an integrative Bayesian network for multiple platforms. Essentially, we would like to explore the various possible (directed) relationships among platforms and clinical outcome as exemplified in Figure 1. For example, in Scenario 2, gene expression, copy number, and methylation independently affect clinical outcome; whereas in Scenario 3, copy number and methylation do not directly regulate clinical outcome. Instead, they indirectly affect clinical outcome through gene expression. Our goal is to find which regulatory mechanism is best supported by the data. One common feature between Wang et al.12 and our work is that instead of estimating a large network of all genes from single platform, we estimate a large number of networks, one for each gene, from multiple-platform genomics data. However, our method has at least three innovations that give it an advantage over the existing approaches.

Figure 1

Three scenarios considered in our simulation study.

We consider three platforms rather than two platforms. This small increase in the number of platforms leads to an exponential increase in the dimensionality of the network space, increasing the number of potential regulatory networks from 25 to 543, and thus greatly increasing the computational complexity of the problem.13

Unlike undirected graphs, a Bayesian network has the ability to detect directed relationships, which are more biologically interpretable. Moreover, the proposed Bayesian network approach is more flexible than the decomposable network approach considered in Wang et al.12 as decomposable graphs are a subset of all possible Bayesian networks. For example, in Scenario 2 of Figure 1, gene expression, copy number, and methylation are mutually (unconditionally) independent but are conditionally dependent given the clinical outcome. There are no undirected network equivalents that can capture such dependence structure.

We incorporate biological information and use a Markov equivalence property of Bayesian networks for dimension reduction, which makes it feasible to perform network-based analysis of genome-wide data.

Due to the compact factorization of a Bayesian network, we formulate it in terms of a set of linear regressions. For the purpose of learning the structure of the network, we apply a model selection technique via Bayes factors. Empirically, we demonstrate the performance of our approach in recovering the integrative network via simulation studies. Our method generally works very well in learning structures, especially in controlling the false discovery rate (FDR), as shown in the simulation study section. Finally, we apply our approach to the GBM data, integrating mRNA expression, copy number, and methylation along with survival times. While some of our findings are consistent with those reported in the literature, genes newly-identified by our approach may represent novel biomarkers that could be further confirmed by biological experiments.

Probability Model

A graphical model is a “marriage” between probability theory and graph theory14 that provides both computational convenience and useful interpretation for high-dimensional data. A Bayesian network, also known as a directed acyclic graph, is a graphical model in which all the edges are directed. Formally, a Bayesian network Γ = (ς, Ε) consists of a set ς of nodes representing random variables and a set Ε of edges representing conditional dependence between the nodes. In our application, for each gene g we define a Bayesian network Γ = (ς, Ε) with ς = {Y, G, C, M}, where Y is the clinical outcome, G is the mRNA gene expression, C is the DNA copy number, M is the DNA methylation status, and Ε ⊂ ς × ς contains the interactions between the platforms and the patients’ clinical outcomes. Given a priori ordering, say, {M, C, G, Y} (ie, the node present earlier in the ordering can affect those that appear later, but not vice versa; the next paragraph describes how we obtain the ordering), we can factorize the joint distribution into local (conditional) distributions as

where pa(·) denotes the parent set, ie, the set of nodes pointing at the given node. For example, in Scenario 1 of Figure 1, pa(G) = {C}, pa(Y) = {C, M}.

We are interested in exploring the biological relationships among these four variables using Bayesian networks on a gene-by-gene basis. There are 543 possible Bayesian networks for different edge combinations for the four nodes.13 However, from a priori biological knowledge, we exclude the possibilities that Y → G, Y → C, Y → M, G → C, and G → M; that is, clinical outcome cannot affect mRNA expression, copy number, or methylation as genomic variables are measured at baseline and the clinical outcome is measured at follow-up times; and mRNA expression cannot affect copy number and methylation since according to the central dogma of molecular biology, mRNA is produced by transcription from segments of DNA on which the copy number and methylation are measured, but the reverse processes are rare and biologically uninterpretable. As a consequence, the number of possible graphical models is reduced to 96. We notice that the direction of the edge between M and C does not affect the conditional independence assertion of the Bayesian network due to Markov equivalence. In other words, we cannot discriminate between two graphs that only differ in the direction of the edge between M and C, as the likelihood of these two graphs is identical.13 In summary, we define the following edges of interest:

Platform-outcome edges:

Between platform edges:

where I(·) is the indicator function that shows whether the given relationship is present or not. Then the model space can be represented by binary parameters . Therefore, the number of possible models is further reduced to 26 = 64, and, as a consequence, the ordering is naturally defined as {M, C, G, Y}.

Suppose we have n samples of gene expression copy number , and methylation status matched to a certain gene g. We also have clinical outcome Y = (Y1, …, Y)’ associated with each sample. Each conditional distribution in (1) is then modeled as a set of conditional normal distributions (linear models):

with binary vectors design matrices H = (G, C, M), R = (M, C), and regression coefficients . We use a binary vector as the subscript of the matrix (vector) to denote the submatrix (subvector) with columns (rows) for which the corresponding binary variable is 1. Inference on the binary vectors γg, ϕg leads to the identification of the edges of the Bayesian network for each gene and consequently to the understanding of the regulatory mechanisms related to the disease of interest.

Bayesian Inference

Prior distribution

We treat parameters as random, and place conjugate priors on all parameters for computational ease. In particular,

where IG(·,) is the inverse-Gamma distribution. And a priori we assume each model is equally likely, for i = 1, …,64. These prior distributions fall in the invariant class characterized by Geiger and Heckerman,15 implying that two independence-equivalent graphs, ie, two graphs that differ only by the direction of the edge between M and C, are assigned the same marginal likelihood.

Marginal likelihood and posterior distribution of regression coefficients

Next, we provide the marginal likelihood and marginal posterior distribution of the regression coefficients. For ease of notation, we rewrite the model generically,

with design matrix W, regression coefficients θ, and residual variance κ2. The parameters follow normal-inverse-Gamma priors,

Due to conjugacy, we can analytically integrate out parameters θ, κ2 and obtain the marginal likelihood of Z, which is given by

where I is the identity matrix with dimension n and MVT2 (·,) stands for a multivariate Student’s t distribution with degrees of freedom 2a. Likewise, we can obtain the marginal posterior distribution of θ in closed form, which is also a multivariate Student’s t distribution,

where ν* = 2a*, μ* = V*(V−1μ + W′Z) and

with V*=(V−1+W′W)−1, . Under a squared error loss, the Bayes estimator of θ is .

Model selections via Bayes factors

Our goal is to select the best Bayesian network supported by the data for each gene. To this end, we rank the 64 models according to their marginal likelihood and denote the best and the second best models by and , respectively. For model comparison, we calculate the Bayes factor for these two models

by equations (1–3). Since the distribution in (3) is in closed form, no stochastic algorithm such as a Markov chain Monte Carlo algorithm is needed in our calculation of Bayes factors. According to Jeffrey’s scale,16 if BF12 > 3, we conclude that there is substantial evidence supporting the best model, ie, is significant. Notice that since the prior distribution of the model is uniform, the posterior distribution of model is simply proportional to the marginal likelihood and is given by

We use this posterior probability to rank genes in our analysis of GBM data. Essentially, a gene ranks higher when the associated gene network has greater posterior probability. This approach yields a list of genes with regulatory networks that are clearly supported by the data. Such a list could guide biologists in screening out a large number of genes that are irrelevant to clinical outcome and allow them to focus their experiments solely on this small set of genes.

Moreover, given the posterior probability of each Bayesian network, we can easily calculate the posterior probability of edge selection. For example, the posterior probability of edge (M, Y) is given by

Simulation Study

In this section, we evaluate the performance of our proposed method with simulated examples. To mimic the GBM data analysis, which we describe in the next section, we set the sample size at n = 233 and set the regression coefficients at around the values estimated from the GBM data. We consider three scenarios (given in Figure 1). For each edge, we vary the regression coefficient in the range {−0.4, −0.2, −0.1, 0.1, 0.2, 0.4} (totaling 63 = 216 combinations), and for each combination of regression coefficients, we generate 1000 datasets.

The residual variances are set at 0.25. For the hyperparameters specification, our goal is to be objective/non-informative. Using the generic notation in computing the marginal likelihood, the hyperparameters (a, b) of inverse-Gamma are set at (0.5, 10); we adopt a standard g-prior setting for the hyper-covariance V of regression coefficient: V = g(W′W)−1 with g = n. To evaluate the performance of our model selection, we calculate the percentage of correctly selected models (PCM), the percentage of incorrectly selected models (PIM), and the percentage of non-significant models (PNM), ie, BF12 < 3. We also compute the true positive rate (TPR) and FDR, which are defined as the proportion of edges correctly selected and the proportion of incorrectly selected edges among all selected edges, respectively, ignoring whether the best model is significant or not. An edge included in the best Bayesian network is correctly selected if it is part of the true Bayesian network. The TPR and FDR show the edge-wise performance of our method without formal hypothesis testing. The TPR and FDR then quantify how much the best model deviates from the truth under very noisy data for which the best model would never pass the significance test. In addition, we define two complexity measures for illustration purposes.

Median correlation complexity measure (MCC): 1− median where | · | is the element-wise absolute value and is the upper triangular part of the sample correlation. The intuition behind this is that higher correlation renders easier detection, hence it is assigned a lower level of complexity.

Frobenius norm complexity measure (FNC): where A is the adjacency matrix of {M, C, G, Y} (eg, A12 = 1 if and only if M → C) and || · || is the Frobenius norm. We center it only for plotting ease. The intuition is that the most complex (the simplest) case is having perfect correlation between disconnected (connected) nodes while having zero correlation between connected (disconnected) nodes. Hence, the closer the correlation to the adjacency matrix, the less complex the case. Also, we use the Frobenius norm to quantify the closeness.

In Figure 2, we plot PCM, PIM, and TPR against the MCC for the three scenarios. In order to better understand the performance of the method under different levels of complexity, we use a black-and-white gradient to reflect the FNC level, with black indicating high complexity and white indicating low complexity. We do not show PNM and FDR because PNM is determined by PCM and PIM as they must sum up to one, and FDR is uniformly very close to zero, which implies that our method performs uniformly well in controlling the FDR (ie, our method does not select any spurious edges). In Table 1, we list eight combinations for different magnitude of regression coefficients in Scenario 3 (namely, all possible combinations that each regression coefficient has either small (0.1) or large (0.4) magnitude; the sign is chosen randomly). This provides a connection between the complexity measures and the regression coefficients. We refer readers who would like to explore more on the connections to full tabulated results for all scenarios in supplementary material (Tables 1–12).

Figure 2

Bayesian approach. The percentage of correctly selected models (PCM), the percentage of incorrectly selected models (PIM), and the true positive rate (TPR) are plotted against the median correlation complexity measure (MCC) for each scenario. The gradient reflects the Frobenius norm complexity measure (FNC) level.

Table 1

Simulation study. Results for eight regression coefficients settings in Scenario 3.

REGRESSION COEFFICIENTS	MCC	FNC	PCM	PIM	TPR
(−0.1, −0.1, −0.1)	0.93	1	0.02	0.27	0.54
(−0.4, −0.1, −0.1)	0.85	0.75	0.26	0.12	0.82
(0.1, 0.4, 0.1)	0.89	0.7	0.06	0.28	0.67
(0.1, 0.1, 0.4)	0.98	0.74	0.08	0.3	0.66
(0.4, 0.4, −0.1)	0.56	0.32	0.44	0.12	0.9
(−0.4, −0.1, −0.4)	0.84	0.47	0.44	0.1	0.91
(−0.1, 0.4, −0.4)	0.96	0.37	0.19	0.3	0.8
(0.4, 0.4, −0.4)	0	0.02	0.83	0.01	1

As expected, the performance of our approach improves as the complexity decreases for all the scenarios. Generally, the performances of Scenarios 1 and 2 are similar; whereas the performance of Scenario 3 is a bit worse than those of the other two, especially in the extreme case where the PCM of Scenario 3 goes to zero while the PCMs of Scenarios 1 and 2 are always well above zero. Although the PCM drops very low when the complexity increases, the edge-wise TPR is still quite satisfactory. For example, for Scenario 2, even in the extremely complex cases, the TPR is still around 0.75 (or equivalently, the false negative rate = 1−TPR = 0.25), despite the PCM dropping down to around 0.15.

Generally, our approach shows good performance in recovering networks between platforms and patients’ outcomes. Particularly, we have very good control of the FDR throughout the scenarios. Although in the situation where the signal is very weak (ie, the magnitude of the coefficient is very small) the graph-wise performance is not ideal, the edge-wise performance is still quite reasonable. We also show a three-dimensional plot for Scenario 1 with each coordinate being one regression coefficient in Figure 3. Large dot size indicates lower PCM and darker color shows lower TPR. As the regression coefficients get farther away from zero, the performance gets better.

Figure 3

Simulation study. 3D plot for Scenario 1 with each coordinate being one regression coefficient in Figure 3. Large dot size indicates lower percentage of correctly selected models (PCM) and darker color shows lower true positive rate (TPR).

To test the robustness of our approach, we conduct a sensitivity analysis on the hyperparameters (a, b) of the inverse-Gamma prior and the hyperparameter g of the g-prior. We summarize the results for Scenario 1 in Table 2. The edge-wise performance is very robust to different hyperparameter settings while the graph-wise performance shows a reasonable trade-off between PCM and PIM as the hyperparameters vary. That is, higher PCM usually associates with higher PIM. In general, we would not recommend setting b higher than 50 and g too away from sample size n.

Table 2

Sensitivity analysis (Scenario 1).

HYPERPARAMETERS			PCM	PIM	TPR	FDR
a = 0.5	b = 10	g = n	0.73	0.27	0.92	0.01
a = 0.5	b = 1	g = n	0.50	0.09	0.92	0.01
a = 0.5	b = 5	g = n	0.49	0.10	0.91	0.01
a = 0.5	b = 20	g = n	0.46	0.12	0.90	0.01
a = 0.5	b = 50	g = n	0.34	0.19	0.86	0.01
a = 0.5	b = 10	g = 50	0.40	0.03	0.94	0.02
a = 0.5	b = 10	g = n/2	0.46	0.07	0.92	0.01
a = 0.5	b = 10	g = 2n	0.48	0.15	0.89	0.01
a = 0.1	b = 10	g = n	0.48	0.10	0.91	0.01
a = 0.25	b = 10	g = n	0.48	0.10	0.91	0.01
a = 1	b = 10	g = n	0.50	0.10	0.91	0.01
a = 5	b = 10	g = n	0.49	0.10	0.91	0.01

We develop a frequentist analog of our Bayesian method for comparison. Specifically, while keeping the model formulation unchanged, we rank models by Bayesian information criterion (BIC) instead of marginal likelihood and test the significance of the best model via a non-nested frequentist hypothesis testing procedure instead of Bayes factor. However, this approach is “ad-hoc”: when the best model is nested in the second best model, since the smaller model has to be always on the null hypothesis, we claim that the best model is significant if we fail to reject the alternative. In other words, we “accept the null hypothesis”. Bayes factor, on the contrary, naturally evaluates evidence in favor of the null hypothesis. While in general the frequentist analog produces results comparable to our Bayesian approach (as shown in Figure 4): the frequentist approach generally has slightly higher error rate (PIM) along with higher PCM. This shows that our Bayesian methods strike the right balance between model selection and error rates, in fully probabilistic modeling framework. Besides, the performance of the frequentist analog also depends on the criterion (AIC, BIC, R2, and so on) that we choose to rank the model.

Figure 4

Frequentist approach. The percentage of correctly selected models (PCM), the percentage of incorrectly selected models (PIM), and the true positive rate (TPR) are plotted against the median correlation complexity measure (MCC) for each scenario. The gradient reflects the Frobenius norm complexity measure (FNC) level.

GBM Data Analysis

From the TCGA GBM dataset, we extract 233 samples of mRNA gene expression G, copy number C, and methylation M. Originally, there were 12,042 genes for mRNA expression data. After removing duplicate genes and matching them with copy number and methylation data, we analyze the data from three platforms on the same set of 9,412 genes. Many genes have duplicates within the copy number and methylation data. We perform principal component analysis (PCA) on duplicate genes and project them onto the leading eigen vectors, which explains most of the variability. We also have a matched survival time (T, Δ) for each tumor sample, where T denotes the observed survival time and binary variable Δ denotes the censoring indicator. For a censored survival time, we impute the survival time by calculating the mean residual life using a Kaplan–Meier estimate

for i = 1,2, …, 233 with

where is the Kaplan–Meier estimate of the survival function. Then we perform log-transformation on both the observed and imputed survival times. All the data are scaled to have mean 0 and standard deviation 1. We apply model (2) to each gene. To summarize the results, we focus on networks for which the corresponding genes are relevant to the clinical outcome, ie, having at least one edge between {M, C, G} and Y. Moreover, we further divide the networks into four categories that have different biological interpretations:

Epigenomic networks: methylation directly affects the clinical outcome, but copy number does not directly affect the clinical outcome;

Genomic (copy number) networks: the copy number directly affects the clinical outcome, but methylation does not directly affect the clinical outcome;

Transcriptomic networks: only gene expression directly affects the clinical outcome;

multi-platform networks: both methylation and copy number directly affect the clinical outcome.

We rank networks by their posterior probability (4) for each category. In Figure 5, we show the top four significant models for epigenomic, genomic, and transcriptomic networks. Blue arrows represent positive relationships, while red arrows represent negative ones. Since the direction of the edge between M and C cannot be determined, we use a bi-directed edge to represent this connection. Bi-directed edges can be interpreted in either direction. The posterior probability of each network is given at the top of each network, along with the corresponding gene/probe symbol. In addition, next to each arrow present in the network, we also provide its posterior probability. We do not have a plot for the complex networks because we found only two models, neither of which was significant, and their posterior probabilities were very low. Complementary to Figure 5, we list all the genes with significant epigenomic, genomic, or transcriptomic networks in Table 3. We use boldface to indicate positive regulations between corresponding platforms and clinical outcome, and present the posterior probability of the network within parentheses. There are 23 genes with epigenomic networks, 31 genes with genomic networks, and 7 genes with transcriptomic networks, totaling 61 genes.

Figure 5

Glioblastoma multiforme (GBM) data analysis. Top four networks for epigenomic, genomic, and transcriptomic networks. They are ranked based on the posterior probability which is shown at the top of each network, along with the corresponding gene/probe symbol.

Notes: Blue arrows are activations. Red arrows are inhibitions. Bi-directed edges can be interpreted in either direction. Next to each arrow is the posterior probability of the corresponding arrow.

Table 3

Glioblastoma multiforme (GBM) data analysis. A list of genes that have epigenomic, genomic, and transcriptomic regulatory effects on clinical outcome. Bold genes positively affect clinical outcome, while the rest negatively affect clinical outcome. The gene names appear in the order of posterior probability (from high to low), with the posterior probability of the network in parentheses. Only genes whose network is significant are shown.

	GENES/PROBES
Epigenomic	GRM6(0.71), ELF4(0.70), SPON2(0.65), CUTL2(0.59), NUP155(0.59), STEAP1(0.58),
	POLR3C(0.57), BBS5(0.56), RGN(0.55), KCNA2(0.55), WNT2(0.54), AGPAT2(0.52), BGN(0.52),
	ADCY8(0.51), SLC2 A2(0.50), SV2B(0.50), C11orf2(0.50), RARRES2(0.49), SORBS3(0.48),
	FMNL1(0.47), EIF5A2(0.47), UPK3 A(0.44), PDE1B(0.44)
Genomic	MAP3K7(0.74), TSPYL4(0.68), HMGN3(0.68), CDKN2C(0.67), CASP8AP2(0.65), ORC3 L(0.65),
	CFDP1(0.64), CCL22(0.62), DOPEY1(0.62), OGFOD1(0.60), ZCCHC14(0.59), FOLR1(0.58),
	GNS(0.56), CGA(0.56), RBM35B(0.56), CNGB1(0.55), ME1(0.54), UBE2 J1(0.53), NUDT21(0.52),
	WBSCR16(0.52), CTCF(0.51), PIGL(0.50), DST(0.50), SLC12 A3(0.50), CCL17(0.50),
	PLCG2(0.49), CDH11(0.48), EPHA7(0.43), GNAO1(0.42), EIF4A1(0.39), LAMA4(0.35)
Transcriptomic	MAN2 A2(0.73), ZNF80(0.65), ZDHHC11(0.60), RPL13(0.53), HPGD(0.53), CLDN5(0.52), SFI1(0.51)

Some of our findings are consistent with the existing literature. For example, in our study, we find that gene CDKN2C (shown in Figure 5), also known as p18 or INK4C, is directly related to the survival time of a patient with GBM. In particular, the copy number of CDKN2C is positively correlated with the patient’s survival time, which implies that a deletion of CDKN2 A may drive the pathogenesis of GBM and hence may be a tumor suppressor gene, which was experimentally confirmed by the copy number analysis of CDKN2A in GBM.17,18 Furthermore, the methylation of SPON2 and down-regulation of TSPYL4 and RPL13 identified by our study were also found in previous work.19–21 Genes that have not been validated in the current biomedical literature may represent novel biomarkers for GBM and may require further functional validation eg, via knockout experiments. Moreover, several studies have identified frequent chromosomal copy number aberrations in GBM such as chromosome 6 deletion, chromosome 7 amplification, and chromosome 10 deletions.22–24 Our study confirms that chromosome 6 has significantly large number of copy number aberrations (as compared to random chance) as shown in Figure 6 (P-value 1.95 × 10−10, binomial test with H0: P = 1/32 vs H: P > 1/32). In addition, we also observe a statistically significant number (P-value 1.13 × 10−11) of copy number aberrations in chromosome 16, which have not been reported previously in the GBM literature. Given the extremely unlikely event of such occurrences (as evidenced by the P-values), we feel chromosome 16 could be an important chromosome in the GBM context that can be used for future functional validation studies.

Figure 6

Glioblastoma multiforme (GBM) data analysis. The number of biomarkers vs the chromosome number. Colors correspond to different networks.

Conclusion

In this study, we proposed an integrative Bayesian network approach to jointly analyze multiple-platform genomic data and patients’ clinical outcomes. We used a known biological mechanism and Markov equivalence to reduce the network space, and conducted model selection via Bayes factor to recover the network structure. We exploited the conjugacy of the priors for exact computation, which makes genome-wide network analysis feasible. Our simulation studies demonstrated that our approach is capable of detecting significant networks. Applying our method to the whole GBM genome identified several genes consistent with the existing literature, as well as novel genes that need to be experimentally validated. Although a benchmark dataset would be helpful to evaluate the performance of our approach, to the best of our knowledge, we are not aware of any genome-wide dynamic CRN dataset, as large scale of knockout experiments would be required to create such dataset. In fact, if some dependencies are a priori suspected to be more relevant, they can be easily incorporated into our prior distributions as previously done by Peterson et al.25 and Baladandayuthapani et al.26

We have seen that an increase in the number of platforms from two to three leads to a great increase in the dimension of the model space, from 25 to 543. Indeed, the dimension of the model space increases super-exponentially with increases in the number of platforms. Manually ruling out models that are inconsistent with known biological mechanisms or are Markov equivalent to each other requires much more information and effort. Therefore, as constructed, our method of integrative analysis will become prohibitive beyond the analysis of three platforms. In some situations, it might be interesting to consider interactions among genes as well as other molecular features. Our models can be generalized in principle to accommodate these dependencies. Specifically, the second conditional distribution in model (2) can be modified as to account for gene–gene interactions in the level of mRNA gene expression where G[−] is the gene expression levels of genes other than gene g and ψ is the corresponding regression coefficients. However, this approach may result in a more computationally demanding procedure, given the very large number of the combinatorial pairs of genes. We plan to address these issues in future work. The software used to perform the analyses has been posted on the authors’ webpage (http://odin.mdacc.tmc.edu/∼vbaladan/Veera_Home_Page/Software_files/code-zip).

Supplementary Tables 1–12. In This Supplementary File, We Tabulate The Simulation Results For All combinations of regression coefficients in Tables 1–12.