# Integrating Bayesian variable selection with Modular Response Analysis to infer biochemical network topology

- Tapesh Santra
^{1}Email author, - Walter Kolch
^{1, 2, 3}and - Boris N Kholodenko
^{1, 2}

**7**:57

**DOI: **10.1186/1752-0509-7-57

© Santra et al.; licensee BioMed Central Ltd. 2013

**Received: **23 October 2012

**Accepted: **28 June 2013

**Published: **6 July 2013

## Abstract

### Background

Recent advancements in genetics and proteomics have led to the acquisition of large quantitative data sets. However, the use of these data to reverse engineer biochemical networks has remained a challenging problem. Many methods have been proposed to infer biochemical network topologies from different types of biological data. Here, we focus on unraveling network topologies from steady state responses of biochemical networks to successive experimental perturbations.

### Results

We propose a computational algorithm which combines a deterministic network inference method termed Modular Response Analysis (MRA) and a statistical model selection algorithm called Bayesian Variable Selection, to infer functional interactions in cellular signaling pathways and gene regulatory networks. It can be used to identify interactions among individual molecules involved in a biochemical pathway or reveal how different functional modules of a biological network interact with each other to exchange information. In cases where not all network components are known, our method reveals functional interactions which are not direct but correspond to the interaction routes through unknown elements. Using computer simulated perturbation responses of signaling pathways and gene regulatory networks from the DREAM challenge, we demonstrate that the proposed method is robust against noise and scalable to large networks. We also show that our method can infer network topologies using incomplete perturbation datasets. Consequently, we have used this algorithm to explore the ERBB regulated G1/S transition pathway in certain breast cancer cells to understand the molecular mechanisms which cause these cells to become drug resistant. The algorithm successfully inferred many well characterized interactions of this pathway by analyzing experimentally obtained perturbation data. Additionally, it identified some molecular interactions which promote drug resistance in breast cancer cells.

### Conclusions

The proposed algorithm provides a robust, scalable and cost effective solution for inferring network topologies from biological data. It can potentially be applied to explore novel pathways which play important roles in life threatening disease like cancer.

### Keywords

Network inference Bayesian statistics Modular Response Analysis Signaling pathways.## Background

We are faced with a fundamental challenge of understanding how a cell’s behavior arises from protein and gene interactions. Yet, the exact map of dynamic interactions between cellular network components is largely unknown for key cellular networks. Even for perturbations confined to single network nodes, mapping the dynamic topology of protein and gene network interactions is not straightforward. In fact, a local perturbation that is initially confined to a node rapidly propagates through the entire network, causing widespread, global changes that mask direct connections between nodes. Thus, the “reverse engineering” approaches where the connection architectures are inferred from the perturbation response data are becoming increasingly appreciated. Although reverse engineering methods such as Boolean networks [1], Bayesian networks [2, 3], dynamic Bayesian networks [4, 5], multivariate regression methods [6–8], linear programming [9], genetic algorithm [10] and information theoretic [11] approaches have been applied to deduce the circuitry of signaling and gene networks, all currently developed methods have significant limitations. For instance, the Boolean network based methods are found to be formidably slow, and their performance degrades with increasing network size [12]. Bayesian network methods are unable to account for feedback regulation, a hallmark of signaling networks [2]. Information theoretic approaches do not predict the directions of interactions which are important in understanding the signal flow via biological pathways [11]. A review of the advantages and limitations of most reverse engineering methods mentioned above can be found in [13].

We previously developed a method to infer network interaction maps based on steady-state responses to systematic perturbations [14, 15]. This deterministic method, termed Modular Response Analysis (MRA) unravels the direction, strength and type of interactions between individual proteins and genes or between network modules that encompass several proteins or genes in a modular description. However, noise present in the data and a requirement to generate as many perturbation responses as there are nodes in the network constrain the practical applicability of this method [14]. Consequently, a stochastic equivalent of the MRA algorithm was developed to account for noise encountered in biological datasets [16, 17]. However, this method is associated with high computational cost and it also is unable to analyze experimental data when the number of perturbation experiments is smaller than the number of network modules. More recently, another extension of MRA was reported, where a Maximum Likelihood approach was used to infer connection coefficients from noisy perturbation data [18].

Here, we propose a computationally efficient method which integrates the theoretical framework of MRA with a Bayesian Variable Selection Algorithm to infer functional interactions in signaling and gene networks based on noisy and incomplete perturbation response data.

## Results

### Fundamentals of the inference framework

#### Motivation

In general, network interactions can be quantified by analyzing the direct effect of a small change in one node on the activity of another node, while keeping the remaining nodes unchanged to prevent the spread of the perturbation [19]. A dimensionless quantifier (*r*_{
i
j
}) of this local response is the ratio of the immediate fractional change in the activity (*x*_{
i
}) of node *i* to that of node *j*, (all other nodes remain fixed), and it is called the connection coefficient or local response coefficient [14], ${r}_{\mathit{\text{ij}}}=\frac{\partial {x}_{i}}{\partial {x}_{j}}$, provided that all other nodes *x*_{
k
},*k*≠*j* are kept constant.

*R*

_{ i j }) in node

*i*occur when the other nodes become involved in the response to the perturbed node

*j*through multiple interactions [14] and can be calculated using the following formula.

*i*before and after perturbing parameter

*p*

_{ k }respectively. Let us select node

*i*and consider an n-dimensional vector ${\mathit{r}}_{i}=({r}_{i1}\dots {r}_{\mathit{\text{in}}})$ that quantifies network connections directed to node

*i*. If parameter

*p*

_{ k }does not directly influence node

*i*the vector r

_{ i }is orthogonal to

*n*−1 vectors R

_{ k }of the global response coefficients $({R}_{1k},\dots ,{R}_{\mathit{\text{nk}}}),k\ne i$[14, 20], i.e.

Eq. 2 presents a precise solution to the problem of inferring the network topology (determined by connection coefficients *r*_{
i
j
}) from the steady-state perturbation responses [14, 16, 20]. It requires *n* independent perturbations to a network of *n* nodes since the matrix of global responses R must have rank *n*−1 to precisely determine connection coefficients ${r}_{i1},\dots ,{r}_{\mathit{\text{in}}}$ of network edges directed to each node *i*. These relationships (Eq. 2) also assume no noise in the data. Biochemical measurements are invariably subjected to biological noise and experimental errors. Therefore, a statistical approach is more suitable for estimating the connection coefficients *r*_{
i
j
} from noise corrupted global responses [16].

In a previous effort, total least square regression (TLSR) was exploited as a method for estimating the connection coefficients *r*_{
i
j
} from noisy perturbation responses [16]. When the data is noisy, it is necessary to estimate the uncertainties surrounding the estimated values of *r*_{
i
j
} to draw reliable inference about the nature of the corresponding interactions. Therefore, a Monte Carlo method for estimating the probability distributions of *r*_{
i
j
} was proposed and successfully used to find out connection coefficients for a three-level extracellular signal-regulated kinase (ERK) cascade in a subsequent study [17]. In this case, 10^{6} sets of random realizations of the perturbation responses were drawn from normal distributions with means and standard deviations equal to those of the experimentally measured values [17]. A set of connection coefficients $\mathit{r}=[{r}_{\mathit{\text{ij}}},i,j=1\dots n,i\ne j]$ was estimated from each set of perturbation responses using TLSR [17]. The values of *r*_{
i
j
} calculated in this manner were used to estimate its probability distribution [17] which provides a quantitative measure of the uncertainty surrounding its estimated values. However, this method is highly computation intensive. Additionally, the proposed TLSR method [16] requires large number of perturbation experiments (typically ≥*n* for an *n* node network) which are both time consuming and expensive. Therefore, a computationally efficient method that can infer network structures using noisy data obtained from small number of perturbations (typically <*n* for an *n* node network) is required to explore cellular networks in a cost effective manner.

#### Objective

*r*

_{ i j }. Instead, we chose to infer whether node

*j*directly influences node

*i*or not, i.e. if there is a network connection from node

*j*to

*i*. In case of the deterministic MRA (Eq. 2) [14], this is a straightforward task since, by definition,

*r*

_{ i j }≠0 represents an edge from node

*j*to node

*i*and

*r*

_{ i j }= 0 indicates that there is no edge from node

*j*to

*i*. In case of the statistical formulation of MRA [16, 17], the above objective can be achieved by performing a hypothesis test such as Z-test [21] on the distribution of

*r*

_{ i j }to determine whether the mean value of

*r*

_{ i j }is significantly different from zero. However, this requires estimating the probability distribution of

*r*

_{ i j }which is computationally expensive. To avoid the process of estimating the distributions of

*r*

_{ i j }, we modified the original MRA equation (Eq. 2) by introducing a new set of binary variables (

*A*

_{ i j }) which explicitly represent presence (

*A*

_{ i j }= 1) or absence (

*A*

_{ i j }= 0) of direct interaction between node

*i*and

*j*. Introducing these variables into Eq. 2 results in the following equation (Eq. 3), which is fully equivalent to the original MRA equation (Eq. 2),

*R*

_{ i j }), the above equality does not hold exactly. If we account for the difference between the left and right hand sides of Eq. 3 caused by measurement noise, then the above equation (Eq. 3) becomes,

Here, *∊*_{
i
k
} is the difference between the left and the right hand side of Eq. 3 and ${n}_{p}^{i}$ is the number of performed experimental perturbations which do not directly affect node *i*. Based on the above model (Eq. 4), we propose a Bayesian Variable Selection Algorithm (BVSA) that can infer the probability of node *i* being directly influenced by node *j* (i.e. *P*(*A*_{
i
j
} = 1)), without having to estimate the probability distributions of the connection coefficients (*r*_{
i
j
}). Additionally, in the new formulation, we relax the restrictions of required number of perturbation experiments (i.e., ${n}_{p}^{i}=n-1$ in case of MRA [14] and ${n}_{p}^{i}\ge n$ in case of stochastic MRA [16]) and allow the inference of network topology from virtually any number of perturbation experiments (i.e., ${n}_{p}^{i}>0$). Below, we outline the proposed Bayesian algorithm, whereas further details can be found in ‘Methods’ section and Additional file 1.

#### The proposed algorithm

*A*

_{ i j }), the strength of each interaction (the connection coefficient

*r*

_{ i j }) and the measured noisy perturbation responses (

*R*

_{ i j }) of the network components. Here, the network topology (

*A*

_{ i j }), the interaction strengths (connection coefficients

*r*

_{ i j }) and the error (

*∊*

_{ i k }) caused by measurement noise are unknown variables and can be estimated from the perturbation responses (

*R*

_{ i j }) using statistical inference algorithms. To simplify the estimation process, we first conceptually divided a network of

*n*nodes (components) into

*n*numbers of smaller subnetworks, each of which consists of a node

*i*and its potential regulators. The unknown variables corresponding to each of these subnetworks were then estimated independently using Bayesian statistics. In Bayesian statistics, it is assumed that our knowledge about the unknown variables is uncertain and the uncertainties surrounding these variables (

*A*

_{ i j },

*r*

_{ i j }and

*∊*

_{ i k }) are expressed in terms of their respective probability distributions. Prior to any experimental observation, these distributions are estimated based solely on our subjective assessments (assuming that little is known about the network topology a priori) and are referred to as prior distributions (see the ‘Methods’ section for a detailed description of the prior distributions of the unknown variables

*A*

_{ i j },

*r*

_{ i j },

*∊*

_{ i k }). The prior distributions were then updated based on experimentally observed data using the Bayes theorem (see Additional file 1 for details). The updated distributions are called posterior distributions. In this case, we are interested in the posterior distribution of the binary variables

*A*

_{ i j }(see Methods), which represents the posterior probability of the presence (

*A*

_{ i j }= 1) or absence (

*A*

_{ i j }= 0) of a direct network connection from node j to node i. However, it was not possible to analytically calculate the posterior distribution of

*A*

_{ i j }, since it involves a normalization constant which requires calculating a very large integration (see Methods). Therefore, the posterior distributions of

*A*

_{ i j }were approximated using Markov Chain Monte Carlo (MCMC) sampling (as detailed in Methods). Finally, the topology of the network was inferred by thresholding the approximate posterior distributions of

*A*

_{ i j }, i.e. if the posterior probability of

*A*

_{ i j }= 1 is higher than a threshold value (

*p*

_{ t h }), then we assumed that node

*j*directly influences node

*i*. The work flow of the proposed algorithm is graphically depicted in Figure 1 (See Methods and Additional file 1 for further details) and the source codes for a MTALAB implementation of the algorithm is provided in Additional file 2.

### Performance of the proposed algorithm for simulated and real biological networks

We studied the performance of BVSA in reconstructing both simulated and real biological networks. For simulation, we considered the Mitogen Activated Protein Kinase (MAPK) Pathway and two gene regulatory networks (GRNs) consisting of 10 and 100 genes respectively. For real biological networks we chose the ERBB signaling pathway that regulates the G1/S transition in the cell cycle of human breast cancer cells [22]. The MAPK pathway was chosen because it has many negative feedback loops which enhance robustness against perturbations [23], and its reconstruction from the steady state perturbation data poses a challenging problem. The GRNs that were chosen for this study are part of the DREAM initiative, (http://wiki.c2b2.columbia.edu/dream/index.php/Challenges, challenge 4, network 1 of size 10 and 100 categories) and are widely used for benchmarking purposes by the network inference community. The ERBB pathway was chosen due to its significance in life threatening diseases such as cancer. It has multiple feedback loops which operate via both transcriptional and non-transcriptional mechanisms and may cause resistance to anti-cancer drugs. Identifying these feedback mechanisms may provide valuable insight in developing new therapies.

The above datasets were used not only to evaluate the performance of BVSA, but also to compare its performance with many other algorithms, e.g. stochastic MRA [16, 17], Sparse Bayesian Regression algorithm (SBRA) [7] and Levenberg Marquardt optimization based maximum likelihood algorithm (LMML) [18]. In case of the in-silico GRN data, we also compared the performance of BVSA with that of the winners of the DREAM challenge. We chose the above algorithms for comparison due to the following reasons. Stochastic MRA, LMML and BVSA are three different statistical formulations of the same MRA Equations [14]. Therefore, comparing these algorithms may reveal which statistical framework is more suitable for what kind of experimental data. On the other hand, SBRA and BVSA are both Bayesian Linear Regression based algorithms with different prior assumptions and network search strategies. SBRA adopted a maximum likelihood approach [7] for inferring the most likely network, whereas BVSA implements a model averaging approach which infers ‘expected’ or average networks based on the posterior probabilities of all possible networks. Hence, comparing BVSA with SBRA may also shed light on how different prior assumptions and different approaches of search strategies may affect the results.

#### Simulation study: Mitogen Activated Protein Kinase (MAPK) Pathway

- 1.
the receptor module which consists of the interactions leading to receptor (EGFR) activation upon ligand stimulation

- 2.
the adapter module which consists of the phosphorylation of Shc and its complex formation with Grb2SOS

- 3.
the initiator module which consists of the activation and deactivation of RasGDP

- 4.
the MAP3K module which consists of the activation and deactivation of Raf

- 5.
the MAP2K module which consists of the activation and deactivation of MEK

- 6.
the MAPK module which consists of the activation and deactivation of ERK.

Only a single entity of each module serves as its output (referred to as “ communicating intermediates” in [14]) and carries the signal to the next module in the cascade. For the MAPK pathway, pRD (active EGFR), pShc-Grb2SOS complex, RasGTP, aaRaf (activated Raf), ppMEK and ppERK were considered to be the outputs of their corresponding modules.

We developed a mathematical model to simulate the responses of different modules of the MAPK pathway to a series of experimental perturbations.

##### Computational simulation of the MAPK pathway

Our mathematical model consists of a set of ordinary differential equations (ODE) which describe the biochemical reactions of the MAPK pathway (see Additional file 3 for details of the ODE model). Using this model we simulated different perturbations each affecting a single module. The receptor, adapter, initiator, MAP3K, MAP2K and MAPK modules were perturbed by knocking down EGFR, Shc, Ras, Raf, MEK and ERK genes respectively. Knockdown of a gene was simulated by reducing the expression level of its protein product, which depends on the efficiency of the knockdown. We assumed for illustration purpose that if a gene is knocked down with 80% efficiency then the expression level of its product protein is reduced to 20% of its original level. Each knockdown experiment was repeated three times with 40%, 60% and 80% knockdown efficiencies. After each perturbation, the MAPK pathway was allowed to reach a new steady state and the steady state responses of the output of each module was measured.

##### Network reconstruction from simulated response of the MAPK pathway

For network reconstruction, we calculated the global responses of each module to different perturbations using Eq. 1. These responses form the global response matrix R. The rows of this matrix represent the network modules and the columns represent the perturbations performed on the MAPK pathway. R was then row standardized, i.e. each of its row was divided by its standard deviation. The standardization was performed to ensure equal variability in the responses of each module. The standardized global response matrix was then used to reconstruct the modular network of the MAPK pathway using BVSA. Firstly, the MAPK network was conceptually divided into six subnetworks, each of which corresponds to a certain module and its potential regulators. The topology of each subnetwork (*i*) was inferred separately, by sampling from the posterior distribution (*P*(A_{
i
}|R)) of the corresponding binary variables (A_{
i
}) using five parallel Gibbs samplers. Each of these samplers produced 200 realizations (samples) of A_{
i
} in as many iterations. The convergence of these samplers are illustrated in Additional file 4: Figure S1. We rejected 20% of the initial samples drawn by each sampler as burn-ins and used the rest of the samples to estimate the probabilities *P*_{
i
j
} = *P*(*A*_{
i
j
} = 1).

##### Evaluating the performance of BVSA

BVSA produces a probability matrix P with the elements *P*_{
i
j
} representing the posterior probability that module *j* directly influences module *i*. Using the threshold probability (*p*_{
t
h
}), the performance of BVSA was evaluated for a range of *p*_{
t
h
} values, starting from *p*_{
t
h
} = 0, gradually incremented by 0.01, up to a maximum value of *p*_{
t
h
} = 1. For each value of *p*_{
t
h
}, a network model was generated and compared with the true network model shown in Figure 2(b). The comparisons were performed by calculating the true positive (TP) rate (also known as ‘recall’), false positive (FP) rate [28] and precision [29] of the inferred networks. The TP rate is the ratio of total number of the correctly identified interactions to the total number of interactions present in the true (reference) network [28]. The FP rate is the ratio of the total number of incorrectly identified interactions and the total number of possible interactions which are absent in the true network [28]. Precision is the ratio of the total number of correctly identified interactions to the total number of interactions present in the inferred network. The curve that depicts TP rate as a function of FP rate is known as Receiver Operating Characteristics (ROC) curve [28] and the curve that depicts precision as a function of TP-rate (recall) is known as Precision-Recall (PR) curve. We calculated the areas under the ROC and PR curves for each inferred network. These two quantities, denoted by AUROC and AUPR respectively, give us a quantitative representation of the accuracy of the inferred networks. Both AUROC and AUPR can have values between 0 and 1, and the closer these values are to 1 the better is the accuracy of the inferred networks, with AUROC =1 and AUPR =1 being the ideal case.

Since BVSA uses a MCMC method to approximate the posterior distribution of the network structure its accuracy depends on the approximation error. Hence, it is necessary to evaluate the robustness of BVSA against MCMC related approximation errors. This was done by executing BVSA 10000 times on the same dataset. This resulted in 10000 different probability matrices from each of which we calculated the AUROCs and AUPRs. Then we calculated the mean and standard deviations of the AUROCs and AUPRs. The mean AUROC and AUPR represent the average performance of BVSA, and the standard deviation represents the uncertainty surrounding the performance estimate. For BVSA to be robust, the standard deviations of AUROC and AUPR must be much smaller than the corresponding means. The mean AUROC and AUPR were found to be ≈0.98 and ≈0.88 and the corresponding standard deviations were ≈0.02 and ≈0.016 respectively, suggesting near perfect and highly robust performance of BVSA on the simulated data.

We compared the performance of BVSA with that of stochastic MRA [16, 17], SBRA [7] and LMML [18]. Since the simulated perturbation responses are noise free, there are no uncertainties surrounding these responses. Therefore, in case of MRA, we did not perform any Monte Carlo simulation [17] and the connection coefficients were estimated from the global response matrix R using TLSR [16]. The absolute values of the estimated connection coefficients represent the topology of the reconstructed MAPK pathway. Accordingly, the AUROC and AUPR values (Figure 2(c)) were calculated by thresholding the absolute values of the connection coefficients using a set of threshold values ranging from 0 to *∞*.

Similar to MRA and LMML, SBRA infers the interaction strengths in the form of a weight matrix W[7]. An element *W*_{
i
j
} of this matrix represents the strength with which node *j* influences the activity of node *i*. The sign of the weights were discarded from our analysis and AUROC and AUPR values were calculated in the same way as in the case of MRA and LMML. The uncertainty surrounding the AUROC and AUPR values were estimated in the same way as in the case of BVSA (see Figure 2(c)).

##### Network reconstruction from noisy datasets

The perturbation responses simulated by the ODE model are noise free. Real biological datasets are usually contaminated with biological noises and measurement errors. We introduced biological noise and measurement errors in the MAPK pathway simulations and used the resulting noisy datasets for network reconstruction. Biological noise is caused by many factors, such as, random thermal fluctuations, Brownian motion of the biochemical molecules, genetic variability within a cell population, etc. We developed a stochastic differential equation (SDE) model to simulate the effects of some of these factors [30] (see SI) on the dynamics of the MAPK pathway. The SDE model was simulated using Stratanovich scheme and Milstein method [31]. The effect of cell to cell variability on the perturbation responses of the MAPK pathway was ignored [30] to keep the analysis within tractable conditions.

Here, ${\sigma}_{e}^{2}$ is the variance of the measurement error in log scale, *α*_{
b
} is the signal independent or background noise, *β*_{
s
} is signal dependent noise and *Y* is the logarithm of the signal intensity. The background noise *α*_{
b
} and the signal dependent noise *β*_{
s
} vary among different measurement systems. However, in most high throughput proteomic experiments *α*_{
b
}<0.1 and *β*_{
s
}<1 [32–34]. Network inference was performed for different levels of signal dependent (*β*_{
s
}) and independent (*α*_{
b
}) measurement errors. We started with *α*_{
b
} = 0.01, *β*_{
s
} = 0.1 and generated 10000 datasets by repeating the stochastic simulations of the perturbation experiments and then introducing random measurement errors. A network was inferred from each of these datasets using BVSA. Similar to the noise free data, we used five parallel Gibbs samplers for each module. In this case we used 500 iterations since noisy data may slow down convergence. To see whether all parallel samplers converge to the same distribution we plotted (Additional file 5: Figure S2) the log(*P*(A_{
i
}|R)) for a sample dataset. The parallel samplers generally converged rapidly to the same distribution. As before, we rejected 20% of the early samples as burn ins and the rest of the samples were used to calculate the posterior edge probabilities *P*_{
i
j
}. A posterior edge probability matrix P was inferred from each of the 10000 datasets using BVSA. A set of AUROC and AUPR values were calculated from each P. The mean and standard deviation of the resulting 10000 AUROCs and AUPRs were calculated. *α*_{
b
} and *β*_{
s
} were then gradually increase by intervals 0.01 and 0.1 respectively up to the maximum values *α*_{
b
} = 0.1 and *β*_{
s
} = 1. For each combination of *α*_{
b
} and *β*_{
s
} we repeated the above procedure and calculated the average AUROC and AUPR values and the corresponding standard deviations (see Additional file 6: Table S1 and Additional file 7: Table S2). The average AUROC and AUPR values were then compared with those calculated from the networks inferred by stochastic MRA, SBRA and LMML.

*α*

_{ b }and

*β*

_{ s }values) and executing these algorithms on each of these data sets. The resulting connection coefficient matrices (in case of stochastic MRA and LMML) and weight matrices (in case of SBRA) were then used to calculate the corresponding AUROC and AUPR values. The resulting AUROC and AUPR values (see Additional file 6: Table S1 and Additional file 7: Table S2) were compared with those calculated from the networks inferred by BVSA and two best performers, one with maximum average AUROC and one with maximum average AUPR, were selected (with p <0.05

^{1}) at each noise level (Figure 3). Our analysis reveals that, BVSA has the highest average AUROC in most of the cases, except a few sporadic cases where the other algorithms performed better (Figure 3(a)). By contrast, SBRA has the highest average AUPR in most of the cases (Figure 3(b)). This suggests that BVSA infers a larger number of interactions with reasonable accuracy, whereas SBRA infers a smaller number of interactions with relatively higher precision.

##### Network reconstruction from incomplete sets of perturbations

For real biological networks,it often is impossible to perturb each network module, separately or in combination. Accordingly, the resulting datasets usually do not contain complete information for a full reconstruction of the underlying network. Here we demonstrate that even in such cases BVSA can reveal salient features of network structures with better accuracy than its counterparts.

*α*

_{ b }= 0.01,

*β*

_{ s }= 0.1) were added to the perturbation responses. No repetitions of the knockdown experiments were performed. This yielded noisy steady state responses of the MAPK modules to five different perturbations. Classical MRA [19], its stochastic counterpart [16, 17] and SBRA are unable to reconstruct a network from this dataset due to its rank deficiency. However, BVSA and LMML are designed to reconstruct networks in situations where the number of perturbation experiments is less than the number of network modules. We generated 10000 datsets with five perturbations (as described above) and inferred network structures from each of these datasets using BVSA and LMML. We then calculated average AUROC and AUPR values for each of the inferred networks. The AUROCs and AUPR values, calculated from the networks inferred by BVSA algorithm were then compared with those of the LMML algorithm to determine the best performer (see Figure 4). The procedure was repeated by perturbing only four (RasGDP, Raf, MEK, and ERK knockdowns) and three (Raf, MEK and ERK knockdowns) modules out of six. This analysis revealed that the performance of BVSA was significantly better than that of the LMML algorithm when faced with incomplete perturbation data.

In the simulation study of the MAPK pathway we established that BVSA can accurately infer network structures from perturbation data and it is robust against biological noises, measurement errors, and insufficient perturbation experiments. However, the above study does not demonstrate the scalability of BVSA, i.e. whether BVSA can be efficiently implemented to infer larger networks, e.g. GRNs consisting of hundreds or even thousands of genes. Below, we address this issue by using simulated perturbation responses of a 10 gene and a 100 gene GRN and compare its performance with that of (stochastic) MRA, SBRA and LMML.

##### Simulation study: in-silico GRNs

For this study we chose two in-silico gene regulatory networks which were previously provided as a part of the fourth network inference challenge of the DREAM consortium http://wiki.c2b2.columbia.edu/dream/index.php/ Challenges. The chosen networks are indexed as network 1 in the 10 gene and 100 gene categories, respectively, in the DREAM-4 data repository (http://wiki.c2b2.columbia.edu/dream/index.php/Challenges). The networks were perturbed by knocking out the component genes one by one. Following each perturbation the responses of the other genes in the network were measured. The knockout experiments were simulated using the GeneNetWeaver [30] software. No biological or technical replicates were simulated for the perturbation experiments. We used the normalized perturbation (knock out) responses for network inference.

^{2}on the same datasets and calculated: (a) the average AUROC and the corresponding standard deviation, (b) the average AUPR and the corresponding standard deviation, (c) the average time taken to finish execution for each of the four algorithms. The results of this analysis, along with the performances of the winning algorithms ([35, 36]) in the 10 and 100 gene categories of the fourth DREAM challenge is shown in Table 1.

Algorithm | 10 Gene network | 100 Gene network | ||||
---|---|---|---|---|---|---|

AUROC | AUPR | Time (secs) | AUROC | AUPR | Time (secs) | |

BVSA | 0.9323 ± 0.0121 | 0.7311 ± 0.011 | 6.023 ± 0.119 | 0.85 ± 0.0101 | 0.14 ± 0.0108 | 1384.92 ± 12.8 |

stochastic MRA | 0.9231 | 0.7133 | 0.0008 | 0.709 | 0.037 | 0.68 |

SBRA | 0.7572 ± 0.019 | 0.58 ± 0.02 | 0.11 ± 0.02 | 0.65 ±0.003 | 0.075 ±0.01 | 1520 ± 3.319 |

LMML | 0.8035 ± 0.06 | 0.66 ± 0.07 | 27.32 ± 1.73 | 0.644 ±0.02 | 0.04 ±0.001 | 41562 ± 3722.2 |

Kuffer et. al.[36] | 0.972 | 0.916 | NA | NA | NA | NA |

Pinna et. al. [35] | 0.764 | 0.590 | NA | 0.914 | 0.536 | NA |

The results (Table 1) suggest that in the 10 genes category BVSA outperformed most of the other algorithms (stochastic MRA, SBRA, LMML and that proposed by Pianna et. al. [35]) except that of Kuffner et. al. ([36], the winner of the DREAM4 in the same category) in terms of accuracy. A possible reason behind the fact that Kuffner et. al.’s algorithm performed better than BVSA is that their algorithm uses five different types of data, i.e. knockdown, time series, multi-factorial and double-knockout data in addition to the single knockout data for network reconstruction [36], whereas BVSA uses only single knockout dataset. The heterogeneous datasets provide a wealth of additional information about the network topology which BVSA is currently unable to use and therefore does not perform as well as Kuffner et. al.’s algorithm. In terms of execution time, BVSA took more time (on an average ≈ 6 seconds) to finish execution than SBRA (on an average ≈ 0.11 seconds) but less time than LMML (on an average ≈ 27.32 seconds) in the 10 gene category. The execution time of Kuffner et. al.’s algorithm is unavailable.

In the 100 genes category, BVSA outperformed most of the other algorithms (Stochastic MRA, SBRA and LMML) except that proposed by Pinna et. al. ([35], winner of DREAM4 challenge in the same category) in terms of accuracy. Kuffner et. al. did not participate in the 100 genes category. In terms of execution time, BVSA (on an average 23 minutes 5 seconds) outperformed both SBRA (on an average 25 minutes 20 seconds) and LMML (on an average 11 hours 32 minutes 47 seconds) in the 100 genes category. The execution time of Pinna et. al’s algorithm [35] is not available. In both 10 and 100 genes category stochastic MRA was the fastest with execution time of (on an average) ≈ 0.0008 seconds and ≈ 0.64 seconds respectively. This is due to the fact that we could not perform MCMC simulation for stochastic MRA to estimate the probability distributions of the connection coefficients. Instead, we calculated point estimates of the connection coefficients using the TLSR method [16]. However, if a MCMC simulation was performed, then the performance of the stochastic MCMC algorithm would have been considerably slower. This is demonstrated in the next section, where we used real biological data with multiple biological and technical replicates.

Encouraged by the above results we used BVSA to infer the topology of the ERBB regulated G1-S transition pathway in breast cancer cells from real experimental data.

##### Real datasets: ERBB regulated G1/S transition in human breast cancer cells

ERBB receptors are a family of four structurally related receptor tyrosine kinases (RTK) which form homodimers, heterodimers, and possibly higher-order oligomers upon activation by growth factors such as EGF, TGF- *α* etc. Activated ERBB dimers act as docking sites for a myriad of adapter proteins which simultaneously initiate many signaling cascades such as the AKT pathway, MAPK cascades, the JAK/STAT pathway etc. Many of these pathways tightly regulate different phases of cell cycle in eukaryotic cells.

At the end of G1 phase of cell cycle when the cells reach their final stage of growth they decide whether to divide, delay division or enter a resting stage. The decision making process involves phosphorylation of the retinoblastoma protein pRB by different Cyclin/CDK complexes. Unphosphorylated pRB proteins bind to E2F family of transcription factors and inhibit its activity. Upon phosphorylation, pRB proteins dissociate from E2F resulting in its activation. A eukaryotic cell commits to divide and initiates DNA replication (i.e. enter into S phase) when active E2F triggers transcription of the necessary genes. The ERBB regulated signaling pathways influence this mechanism by releasing Cyclin/CDK complexes from their inhibitor proteins (Cyclin Dependent Kinase inhibitors) p21 and p27. In 20-30% of breast cancers, ERBB2, a member of the ERBB family of receptors, is overexpressed resulting in a malfunction of control points in the cell division process and unrestricted growth. These cancers are usually treated with Trastuzumab, a recombinant antibody designed to block the ERBB2 activity. However, about two third of the ERBB2 overexpressing breast cancer patients are found to be Trastuzumab resistant ab. initio [37]. In these patients, the cancer cells are able to overcome the cell cycle arrest mechanisms even though ERBB2 is blocked by Trastuzumab. The mechanisms which allow the breast cancer cells to bypass cell cycle arrest is not well understood and currently under intense research.

*α*, IGF1R, p21, p27, CDK2, CDK4, Cyclin-D1, Cyclin E1 and pRB1 in HCC1954 cells [37]. The first seven of these proteins are part of the ERBB mediated signaling pathways and the rest are part of the G1/S transition mechanism. After each knockdown, the cells were stimulated with EGF for 12 hours and the expression levels of ERBB1,ERBB2, p21, p27, CDK2, CDK4, Cyclin-D1 and phosphorylation levels of ERK, AKT, pRB were measured using reverse phase protein arrays [37]. We analyzed these measurements

^{ 3 }using BVSA, (stochastic) MRA, SBRA and LMML to unravel the interactions among the above proteins. To estimate the accuracy of each of these algorithms, we first developed a literature based reference pathway (Figure 5) which represents our current knowledge about how the above proteins interact with each other to regulate G1/S transition in an ERBB dependent manner. Then we compared the topology of the reference pathway with those reconstructed by BVSA, MRA, SBRA and LMML. Below we describe the results of our analysis.

In case of BVSA, we used five parallel Gibbs samplers to search for the potential regulators of each protein. Each sampler was allowed to sample for 2000 iterations. The entire simulation took ≈3 minutes to complete on an intel core i7-820m processor based laptop computer with 12 Giga bytes of RAM. To see whether all parallel samplers converge to the same distribution we plotted (Additional file 9: Figure S3) the log-marginal log(*P*(A_{
i
}|R)) of the samples drawn by the samplers. The parallel samplers converged rapidly to the same distribution. As before, we rejected 20% of the early samples as burn ins and the rest of the samples were used to calculate the posterior edge probabilities *P*_{
i
j
}. The posterior edge probabilities were then thresholded using the thresholding scheme described above.

Similarly, ERK was also found to directly regulate the activity of pRB1 (Figure 6(a)). Previous experimental results indicated that the activity of pRB1 can be regulated by the p53/MDM2 pathway [41] which itself is regulated by the ERK pathway [42]. Since p53 and MDM2 were not measured in the perturbation experiments [37], the ERK mediated regulation of pRB1 via this pathway was inferred as a direct interaction (Figure 6(a)).

We also identified a number of potential feedback mechanisms. For instance, pRB was found to feedback into its upstream kinases CDK2, CDK4 and even further upstream, into the kinases AKT and ERK (Figure 6(a)). Experimental studies by other researchers suggest that these feedback loops are mediated by the transcription factor E2F which is activated upon phosphorylation of pRB. Activated E2F directly binds to the CDK2 [43] promoter and activates its transcription. E2F is also found to transcriptionally regulate AKT1 [44] resulting in a feedback regulation of pRB. On the other hand, E2F transcriptionally activates PAC1 which dephosphorylates ERK [45] thereby completing a negative feedback loop. E2F also can activate ARF which upregulates the stability of the p53 protein [41]. p53 inhibits the translation of the CDK4 protein [46] forming a feedback loop.

Some of the feedback mechanisms identified in this analysis can potentially explain the observed Trastuzumab resistance in HCC1954 cells. In fact, our reconstructed model identified two feedback mechanisms which were experimentally proved by other researchers to cause Trastuzumab resistance in ERBB2 overexpressing breast cancer cells. These feedback loops involve AKT and ERK mediated regulation of ERBB receptors (Figure 6(a)). Previously, it was demonstrated that AKT, a downstream kinase of ERBB, inhibits ADAM17 which activates TGF- *α*, a potent ligand for ERBB receptors [47]. Inhibiting ERBB2 using Tratuzumab inhibits AKT and upregulates ADAM17 [47]. ADAM17 activates many ERBB ligands which keeps ERBB pathways activated [47]. However, the activity of ADAM17 was not measured in the perturbation experiments [37] which we considered for our analysis and the feedback regulation of ERBB by AKT via ADAM17 was inferred by BVSA as a direct network connection from AKT to ERBB.

Additionally, the ERK-ERBB feedback loop which was also inferred by BVSA as a direct feedback from ERK to ERBB is in-fact mediated by EGR1 [48], a target gene of the ERK pathway [49].

We found credible evidence in the literature to support all but two interactions inferred by BVSA. The literature references regarding the inferred interactions are provided in the SI. At the same time, a few known mechanisms involving ERBB regulated signaling pathways and the G1/S checkpoints were not identified by BVSA. In Figure 6(a), we have shown the identified, unidentified and falsely identified interactions.

We also used the Median Probability Model, i.e. *p*_{
t
h
} = 0.5 [50], to reconstruct the above pathway from the probability matrix P which was inferred by BVSA. The resulting network is shown in Additional file 10: Figure S4. The inferred network shares a number of interactions with that derived by the thresholding scheme which was proposed in this paper. However, it fails to identify some well known interactions which were successfully inferred by our proposed thresholding scheme, e.g. ERBB mediated regulation of ERK, the roles of Cyclin Dependent Kinase inhibitors, pRB1 mediated feedback regulations, the autocrine loops etc.

For further comparisons, we employed MRA [17]**], SBRA [**[7] and LMML [18] to reconstruct the ERBB2 regulated G1/S transition network from the same dataset as above [37]. In case of MRA, 10^{
6
} random realizations of the steady state perturbation responses were drawn from Gaussian distributions with means and standard deviations obtained from experimental data [17]. The connection coefficients were calculated from each realization of the perturbation responses using TLSR [16]. The resulting 10^{
6
} realizations of each connection coefficient *r*_{
i
j
} were used to infer the structure of the ERBB regulated G1/S transition mechanism. In most cases, a few realizations (typically <1*%*) of a connection coefficient *r*_{
i
j
} had very different values from the bulk of its values. These “outliers” were discarded by rejecting 1*%* extreme values of each *r*_{
i
j
}. The connection coefficients which had high variances even after rejecting the outliers were assumed to be unidentifiable and were discarded from the analysis. The values of the remaining connection coefficients were then subjected to a Z-test which calculates a p-value to determine whether its mean is close enough to 0. If the p-value is less than 0.05 then the mean of the *r*_{
i
j
} is significantly different from 0, i.e. in this case, *r*_{
i
j
} represents a true network connection. We then used the Benjamini-Hochberg [51] procedure to correct for multiple testing and eliminate any falsely discovered network connection. To determine whether *r*_{
i
j
}represents an activating or inhibitory interaction we first calculated the histogram of each *r*_{
i
j
}. The histograms are shown in Additional file 11: Figure S5. If the fraction of negative realizations of *r*_{
i
j
}is larger than the fraction of positive realizations then *r*_{
i
j
} is assumed to represent an inhibitory interaction. Otherwise, it represents an activating interaction. The above procedure took approximately 3 hours and 27 minutes to complete by the same computer which was used to implement BVSA on the ERBB2 dataset. The network which was reconstructed this way is shown in Figure 6(b). Stochastic MRA inferred many well known interactions (represented by black lines in Figure 6(b)) which take part in the ERBB2 mediated G1/S transition control mechanism. However, it also inferred a large number of interactions (represented by red lines in Figure 6(b)) which could not be supported by evidence from the literature. These interactions are most probably falsely identified interactions.

Furthermore, we reconstructed the same pathway using SBRA. SBRA does not infer connection coefficients. Instead, it infers a weight matrix W which represents the strength of the interactions. The sign of the elements of W represents whether the corresponding interaction is activating or inhibitory. SBRA took approximately 1 minute and 20 seconds to execute as opposed to 3 minutes for BVSA and 3 hours 20 minutes for MRA. The network structure constructed from the inferred weight matrix is shown in Figure 6(c). Similar to MRA, SBRA also inferred a number of well known interactions along with a large number of interactions which are most likely to be false positives.

Finally, we reconstructed the ERBB pathway using LMML [18]. It took approximately 35 minutes and 27 seconds to finish executaion as opposed to 3 minutes for BVSA, 1 minutes 20 seconds for SBRA and 3 hours 20 minutes for MRA. The network inferred by LMML is shown in Figure 6(d). LMML also inferred many known interactions along with a relatively large number of interactions which could not be supported by literature evidence.

The above analysis suggests that BVSA provides an overall faster and more accurate solution to the network reconstruction problem when compared to other network inference algorithms such as MRA, SBRA and LMML. However, our comparison of accuracy depends on the reference ERBB pathway which was constructed from literature. We selected only highly cited experimental results to construct the reference pathway. However, not all of these experiments were performed on the same cell line as the one used by Sahin and colleagues [37]. Therefore, the reference pathway (Figure 5) should only be treated as a plausible generic mechanism of ERBB mediated G1/S transition and the result of the comparative analysis presented in this section should be treated with its fair share of scepticism.

## Discussion and conclusion

In this paper, we propose a network inference algorithm which combines modular response analysis with Bayesian variable selection techniques. This algorithm is capable of reconstructing network topologies from noisy perturbation responses of biochemical systems. It is more accurate than two previously proposed stochastic formulations of MRA, one based on TLS regression [16] and the other based on repeated TLS regressions using an MCMC sampler [17]. The increased accuracy of BVSA is a result of the fact that BVSA penalizes dense networks by implementing appropriate prior distributions for the unknown variables (e.g. *r*_{
i
j
}, *A*_{
i
j
}), thereby minimizing the possibilities of false positives, whereas the stochastic MRA methods lack this capability due to lack of appropriate regularization techniques. The proposed BVSA algorithm is also performs better than a recently proposed Levenberg-Marquardt optimization based Maximum Likelihood (LMML) method [18] and a previously developed sparse Bayesian regression method (SBRA) [7]. This is most likely due to the fact that BVSA implements a model averaging technique, which determines the network topology by averaging a set of likely network models, whereas LMML and SBRA implement two different model selection techniques, each of which find a single network model that maximizes a likelihood function. It was shown by many researchers [52]**-**[54] that model averaging performs better than model selection (for a theoretical explanation see [53, 55]) which may explain why BVSA performs better than LMML and SBRA. We also demonstrated that BVSA can reconstruct network topologies even when the number of perturbation experiments are not sufficient for a full network reconstruction using other algorithms such as MRA [14] and SBRA [7]. It is computationally less expensive compared to many other statistical network inference algorithms, e.g. MCMC based MRA [17], SBRA (for large networks) [7] and LMML [18]. However, the capability of the BVSA algorithm is limited to inferring binary interactions, whereas MRA, SBRA and LMML can also infer the connection coefficients which represent the strength and type (activating or inhibitory) of each interaction. Such information is necessary to understand the molecular mechanisms by which a biochemical network operates. Although, BVSA cannot directly estimate the connection coefficients, these quantities can be readily estimated using linear regression, once a binary network topology is inferred using BVSA algorithm. However, a more systematic approach in estimating the connection coefficients from perturbation data needs to be developed. Therefore, in our future research, we plan to extend the BVSA algorithm to infer the connection coefficients of biochemical networks.

Additionally, BVSA is vulnerable to collinearity in experimental data [56], i.e. if perturbation responses of different network nodes are collinear then BVSA may not perform to its full potential. Therefore, one must practice caution in designing the perturbation experiments and make sure that the perturbation responses of different network nodes are as orthogonal as possible.

The biggest concern of using statistical network inference algorithms to analyze biological datasets is the reliability of the predicted networks. One way of increasing reliability is to make systematic use of all existing information regarding the biochemical networks which the researcher wants to explore [3]. BVSA, at its current stage, incorporates only subjective knowledge regarding abstract topological properties of generic biochemical systems in its inference engine. To improve its accuracy and reliability, it should be customized to take network specific objective knowledge into account. In our future research, we plan to focus on incorporating network specific knowledge into the inferential framework of the BVSA algorithm and thereby increasing its accuracy.

## Methods

### The prior distributions of the unknown variables

#### The prior distribution of the binary variables *A*_{
i
j
}

Biochemical entities such as genes and proteins interact with only selective groups of partners, making biochemical networks sparse systems. Network sparsity implies that for any two arbitrary nodes *i* and *j*, *A*_{
i
j
} has a small probability of being 1, typically *P*(*A*_{
i
j
} = 1)<0.5 Therefore, if we denote *P*(*A*_{
i
j
} = 1) = *θ* then *θ* indicates the sparsity of the network. The degree of sparsity of a biochemical network is usually unknown beforehand (a priori), implying that our knowledge surrounding the probable values of *θ* is uncertain. To formulate our uncertainty about *θ*, we assumed that it has a Beta distribution with parameters *a*, *b*. The choices of the values for *a* and *b* represent our prior knowledge about the sparsity of the network. If the network is likely to be sparse, which is a reasonable a priori assumption for biological networks, then we choose *a*>*b*, since, intuitively *a* and *b* represent our prior knowledge about the likely frequencies of 1’s and 0’s occuring in the binary adjacency matrix A. By the same rationale, we choose *b*>*a* when the network is believed to be dense (*P*(*A*_{
i
j
} = 1)>0.5). BVSA algorithms were shown to perform robustly for different values of *a* and *b*, if these values correctly represent the prior knowledge of model sparsity [57].

Following this notion, we assigned *a*=1 and *b*=2. These values imply that the probability of node *i* being regulated by an arbitrary node *j* is most likely but not limited to be within the range [ 0.097,0.57], i.e. 0.097≤*P*(*A*_{
i
j
} = 1)≤0.57 (see Additional file 1 for explanation) which broadly represents our prior assumption that biochemical networks are sparse.

#### The prior distribution of the connection coefficients *r*_{
i
j
}

*n*node network into

*n*number of smaller subnetworks, each of which corresponds to the interactions between a specific node (

*i*) and its regulators, whose interactions with nodes other than

*i*are not considered. Thus, each subnetwork (

*i*) includes only node

*i*and the nodes that directly affect node

*i*, termed regulators of this node. These subnetworks can be treated as independent networks and their topologies can be inferred separately [58, 59]. In this case, one only needs to account for the interdependence of the connection coefficients within each subnetwork. We assigned a ‘spike and slab’ [60] type joint probability distribution for the connection coefficients of each individual subnetwork. By definition, the

*i*

^{ t h }subnetwork consists of the interactions between node

*i*and its regulators, and the connection coefficients corresponding to these interactions are denoted by ${\mathit{r}}_{i}=\{{r}_{\mathit{\text{ij}}};j=1,\dots ,n;j\ne i\}$. The elements of r

_{ i }which do not represent true edges are considered to be 0 with probability 1 (the spikes) and the elements which represent true edges (denoted by ρ

_{ i }) are assumed to have a multivariate Gaussian distribution (the slab) with mean 0 and covariance matrix ${\mathit{V}}_{{\mathit{\rho}}_{i}}$. Assuming that ρ

_{ i }has ${n}_{k}^{i}$ elements, ${\mathit{V}}_{{\mathit{\rho}}_{i}}$ is a ${n}_{k}^{i}\times {n}_{k}^{i}$ matrix which represents our prior knowledge about the possible range of values of ρ

_{ i }while accounting for the dependencies among different elements of ρ

_{ i }. A commonly used approach is to assume that the prior covariance matrix ${\mathit{V}}_{{\mathit{\rho}}_{i}}$ is proportional to the posterior covariance matrix, i.e. ${\mathit{V}}_{{\mathit{\rho}}_{i}}\propto {\sigma}^{2}{({\mathit{R}}_{\mathit{\text{pr}}(i)}{\mathit{R}}_{\mathit{\text{pr}}(i)}^{T})}^{-1}$[61] where R

_{p r(i)}is a ${n}_{k}^{i}\times {n}_{p}^{i}$ matrix whose rows represent the regulators of node

*i*and the columns represent the global responses of the regulators to different perturbations. If ${n}_{p}^{i}<{n}_{k}^{i}$ i.e., the number of perturbations are less than the number of regulators of node

*i*then the matrix $({\mathit{R}}_{\mathit{\text{pr}}(i)}{\mathit{R}}_{\mathit{\text{pr}}(i)}^{T})$ is not invertible and therefore, ${\mathit{V}}_{{\mathit{\rho}}_{i}}$ becomes a singular matrix. In such scenarios, the posterior distribution of the binary variable

*A*

_{ i j }does not exist. One way to ensure positive-definiteness of ${\mathit{V}}_{{\mathit{\rho}}_{i}}$ is to introduce a ridge parameter (

*λ*) in its formulation [62]. The resultant ${\mathit{V}}_{{\mathit{\rho}}_{i}}$ is shown below.

In Eq. 6, *c* is the proportionality constant which represents how much importance is attributed to the prior precision^{
4
}${\mathit{V}}_{{\rho}_{i}}^{-1}$. The performances of variable selection algorithms such as ours are sensitive to the value of the parameter *c*[63]. Several intuitive choices for the values of *c*, their implications and effects on the performances of these algorithms are discussed in detail in [63]. Some alternatives to these popular choices had also been proposed previously. For example, George et. al. [64] and Hansen et. al. [65] proposed to estimate the likely values of *c* from data using empirical Bayes techniques. However, this was criticized on the grounds that empirical Bayes methods do not correspond to solutions based on Bayesian or formal Bayesian procedures. Liang et. al [63] proposed a full Bayesian solution to the above problem, but this solution involves calculating hyper-geometric distributions which becomes computationally highly expensive. Hence, we assigned a simple, computationally inexpensive value $c={n}_{p}^{i}$ drawing on the notion that the amount of information contained in the prior equalize the amount of information in one observation. It was shown that the adopted value performs well for most scenarios except for cases where a very large number of replicate datasets are available [29]. However, such a scenario is unlikely to occur in biological experiments, where the contrary problem of having fewer replicates than wanted is more frequently encountered.

The value of *λ* was arbitrarily chosen to be 0.1 since it was previously shown that any reasonable value within the range 0<*λ*<1 works equally well[62] in most cases. The introduction of the ridge parameter in ${\mathit{V}}_{{\mathit{\rho}}_{i}}$ ensures the existence of the posterior distributions of *A*_{
i
j
} even when a network has far more nodes than the number of perturbations performed.

##### The prior distribution of the error *∊*_{
i
k
}

*∊*_{
i
k
} is a linear combination of the noise present in individual measurements [66]. Therefore, by the central limit theorem, *∊*_{
i
k
} is a Gaussian random variable [66, 67]. We assumed that *∊*_{
i
k
} is equally likely to have positive or negative values and hence its distribution is centered around 0, i.e. has zero mean. The variance (*σ*^{
2
}) of *∊*_{
i
k
} depends on biological noises and measurement errors and can vary drastically depending on the type of network being investigated and measurement systems used in the investigation. Therefore, our knowledge about the true nature of the noise variance *σ*^{
2
} is uncertain. To account for the uncertainties in the noise variance *σ*^{
2
}, we assumed that *σ*^{
2
} has an inverse gamma distribution with scale parameter *α* and location parameter *β*. The values of *α* and *β* are chosen to incorporate any prior knowledge about the noise variance into the formulation. In the absence of such knowledge, one may choose values for *α* and *β* which yield flat and non-informative priors for *σ*^{
2
}. Following this notion, we selected *α*=1 and *β*=1 to ensure that *σ*^{
2
} has a flat prior which implies that it can have a wide range of positive values.

### The posterior distribution of the binary variable *A*_{
i
j
}

_{ i }, the binary variables corresponding to the subnetwork which consists of the interactions between node

*i*and its regulators. The joint posterior distribution of its elements $\{{A}_{\mathit{\text{ij}}},j=1,\dots ,n;j\ne i\}$ is shown below.

Step by step analytical calculations which lead to the above expression are illustrated in Figure 1 and described in detail in the Additional file 1. However, Eq. 7 allows one to calculate the posterior probability of A_{
i
} only up to a constant of proportionality.

To determine the true posterior of A_{
i
} one needs to calculate the proportionality constant for Eq. 7 which requires the calculation of the right hand side of Eq. 7 for all possible configurations of A_{
i
}. Since, the elements of A_{
i
} can be either 1 or 0, there can be 2^{n−1} possible configurations of A_{
i
}. For small networks (typically *n*<20) it is possible to exhaustively calculate the proportionality constant. In case of large networks (typically *n*≥20) exhaustive enumerations of Eq. 7 for all possible configurations of A_{
i
} are prohibitively time consuming. In such cases one needs to approximate the posterior of A_{
i
} using MCMC sampling.

### Approximating the posterior distribution of *A*_{
i
j
} using Gibbs sampling

_{ i }. The Gibbs sampler starts with a random realization of A

_{ i }(${\mathit{A}}_{i}^{0}$) and generates a sequence of samples ${\mathit{A}}_{i}^{1},{\mathit{A}}_{i}^{2},\dots {\mathit{A}}_{i}^{{N}_{{T}_{s}}}$, where ${N}_{{T}_{s}}$ is the number of samples generated by the sampler. The

*t*

^{ t h }sample ${\mathit{A}}_{i}^{t}$ is obtained componentwise by sampling consecutively from the conditional distributions

*j*≠

*i*. Each distribution shown in Eq. 8 is a Bernoulli with probabilities:

*p*_{
1
} and *p*_{
0
} in Eq. 9 can be calculated using Eq. 7.

Repeated successive sampling of Eq. 9 for all components of A_{
i
} produces the sequence of samples ${\mathit{A}}_{i}^{t},t=1\dots {N}_{{T}_{s}}$ which is a homogeneous ergodic Markov chain that converges to its unique stationary distribution *P*(A_{
i
}|R). A practical consequence of this property is that as the length of the sequence is increased, the empirical distribution of the realized values of A_{
i
} converges to the actual posterior *P*(A_{
i
}|R). In our applications, we were not concerned about strict convergence of the Gibbs sampler. Instead, we adopted an approach similar to [68]**-**[70]. We initiated multiple parallel samplers each starting with a random configuration of A_{
i
}. Each sampler was allowed to generate a sequence of length ${N}_{{T}_{s}}$. We were satisfied if the parallel samplers showed broadly similar marginal distributions, i.e. they converged on each other. We rejected a number (${N}_{{T}_{b}}$) of early samples from each of the sequences and assumed that the empirical distribution of the rest of the samples approximates *P*(A_{
i
}|R). We have shown some illustrations of our approach in the results section.

*A*

_{ i j }= 1 which represents an individual edge emanating from node

*j*to node

*i*. An asymptotically valid estimate of the posterior probability (

*P*

_{ i j }) was calculated as shown below:

Here, *N*_{
c
} is the number of Gibbs samplers initiated for each A_{
i
}.

### Thresholding the posterior probabilities of *A*_{
i
j
}

The topology of the underlying network can be determined by thresholding *P*_{
i
j
} with a threshold probability *p*_{
t
h
}, i.e., if *P*_{
i
j
}≥*p*_{
t
h
} it can be assumed that node *j* directly regulates node *i* and if *P*_{
i
j
}<*p*_{
t
h
}then node *j* does not directly regulate node *i*. The value of *p*_{
t
h
} should be chosen carefully. During the performance evaluation phase, when the network topology is known, the standard approach is to construct a series of networks for different values of *p*_{
t
h
} in the range [ 0,1]. The topology of each network is then compared with the known topology and the overall performance of the algorithm is determined using Receiver Operating Characteristics (ROC) curves. This procedure is discussed in details in the results section.

When the network structure is unknown, determining the correct *p*_{
t
h
}is crucial. In this case, the most commonly used approach is the Median Probability Model (MPM) [50] which simply assumes *p*_{
t
h
}**=0.5. It has been shown that under certain conditions MPM ensures optimal performance [**[50]. However, when the data is highly collinear (which is almost always true in our case) choosing *p*_{
t
h
} = 0.5 no longer yields optimal results [71]. Therefore, we propose a simple and intuitive thresholding scheme which assumes that if an interaction occurs with higher than the average posterior edge probability then it is likely to be a true interaction, i.e. ${p}_{\mathit{\text{th}}}=\frac{1}{n(n-1)}{\sum}_{i=1}^{n}{\sum}_{j=1,j\ne i}^{n}{P}_{\mathit{\text{ij}}}$. Note that when *P*_{
i
j
} is uniformly distributed within the interval [ 0,1], *p*_{
t
h
}≈0.5 and our thresholding scheme resembles MPM. However, high level of multicollinearity often results in *P*_{
i
j
}<0.5 even when there is a direct influence from node *j* to node *i*[71]. In this case, as shown in the result section, our thresholding method outperforms MPM.

## Endnotes

^{
1
} Based on Benjamini-Hochberg corrected t-test between the AUROCs and AUPRs of the best and second best performers.

^{
2
} All computations were performed in a laptop computer equipped with core i7-3610Qm processor and 20 Gigabytes of Random access memory.

^{
3
} we considered only those perturbations which directly targeted the measured proteins. Only nine out of ten measured proteins were targeted by their corresponding siRNA. pRB was not targeted for siRNA mediated knockdown.

^{
4
} Precession is the inverse of variance.

## Declarations

### Acknowledgments

This project was supported by Science Foundation Ireland under Grant No. 06/CE/B1129 and European Union Grant PRIMES No. FP7-HEALTH-2011-278568. We thank Vladislav Vyshemirsky, Norma Coffey and Nial Friel for stimulating discussions and advices on several statistical aspects of this paper.

## Authors’ Affiliations

## References

- Hickman GJ, Hodgman TC: Inference of gene regulatory networks using boolean network inference methods. J Bioinform Comput Biol. 2009, 7: 1013—1029-PubMedView Article
- Sachs K, Perez O, Peter D, Lauffenburger D, Nolan G: Causal protein signaling networks derived From multiparameter single-cell data. Science. 2005, 308: 523—529-PubMedView Article
- Mukherjee S, Speed TP: Network inference using informative priors. PNAS. 2008, 105: 14313—14318-PubMedPubMed CentralView Article
- Hartemink A: Reverse engineering gene regulatory networks. Nat Biotechnol. 2005, 23: 554—55-
- Bansal M, Belcastro V, Ambesi-Impiombato A, Bernardo D: How to infer gene networks from expression profiles. Mol Syst Biol. 2007, 3: 78-PubMedPubMed CentralView Article
- Gardner T, di Bernardo D: Inferring genetic networks and identifying compound mode of action via expression profiling. Science. 2003, 301: 102—105-PubMed
- Rogers S, Girolami M: A Bayesian regression approach to the inference of regulatory networks from gene expression data. Bioinformatics. 2005, 21: 3131—3137-PubMedView Article
- de la Fuente A, Makhecha D: Unravelling gene networks from noisy under-determined experimental perturbation data. IEE Proc.-Syst. Biol. 2006, 153: 256—261-
- Kimura S, Shiraishi Y, Hatakeyama M: Inference of genetic networks using linear programming machines: application of a priori knowledge. Proceedings of International Joint Conference on Neural Networks, IEEE, Atlanta, Georgia, USA, June 14-19,. 2009,, 1617—1624-1617—1624.
- D’Haeseleer P, Liang S, Somogyi R: Reverse engineering of regulatory networks: simulation studies on a genetic algorithm approach for ranking hypotheses. Biosystems. 2002, 66: 31—41-
- Margolin A, Nemenman I, Basso K, Wiggins C, Stolovitzky G, Favera RD, Califano A: Aracne: an algorithm for the reconstruction of gene regulatory networks in a mammalian cellular context. BMC Bioinformatics. 2006, 7: S7-PubMedPubMed CentralView Article
- Peng L, Zhang C, Perkins EJ, Gong P, Deng Y: Comparison of probabilistic Boolean network and dynamic Bayesian network approaches for inferring gene regulatory networks. BMC Bioinformatics. 2007, 8: S13-View Article
- Markowitz F, Spang R: Inferring cellular networks - a review. BMC Bioinformatics. 2007, 8: S5-View Article
- Kholodenko BN, Kiyatkin A, Bruggeman FJ, Sontag E, Westerhoff JB H V Hoek: Untangling the wires: A strategy to trace functional interactions in signaling and gene networks. PNAS. 2002, 99: 12841—12846-PubMedPubMed CentralView Article
- Stark J, Callard R, Hubank M: From the top down: towards a predictive biology of signalling networks. Trends Biotechnol. 2003, 7: 290—293-
- Andrec M, Kholodenko BN, Levy RM, Sontag E: Inference of signaling and gene regulatory networks by steady-state perturbation experiments: structure and accuracy. J Theor Biol. 2005, 232: 421—427-View Article
- Santos SDM, Verveer PJ, Bastiaens P: Growth factor-induced MAPK network topology shapes Erk response determining PC-12 cell fate. Nat Cell Biol. 2007, 9: 324—330-PubMedView Article
- Stelniec-Klotz I, Legewie S, Tchernitsa O, Witzel F, Klinger B, Sers C, Herzel H, Bluthgen N, Schafer R: Reverse engineering a hierarchical regulatory network downstream of oncogenic KRAS. Mol Cell Biol. 2012, 8: 601-
- Kholodenko BN, Hoek JB, Westerhoff HW, Brown GC: Quantification of information transfer via cellular signal transduction pathways. FEBS Lett. 1997, 414: 430—434-PubMedView Article
- Kholodenko BN, Sontag ED: Determination of functional network structure from local parameter dependence Data. Web Archive arXiv: physics/0205003,. 2002
- Sprinthall RC: Basic Statistical Analysis: Seventh Edition. 2003, : Pearson Education Group
- Fröhlich H, Sahin O, Arlt D, Bender C, Beis̈barth T: Deterministic effects propagation networks for reconstructing protein signaling networks from multiple interventions. BMC Bioinformatics. 2009, 10: 322-PubMedPubMed CentralView Article
- Kholodenko BN, Birtwistle MR: Four-dimensional dynamics of MAPK information processing systems. Rev Syst Biol Med. 2009, 1: 28—44-
- Schaeffer HJ, Weber MJ: Mitogenactivated protein kinases: specific messages from ubiquitous messengers. Mol Cell Biol. 1999, 19: 2435—2444-PubMedPubMed CentralView Article
- Oda K, Matsuoka Y, Funahashi A, Kitano H: A comprehensive pathway map of epidermal growth factor receptor signaling. Mol Syst Biol. 2005, 1: 10-View Article
- Kolch W: Meaningful relationships : the regulation of the Ras/Raf/MEK/ERK pathway by protein interactions. Biochem J. 2000, 351: 289—305-PubMedPubMed CentralView Article
- Dougherty M, Muller J, Ritt D, Zhou M, Zhou X, Copeland T, Conrads T, Veenstra T, Lu K, Morrison D: Regulation of Raf-1 by direct feedback phosphorylation. Mol Cell. 2005, 17: 215—224-PubMedView Article
- Fawcett T: ROC Graphs: notes and practical considerations for researchers. Patt Recognit Lett. 2004, 27: 882—891-
- Powers DMW: Evaluation: From precesion, recall and F-measure, informedness, markedness and correlation. J Mach Learn Technol. 2011, 2: 37—63-
- Schaffter T, Marbach D: GeneNetWeaver: In silico benchmark generation and performance profiling of network inference methods. Bioinformatics. 2011, 26: 2263—70-
- Kloeden PE, Eckhard P: Numerical solution of stochastic differential equations. Applications of Mathematics, Springer-Verlag. 1992, 23: 636-
- Anderle M, Roy S, Lin H, Becker C, Joho K: Quantifying reproducibility for differential proteomics: noise analysis for protein liquid chromatography-mass spectrometry of human serum. Bioinformatics. 2004, 18: 3575—3582-
- Stolovitzky GA, Kundaje A, Held GA, Duggar KH, Haudenschild CD, Zhou D, Vasicek TJ, Smith KD, Aderem A, Roach J: Statistical analysis of MPSS measurements: Application to the study of LPS-activated macrophage gene expression. PNAS. 2005, 102: 1402—1407-PubMedPubMed CentralView Article
- Hundertmark C, Fischer R, Reinl T, May S, Klawonn F, Jansch L: MS-specific noise model reveals the potential of iTRAQ in quantitative proteomics. Bioinformatics. 2009, 25: 1004—1011-PubMedView Article
- Pinna A, Soranzo N, Fuente A: From knockouts to networks: establishing direct cause-effect relationships through graph analysis. PLoS One. 2010, 5: e12912-PubMedPubMed CentralView Article
- Kuffner R, Petri T, Windhager L, Zimmer A: Petri nets with fuzzy logic (PNFL): Reverse engineering and parametrization. PLoS ONE. 2010, 5: e12807-PubMedPubMed CentralView Article
- Sahin O, Fröhlich H, Löbke C, Korf U, Burmester S, Majety M, Mattern J, Schupp I, Chaouiya C, Thieffry D, Poustka A, Wiemann S, Beissbarth T, Arlt D: Modeling ERBB receptor-regulated G1/S transition to find novel targets for de novo trastuzumab resistance. BMC Syst Biol. 2009, 3: 10.1186/1752--0509--3--1.
- Samaga R, Saez-Rodriguez J, Alexopoulos LG, Sorger P, Klamt S: The logic of EGFR/ErbB signaling: theoretic0al properties and analysis of high-throughput data. pLoS Comput Biol. 2009, 5: e1000438-PubMedPubMed CentralView Article
- Chu I, Sun J, Arnaout A, Kahn H, Hanna W, Narod S, Sun P, Tan C, Hengst L, Slingerland J: p27 phosphorylation by Src regulates inhibition of Cyclin E-Cdk2 and p27 proteolysis. Cell. 2007, 128: 281—294-PubMedPubMed CentralView Article
- Faust D, Dolado I, Cuadrado A, Oesch F, Weiss C, Nebreda AR, Dietrich C: p38alpha MAPK is required for contact inhibition. Oncogene. 2005, 24: 7941—7945-PubMedView Article
- Polager S, Ginsberg D: p53 and E2f: partners in life and death. Nat Rev. 2009, 9: 738—748-View Article
- McCubrey JA, Steelman LS, Chappell WH, Abrams SL, Wong EW, Chang F, Lehmann B, Terrian DM, Milella M, Tafuri A, Stivala F, Libra M, Basecke J, Evangelisti C, Martelli AM, Franklin RA: Roles of the Raf/MEK/ERK pathway in cell growth, malignant transformation and drug resistance. Biochim Biophys Acta. 2007, 1773: 1263—1284-PubMedPubMed CentralView Article
- Bracken AP, Ciro M, Cocito A, Helin C: E2F target genes: unraveling the biology. Trends Biochem Sci. 2004, 29: 409—417-PubMedView Article
- Chaussepied M, Ginsberg D: Transcriptional regulation of AKT activation by E2F. Mol Cell. 2004, 16: 831—837-PubMedView Article
- Wu J, Jin YJ, Calaf GM, Huang WL, Yin Y: PAC1 is a direct transcription target of E2F-1 in apoptotic signaling. Oncogene. 2007, 26: 6526—6535-PubMed
- Ewen M, Oliver C, Sluss HK, Miller SJ, Peeper D S: p53-dependent repression of CDK4 translation in TGF-beta-induced G1 cell-cycle arrest. Genes Dev. 1995, 9: 204—217-PubMedView Article
- Gijsen M, King P, Perera T, Parker PJ, Harris AL, Larijani B, Kong A: HER2 phosphorylation is maintained by a PKB negative feedback loop in response to anti-HER2 herceptin in breast cancer. PLoS Biol. 2010, 8: e1000563-PubMedPubMed CentralView Article
- Amit I, Citri A, Shay T, Lu Y, Katz M, Zhang F, Tarcic G, Siwak D, Lahad J, Jacob-Hirsch J, Amariglio N, Vaisman N, Segal E, Rechavi G, Alon U, Mills GB, Domany E, Yarden Y: A module of negative feedback regulators defines growth factor signaling. Nat Genet. 2007, 39: 503—12-PubMedView Article
- Ritter CA, Perez-Torres RM, Rinehart C, Guix M, Dugger T, Engelman JA, Arteaga CL: Human breast cancer cells selected for resistance to trastuzumab in vivo overexpress epidermal growth factor receptor and ErbB ligands and remain dependent on the ErbB receptor network. Clin Cancer Reas. 2007, 13: 4909-View Article
- Barbieri M, Berger J: Optimal predictive model selection. Annals Stat. 2004, 32: 870—897-
- Yoav B, Yosef H: Controlling the false discovery rate: a practical and powerful approach to multiple testing. J R Stat Soc B. 1995, 57: 289—300-
- Hansen B: Least squares model averaging. Econometrica. 2007, 75: 1175—1189-View Article
- Draper D: Assessment and propagation of model uncertainty. J R Stat Soc B. 1995, 57: 45—97-
- Hjort LH, Claeskens G: Frequentist model average estimators. J Am Stat Assoc. 2003, 98: 879—899-
- Raftery AE, Madigan D, Hoeting JA: Bayesian model averaging for linear regression models. J Am Stat Assoc. 1997, 92: 179—191-View Article
- George EI, McCulloc RE: Variable selection via Gibbs sampling. J Am Stat Assoc. 19903, 88: 881—889-
- Savitsky T, Vannucci M, Sha N: Variable selection for nonparametric gaussian process priors: models and computational strategies. Stat Sci. 2011, 26: 130—149-PubMedPubMed CentralView Article
- Heckerman D, Chickering DM, Meek C: Rounthwaite C Rand Kadie: Dependency networks for inference, collaborative filtering, and data visualization. J Mach Learn Res. 2000, 1: 49—75-
- Sontag E, Kiyatkin A, Kholodenko BN: Inferring dynamic architecture of cellular networks using time series of gene expression, protein and metabolite data. Bioinformatics. 2004, 20: 1877—1886-PubMedView Article
- Ishwaran H, Rao JS: Spike and slab variable selection: frequentist and Bayesian strategies. Ann Stat. 2005, 33: 730—773-View Article
- Zellner A: On assessing prior distributions and Bayesian regression analysis with g-prior distributions,. Bayesian Inference and Decision Techniques: Essays in Honor of Bruno de Finetti. 1986,, North-Holland, Amsterdam: , 233-233.
- Gupta M, Ibrahim J: An information matrix prior for Bayesian analysis in generalized linear models with high dimensional data. Stat Sin. 2009, 19: 1641—1663-PubMedPubMed Central
- Liang F, Paulo R, Molina G: Clyde MA„ Berger JO: Mixtures of g priors for Bayesian variable selection. J Am Stat Assoc. 2008, 103: 410—423-
- George E, Foster D: Calibration and empirical Bayes variable selection. Biometrika. 2000, 87: 731—747-View Article
- Hansen M, Yu B: Model selection and the principle of minimum description length. J Am Stat Assoc. 2001, 96: 746—774-View Article
- Kariya T, Kurata H: Generalized Least Squares Estimators. Generalized Least Squares. 2004, Chichester, UK: John Wiley & Sons Ltd, 10.1002/0470866993.ch2.View Article
- Hald A: A history of mathematical statistics from 1750 to 1930. 1998, New York: John Wiley and Sons
- Brown PJ, Vanucci M: Multivariate Bayesian variable selection and prediction. J R Stat Soc B. 1998, 60: 627—641-View Article
- Lee KY, Sha N, Dougherty E, Vannucci M, Mallick BK: Gene selection: a Bayesian variable selection approach. Bioinformatics. 2003, 19: 90—97-PubMed
- Zhoua X, Wangc X, Doughertya ER: A Bayesian approach to nonlinear probit gene selection and classification. J Franklin Inst. 2004, 341: 137—156-
- Brown P, Vannucci M, Fearn T: Bayes model averaging with selection of regressors. J R Stat Soc B. 2002, 64: 519—536-View Article

## Copyright

This article is published under license to BioMed Central Ltd. This is an Open Access article distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/2.0), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.