 Research article
 Open Access
 Published:
Capturing contextspecific regulation in molecular interaction networks
BMC Bioinformatics volume 19, Article number: 539 (2018)
Abstract
Background
Molecular profiles change in response to perturbations. These changes are coordinated into functional modules via regulatory interactions. The genes and their products within a functional module are expected to be differentially expressed in a manner coherent with their regulatory network. This perspective presents a promising approach to increase precision in detecting differential signals as well as for describing differential regulatory signals within the framework of a priori knowledge about the underlying network, and so from a mechanistic point of view.
Results
We present Coherent Network Expression (CoNE), an effective procedure for identifying differentially activated functional modules in molecular interaction networks. Differential gene expression is chosen as example, and differential signals coherent with the regulatory nature of the network are identified. We apply our procedure to systematically simulated data, comparing its performance to alternative methods. We then take the example case of a transcription regulatory network in the context of particleinduced pulmonary inflammation, recapitulating and proposing additional candidates to previously obtained results. CoNE is conveniently implemented in an Rpackage along with simulation utilities.
Conclusion
Combining coherent interactions with error control on differential gene expression results in uniformly greater specificity in inference than error control alone, ensuring that captured functional modules constitute real findings.
Background
Molecular profiles reveal how for example gene expression changes over time and in response to perturbation events, for example changes in environmental gradients. These changes are coordinated via regulatory interactions. Regulatory interactions form a network of potentially active links between genes (Fig. 1a). Differentially expressed genes are expected to have neighbours that are differentially expressed (Fig. 1b iii), rather than scattered about the network at random (Fig. 1b ii). We further expect these neighbourhoods to be coherent with the regulatory relationships. In this article we identify differentially expressed subnetworks coherent with the regulatory structure, achieved by integrating differential gene expression with the associated network. Gene expression is routinely measured at the level of expressed RNA transcripts for each gene. Differentially expressed (DE) genes are those genes exhibiting a change in mean gene expression between conditions. However, genes do not act in isolation. Rather, they act in biological networks consisting of interacting coordinated modules and more loosely coupled supermodules [1]. Ravasz et al. [2] first demonstrated this empirically in organisms spanning the three domains of life, finding that their metabolic networks are organized into highly connected modules, which are then more loosely coupled in a hierarchical fashion. The molecules within a functional module are expected to be differentially regulated in a coherent manner, i.e. respecting the regulatory network structure, in response to changes in their environment. From a systems level perspective, molecular entities, e.g. genes, always act together in pathways and modules. The behaviour of these interactions aid in the study of the functions of genes and their products. For example, coordinated changes may be captured by gene coexpression patterns, which measure correlations. Use of direct correlations results in many false positives, and various methods exist to correct this [3, 4]. More recent methods profit from prior topological knowledge to constrain inference in network regulation. Specifically, there is an emphasis on contextspecific network regulation [5–8]. Numerous networkbased regularization methods profiting from previous studies have emerged to perform variable selection and to obtain biologically meaningful predictors [9–11]. Ma et al. [12] perform gene set enrichment analyses using either complete or incomplete topological information. These methods assume that a functional pathway is differentially active if most genes in this network structure are differentially expressed.
In this article, we emphasize regulatory coherence. Regulatory coherence refers to gene expression patterns that respect the regulatory nature of the network. A network is described by a graph G=(V,E) for a set V of vertices and a set E of edges between vertices. For a gene regulatory network (GRN), the vertices represent genes while the edges indicate interactions between genes, such as activation and inhibition. We will refer to edges and vertices as links and genes, respectively. Inducing and inhibiting links are called regulatory links. Each gene regulates or is regulated by genes in its network topological neighbourhood. We define coherent differential expression (CDE) as the tandem changes in gene expression for a pair of genes in a link that is consistent with the regulatory nature of the link. We distinguish between inhibitory and noninhibitory links. Noninhibitory links consist of inducing links, relationships without explicit direction such as binding, or positive correlations where the regulatory relationship is unknown. Tandem changes in gene expression for an inhibition link are coherent if, as the expression of gene A increases, the expression of gene B decreases. In contrast, CDE for noninhibitory links occurs when the expression of both genes increases or decreases. Outside these two cases, differential expression is said to be incoherent. There are many reasons an interaction could be incoherent. First and foremost, coherent differential expression captures signals that dominate the network; some interactions are dynamically promoted while neighbouring interactions are dynamically demoted. Additionally, incoherent DE could point to issues within the underlying network model. For example, if DE has occurred via some phenomenon not represented in the network (e.g. we look only at a GRN but some nonGRN event occurs), this informs us that our model is too simple. Indeed, the incoherence of an expected interaction can point to noncanonical pathways.
With regulatory coherence, it becomes clear that a GRN represents a collection of potential interactions, which are realized in specific contexts and which can be related to observed changes in expression. These realized interactions form the coherent subnetwork. We present Coherent Network Expression (CoNE), a procedure for identifying coherent expression together with error control. This combination is to increase precision in identifying functional modules in molecular interaction networks. We systematically evaluate CoNE through comparison with other methods for identifying differential expression in networks, using simulations where the ground truth is known. Once validated, we apply CoNE to the problem of identifying differentially expressed subnetworks in an in vitro pulmonary inflammation gene expression study.
Methods
Coherent differential expression
In this section, we make our concept of coherence precise and describe our procedure, Coherent Network Expression (CoNE), for identifying coherent subnetworks. Let G be a network with gene set V(G) and link set E(G), and let S⊆G be the coherent subnetwork corresponding to differentially expressed genes. The genes in the gene set V(S) are differentially expressed while all others, V(G)∖V(S), are not. The link set E(S) consists only of those links respecting regulatory coherence. Note that it is not necessary that all links between genes in V(S) be included.
We assign link weights w according to the relationship encoded in a link. For a link (j,k)∈E(G) between genes j and k, the link weight is defined as
Link coherence
We consider first the simple case where we have two experimental conditions, and we are interested in the differential behaviour between the two. For a gene j, let δ_{j} be the differential expression between the two conditions. Consider the link (j,k)∈E(G) between genes j and k, with relationship w(j,k). Then we say that link (j,k)∈E(G) is coherent if
That is, when the relationship is normally inducing, then the differences δ_{j} and δ_{k} must agree on sign. Similarly, when the relationship is normally inhibiting, then the differences δ_{j} and δ_{k} must bear opposite signs. Otherwise, we say that the link is incoherent.
Consider now the general linear model
where μ_{j} is the grand mean expression for gene j, δ_{j} is a vector of factor parameters for treatment vector W, and β_{j} is a vector of parameters for additional covariates Z. We can extend the definition of coherence to general linear models, where we are interested in specific contrasts γ of the factors in W, while controlling for other variables Z. For a gene j, let δ_{j}(γ) be the parameter for the contrast γ. Then we say that the link (j,k)∈E(G) is coherent with respect to contrastγ if
Otherwise, the link is incoherent with respect to contrastγ. This definition easily accomodates the output from, for example, R packages lsmeans [13] for linear and mixed effects models or limma [14] for empirical Bayes estimation.
Coherent network expression (CoNE)
We combine error control with link coherence in CoNE as follows (Fig. 2): 1. We obtain estimates for models (3) across all genes. 2. For a contrast γ, we obtain estimates \(\hat \delta _{j}(\gamma)\) for all genes j∈V(G) in the network. 3. We classify all links as coherent or incoherent and remove all incoherent links (Fig. 2a. Any genes that are isolated, i.e. with vertex degree 0, are also removed. In this way we enrich those genes in the coherent subnetwork. 4. We assess significance of estimates \(\hat \delta _{j}(\gamma)\) with false discovery rate (FDR) control (Fig. 2b, removing all genes with estimated FDR above the control threshold (Fig. 2c. We again remove all isolated genes.
In this paper, we use LIMMA [14] to fit all linear models and we adopt the BenjaminiHochberg [15] false discovery rate procedure for error control in all our analyses.
The initial inspiration for CoNE was the recent FocusHeuristics [7], which seeks to focus on the coherent subnetwork using three measures: mean absolute differential expression, differential link score, and interaction link score. The differential link score is a measure of the magnitude of the coherence between genes in a link, defined as the difference \(\left (X_{j}^{1}+w(j,k)\cdot X_{k}^{1}\right)  \left (X_{j}^{0}+w(j,k)\cdot X_{k}^{0}\right)\) between cases 0 and 1. We have previously formalized hypothesis testing and error control of the differential link score (unpublished [16]). However, this approach suffers from two problems. The first is that incoherent expression can be identified as significantly coherent if the magnitudes of the differential expression between two genes in a link are sufficiently different. This is remedied by additionally ensuring coherence of the link, as in this article. The second problem is more fundamental, in that it penalizes those changes in gene expression that are highly correlated, as the expression for an inducing link illustrated in Fig. 3 demonstrates. In both cases depicted, average change in gene expression for both genes is 2, and hence their differential link score is 4. However, for Case (a), the differential link score is constant and so the variance of the score is 0, while for Case (b) the variance is 1.58. Thus the score in Case (a) is (infinitely) more significantly greater than zero than in Case (b). We see no reason we should favour Case (a) over Case (b). CoNE does not suffer from these problems.
Boundary of a subnetwork
Together with the notion of regulatory modules/subnetworks, it will be important to describe the boundary ∂S of a subnetwork S in a network G. We define this here. Let I be the collection of links in S that are incoherent,
and let B be the collection of links in G with one gene in V(S) and the other in V(G)∖V(S),
Then the boundary ∂S of the subnetwork S in G is defined as ∂S=I∪B.
Simulation and analysis of differential expression in networks
We develop simulations to evaluate the ability of our method to identify coherent interactions and DE modules. To model the dependence structure among genes, gene expression data is simulated as lognormally distributed according to a Gaussian Graphical Model. For each replicate, a random network G, covariance matrix Σ consistent with G, and mean logexpression vectors μ^{0} and μ^{1} are generated. Logexpression is sampled from models N(μ^{c},Σ), c=0,1. For each replicate, we consider sample sizes n=8,16,32, and 64, with 50% of samples in each class c. There are 100 replicates for each network type. The simulations are summarized in Fig. 1. We provide details in the following.
Gaussian graphical models
In our approach to simulate a regulatory network G, each node j∈V(G) interacts with a subset of the network, its neighbourhood N_{j}={k:(j,k)∈E(G)}. Let X_{j} be the expression for a gene j. The expression X_{j} is anticipated by its neighbourhood: given the expression in neighbourhood N_{j}, no further information is gained for the prediction of X_{j} by learning the expression of gene l∉N_{j}, l≠j. In other words, nodes j and l are conditionally independent given N_{j}. The joint distribution of gene expression may be factorized along the maximal cliques of the graph, and hence motivates the application of graphical models. We simulate differential gene expression using Gaussian graphical models (GGMs), which may be specified by their mean vectors and inverse covariance matrices [17]. Let Σ^{−1} be an n×n real positive definite matrix such that (Σ^{−1})_{jk}=0 whenever (j,k)∉E(G) for j≠k. This implies that the partial correlation between genes j and k is zero for all nonlinked genes in the network. Further let μ be fixed in \(\mathbb R^{n}\). Then the distribution \(\mathcal N(\mu, \Sigma)\) describes a GGM with corresponding network G.
Random graphs
In the simulations we use the following random networks: Exponential ErdősRényi and Scalefree BarabásiAlbert [18]. (i) For the exponential graphs, we supply the following parameters for the number of genes and links (v,e): (500,2000), and (2000,8000). (ii) For the scalefree graphs, we set the number of genes, power of preferential attachment, and number of links to add at each timestep (v,p,m) as (500,1,2) and (2000,1,2). See Rpackage igraph for details [19].
The (first) ErdősRényi model considers an initial set of v genes, with e links chosen uniformly from the set of all v(v−1)/2 unique links between genes. Its topology is said to be exponential due to the distribution of vertex degree, which follows a Poisson distribution. On the other hand, the BarabásiAlbert model belongs to the class of scalefree graphs, so called because there is no ‘typical’ node degree, with the degree distribution following an approximate powerlaw. Beginning with the biologically compelling assumption that as a network grows, new nodes attach preferentially to nodes with higher degree, [18] demonstrated that random graphs produced in this way are scalefree. Even though most biological networks appear to be scalefree, exponential graphs still arise naturally. Barabasi and Oltvai [1] mention for instance that Saccharomyces cerevisae and Escherichia coli exhibit mixed exponential and scalefree features, noting that the incoming degree distribution for transcription regulatory networks is approximately exponential while the degree distribution of transcription factor interactions is scalefree.
Differential expression and localization patterns
We investigate both null and true differential expression where genes are differentially expressed at random or in modules. For the small graphs (v=500), we simulate data where (i) there is no differential expression (null), (ii) differential expression is distributed randomly over the genes (low: 1% DE; high: 10% DE), (iii) differential expression is restricted to a connected subgraph (low: 1% DE; high: 10% DE), (iv) differential expression is restricted to three connected subgraphs (low: 3% DE; high: 30% DE) with average size 5 (low) and 50 (high). For the large graphs (v=2000), we simulate data where (i) there is no differential expression (null), (ii) differential expression is distributed randomly over the genes (low: 1% DE; high: 10% DE), (iii) differential expression is restricted to a connected subgraph (low: 1% DE; high: 10% DE), (iv) differential expression is restricted to three connected subgraphs (low: 1% DE; high: 10% DE) with average size 20 (low) and 200 (high). Expression patterns are depicted in Fig. 1b.
The generation of differential expression depends on the expression pattern. We generate mean logexpression vectors μ^{0} and μ^{1} for classes 0 and 1. The entries of μ^{0} are sampled from a uniform distribution U(−d,d), d=4,8,16,32. For the null pattern, we assign μ^{0} to μ^{1}. For the scattered differential expression patterns, we are not concerned with the regulatory relationships. We choose entries of μ^{1} at random and add a random value sampled from U(−d,d) to them, as described in Algorithm 1. We remark that differential expression for d=4,8,16,32 corresponds to mean absolute logdifferential expression \((\overline {\Delta E}) 2, 4, 8, 16\) across simulations, respectively. An average difference \(\overline {\Delta E} = 16\) is extreme and unlikely to be seen in practice; as such it represents an upper limit to the context of gene expression.
The generation of simulated coherent expression is more involved. We must first generate a subnetwork, and then generate gene expression in a way that ensures that differential gene expression is coherent in the subnetwork. To obtain a connected subnetwork for each module, we select a gene at random, and then select genes from the neighbourhood, growing the network iteratively as described in Algorithm 2.
Here N(V,G) is the neighbourhood of the gene set V in network G and G_{V} is the induced subnetwork of G with vertex set V. In the case of multiple modules, each module is created to be approximately the same size. Next, we generate mean logexpression vectors. This is done iteratively through gene set V(H), so that differential expression for gene v_{j} is coherent with at least one of its neighbours v_{k}, k<j. This is described in Algorithm 3.
The vector of signs ψ contains the information on signs of differential expression for each gene. This is initialized as a vector of 1’s, and the sign for vertex j is adjusted as necessary so that its differential expression is coherent with at least one of the vertices k<j. Explicitly, the product ψ_{k}·w(v_{k},v_{j}) ensures that the change in expression for gene v_{j} is coherent with the change in expression for gene v_{k}. At a minimum, there will be a simply connected subnetwork (i.e. a tree) connecting all DE genes. However, it is possible that two disconnected genes within this tree share a link within the larger network. If the link is promotional and the genes are both up or both downregulated, then this is coherent and the link is included in the coherent subnetwork. Similarly, if the link is inhibitory and one gene is up while the other is downregulated, then this is also coherent and the link is included in the coherent subnetwork.
Covariance structure
In our simulations, the covariance structure is informed by the graph structure of the network, as well as the nature of the link. In Eukaryotes, inducing links account for approximately 75 to 80% of regulators [20, 21]. McDonald et al. [20] report that the average proportion of activations for circadian networks is 0.74 in Arabidopsis and Drosophila, while generally for Eukaryotic signalling networks the average is 0.83. For each graph, we choose a random proportion of inducing links uniformly over (0.72,0.85), p∼U(0.72,0.85). We assign each link a relationship w_{jk} of 1 (noninhibitory) with probability p and 1 (inhibitory) otherwise.
We construct a covariance matrix satisfying the conditional dependence structure of the network by first constructing the precision matrix P=[p_{jk}] from the adjacency matrix A=[a_{jk}] and then inverting to obtain the covariance matrix Σ=P^{−1}, described in Algorithm 4.
In step (1), we assign random values to link weights independently and identically distributed according to a uniform distribution U(0.5,1). In step (2), we add 1 to all nonboundary link weights, (j,k)∉∂S, ensuring that the genes in modules are more strongly coupled to each other than to the rest of the network. In step (3), we adjust all link weights by their relationship encoded in w_{jk}, and multiply this by 1 to account for the relationship between partial correlation ρ_{jk} and the entries of the precision matrix p_{jk}: \(\rho _{jk}=\mathbf {p_{jk}}/\sqrt {\mathbf {p_{jj}p_{kk}}}\). In step (4) we add a positive shift λI to ensure positive definiteness and hence ensure that we ultimately obtain a covariance matrix. The scale parameter λ=λ_{1}+λ_{2} is calculated as follows. −λ_{1} is the smallest eigenvalue of the matrix A from step (3). It ensures positive semidefiniteness. We then calculate λ_{2}>0 so that the resulting matrix has condition number equal to the number of genes v in the network. This ensures invertibility of the matrix. At this point, the matrix is a proper precision matrix. Finally in step (5) we obtain the covariance matrix. Thus by construction, this matrix is consistent with the network G, as described under “Gaussian graphical models” section.
Alternative methods
We compare CoNE to two alternatives, a standard network independent method and a networkconstrained method. Both of these are implemented in R, a requirement placed in our search for methods.
LIMMA is a linear model based method that uses moderated tstatistics to assess the significance of the design as a predictor of gene expression [14]. LIMMA is a networknaive method. We include it as a baseline method in order to ascertain the improved inference resulting from incorporating network information. In our simulation study, we use LIMMA as the standard networkfree method. We ascertain the significance of differences between log gene expression δ_{j} with BenjaminiHochberg FDR (α=0.05). We keep the subnetworks corresponding to the genes identified as differentially expressed.
BioNet incorporates a network in the analysis of gene expression profiles for the detection of functional modules [22]. Thus BioNet represents a method with similar goals to CoNE. Beginning with a set of pvalues assigned to each gene, a betauniform mixture model is fit, with the 1parameter beta distribution B(α,1), α>0. Scores for each subnetwork are computed based on this model and an integer linear programming algorithm is used to locate the maximum scoring subnetwork. For our simulation study, we take the unadjusted pvalues obtained for LIMMA and feed them into the BioNet algorithm with BenjaminiHochberg FDR control (α=0.05). BioNet returns a connected subnetwork.
Evaluation of CoNE and alternatives on simulated data
Performance in simulations is evaluated via sensitivity (SE), specificity (SP), and precision (P) of the procedures to both genes and links. These are standard metrics, which in our notation are given as follows. Let G be the simulated regulatory network, S be the simulated coherent subnetwork, and \(\widehat S\) the estimated coherent subnetwork. Then
where · counts the number of elements in a set.
In order to compactly evaluate the differences between CoNE and alternatives with respect to SE and SP, we fit generalized linear models to study the interactions between simulation parameters and inference procedures. Since the number of DE and nonDE genes is constant, SE and SP can be modelled according to a binomial distribution. SE and SP are thus modelled logistically as the interaction between inference method (M) and network topology (T; 0 for scalefree, 1 for exponential), network size (N; 0 for 500 genes, 1 for 2000 genes), differential expression pattern (P), mean absolute logdifferential expression \((\overline {\Delta E})\), and sample size (n), where the linear predictor η is given by
The differential expression and sample size covariates were logtransformed to create a uniform spacing between consecutive parameters. This ensures that the high differential expression and high sample size cases do not have disproportionate leverage in the model. Since PR depends on the number of genes/links sampled, PR was modelled according to a negative binomial distribution, constructing the linear predictor as for SE and SP.
Application
We consider an example gene expression experiment investigating particleinduced inflammation in pulmonary artery endothelial cells reported in Karoly et al. [23], specifically the effect of exposure to airborne ultrafine particles (UFPs) – particles with diameter less than 100 nm. The authors hypothesize that UFPs contribute to endothelial cell dysfunction by inducing transcriptional activation of genes involved in coagulation and inflammatory responses. To test this, they perform a cell culture study with one treatment group (exposure to 100 μg/mL UFPs; n=4) and one control group (no UFP exposure; n=4) and measure the effects via gene expression.
Gene expression
Affymetrix microarray CEL files are downloaded from the Gene Expression Omnibus database [24], accession number GSE4567 [25]. Gene expression is corrected and normalized via the Rpackage oligo [26] using the default method and then logtransformed. Expression data is annotated with gene symbols using the Rpackage hgu133plus2.db [27]. Where gene symbols correspond to multiple expression values, we take the mean of the values within each sample.
Gene regulatory network
The human TRRUST V2 network [28], which is currently the most comprehensive public database for human regulatory interactions, is used as the seed network. This network consists of 800 transcription factors (TFs) and 2095 nonTFs, with 8444 regulatory links. We remove loops and multiple links; since this is a directed network, we treat links (j,k) and (k,j) as distinct. After restricting the gene expression dataset and TRRUST network to their common gene set, we obtain a GRN of 2731 nodes and 7966 links.
Differential expression
We infer the coherent subnetwork via CoNE with BenjaminiHochberg control (FDR α=0.05). We also perform an updated analysis of the gene expression data with LIMMA, following Karoly et al. [23] to identify significant differentially expressed genes. We use updated annotation sources in order to ensure that differences between their procedures and CoNE reflect the methods and not the annotation source. Additionally, we perform a third analysis, following Karoly et al. [23] but this time restricting the gene set to those common to the GRN. In this way we can evaluate the marginal effect of using our procedure using a common set of genes. This provides some indication of how our method will perform when the full GRN becomes available.
KEGG pathway analysis
We perform gene set enrichment analyses of gene lists obtained for both the LIMMA and forward procedures, using the Human KEGG pathway database [29]. Gene sets are determined to be significantly enriched following Fisher’s exact test with BenjaminiHochberg control (α=0.05).
Results
Simulations
CoNE is more specific and precise than LIMMA and BioNet (see Fig. 4b, c, e, f), at the expense of being less sensitive than LIMMA at the gene level and sometimes less sensitive than BioNet (Fig. 4a, d). CoNE is however more sensitive than LIMMA with respect to links.
CoNE controls the false discovery rate. In fact, CoNE controls error for genes better than either LIMMA or BioNet when differential gene expression presents as modules (Fig. 4c). CoNE does not control error for the 1%, scattered differential expression pattern because it does not detect genes in that scenario; this is by design. On the other hand, BioNet controls error poorly except for the case when a high proportion of genes are differentially expressed in modules. Further, CoNE controls error for links, even though it only explicitly controls gene error (Fig. 4f). Neither LIMMA nor BioNet control link error. Precision with respect to network topology and network size is reported in Table 1C. Method precision is not greatly affected by network topology or network size for any of the methods; this is as expected, since we are controlling for the false discovery rate.
Sensitivity with respect to network topology and network size is reported in Table 1A. CoNE is more sensitive for genes for exponential networks versus scalefree networks, whereas the reverse holds for BioNet; LIMMA is indifferent. BioNet is less sensitive for links for exponential networks whereas CoNE and LIMMA are indifferent. All three methods are less sensitive with respect to genes and links as network size increases; note however that BioNet decreases more rapidly in sensitivity than either CoNE or LIMMA.
Specificity with respect to network topology and network size is reported in Table 1B. Specificity for both genes and links increases as network size increases for all three methods. Gene specificity is decreased for exponential networks relative scalefree networks. On the other hand, link specificity is increased for exponential networks relative scalefree networks for LIMMA and BioNet; CoNE is indifferent in this case.
The performance of the standard LIMMA procedure is nearly independent of the differential expression pattern, with strict error control over all patterns and topologies. The performance of CoNE and BioNet are more nuanced.
We investigated a range of sample sizes (n=8,16,32,64) and mean logdifferential expression magnitudes (ΔE=2,4,8,16). The methods with the greatest performance for modular gene expression patterns in terms of median sensitivity, specificity, and precision are displayed in Fig. 5. It is clear that if gene sensitivity is the only measure of importance, LIMMA is the top performer across sample sizes n and differential expression magnitudes ΔE. On the other hand, if specificity or link sensitivity are important, then CoNE or CoNE and BioNet are better choices, respectively.
Application: particleinduced inflammation
For the CoNE analysis of our example gene expression dataset, we obtained a coherent subnetwork with 80 genes and 119 links, with one large connected component with 76 genes, and 2 components consisting of gene pairs. Of the identified genes, 92.5% were upregulated, indicating that the dominant response from exposure to ultrafine particles is activation. Of the identified links, 94% were inducing, whereas in the full GRN 77% were inducing. 51 KEGG pathways were identified as significantly enriched, of which 21 corresponded to noninfection, noncancer, immunerelated pathways. These are presented in Table 2.
The updated LIMMAbased analysis of [23] again yielded the Cytokonecytokine receptor interaction, Wnt signaling, and MAPK signaling pathways as before, together with a number of other immunerelated pathways. The analysis with the gene set restricted to those in common with the GRN returns the Cytokonecytokine receptor interaction but not the other two pathways. This potentially reflects the imperfect matching between pathway databases and network knowledge. The list of significantly enriched pathways for the restricted analysis is presented in Table 2.
Discussion
Simulation
CoNE effectively identifies modules. CoNE has almost zero false positives in the null differential expression scenario. This suggests that if two distinct modules were truly differentially expressed, CoNE could not only identify them, but also separate them into two distinct connected components. Indeed, results for scattered and modular differential expression confirm this. Whereas CoNE does not typically obtain large connected components for scattered differential expression, but only a few small components of two or three genes, CoNE correctly identifies modules in the modular differential expression scenario. Thus differentially expressed modules identified by CoNE constitute actual findings.
BioNet’s variation in sensitivity, specificity, and precision is large in comparison to CoNE and LIMMA. Additionally, BioNet has some difficulties with large sample sizes or large absolute mean differential expression, sometimes failing to identify any signals. There is perhaps difficulty in fitting the betamixture distribution using maximumlikelihood estimates when the signal is very strong. When some pvalues are numerically close to 1, the loglikelihood for the beta distribution B(α,1) is not welldefined, while when some pvalues are numerically close to 0, the loglikelihood for the beta distribution B(1,β)(β>0) is not welldefined [30].
Across all our simulations, we find that CoNE is less sensitive to differential gene expression than LIMMA. However, for these simulations we do not apply a ‘relevance’ threshold, such as at least 2fold change, to the differential expression submitted for LIMMA analysis. It is typical to use a threshold on the fold change to classify differential expression as relevant. Thus truly differentially expressed genes whose mean differential expression falls below the threshold are necessarily excluded, reducing the sensitivity of LIMMA in practice. It may be that CoNE as applied is more sensitive than LIMMA as it is typically applied. In a sense, we have replaced the relevance threshold with coherence status in defining relevance.
We chose to simulate differential expression via GGMs in order to avoid conflating performance with emergent behaviour in a system. We had to address the dual questions, “What level of complexity is sufficient” and “What level of complexity is too much?” Using GGMs allows us direct control over generating coherent differential expression, so that we can determine whether the method is able to use coherent expression to detect functional modules to greater precision over alternatives. We are able to show that if there is coherent differential expression, then indeed, our method is able to detect functional modules. We judge this sufficient. Had we simulated our data in a more complex manner, for example using Markov chains, it is not clear how to separate the differentially expressed functional modules from the surrounding network without severing all the connections. This would destroy any covariation between the functional module and the rest of the network. Further, it is not clear how to simulate ‘null’ differential expression in the nondifferentially expressed subnetwork. Now that we have shown that, yes, CoNE detects differentially expressed functional modules, we can apply it to simulations of dynamic systems, such as those generated via Markov chains, to detect functional modules that arise as emergent properties of the structure of the regulatory network. That would be very interesting, but outside the scope of the current article. Essentially, we have used GGMs to avoid conflating performance with emergent behaviour in a system.
Particleinduced inflammation
CoNE identified 13 inflammationrelated pathways, 1 oxidative stressrelated pathway, and 7 other immunerelated pathways, while the restricted networkagnostic procedure (LIMMA) identified 8 inflammationrelated pathways, 1 oxidative stressrelated pathway, and 4 other immunerelated pathways. The identification of oxidative stress pathways is consistent with the hypothesis that airborne particles induce inflammatory response through an oxidative stress mechanism. Karoly et al. [23] hypothesized an increase in inflammatory responses. That use of CoNE identifies twofold more inflammationrelated pathways, overlapping with most pathways identified for the LIMMAbased analysis, indicates an increase in sensitivity at the level of gene set enrichment. Using CoNE allows us to identify these pathways because it is more specific at the level of gene expression.
Karoly et al. [23] are particularly interested in tissue factor (TF), noting that its gene expression (F3) is upregulated. In an additional experiment, they find that increased TF protein induces increased release of the cytokine IL8 (gene CXL8). While the coherent subnetwork does not reveal a directed path F3 to CXL8, we observe that EGR1, JUN, and NFKB1 appear to be inducing F3. Genes EGR1, JUN, and NFKB1 have directed paths leading to CXL8. The structure of this network suggests a synergy between EGR1, JUN, and NFKB1 resulting in the increased expression of CXL8. This subnetwork is presented in Fig. 6. A high resolution figure of the full coherent subnetwork is presented in Fig. 7.
Conclusion
CoNE infers differentially activated modules in gene regulatory networks. While this work is developed in the context of gene regulatory networks, the methodology is sufficiently general for application to other molecular networks.
None of the three methods CoNE, BioNet, or LIMMA uniformly dominates any other across all measures. When it is important that error be wellcontrolled, the CoNE and LIMMA procedures are most appropriate. There are some scenarios where BioNet outperforms the rest; however, BioNet’s extreme variation in sensitivity is hard to predict. Further, it begins to perform poorly when the signal to noise ratio is high, or when the sample size is high. We recommend comparing networkconstrained approaches to a LIMMA baseline. The disparity between these can indicate whether we are observing a scattered or modular differential expression regime. Further, it can safeguard against high variation in precision or sensitivity. Finally, current network knowledge is incomplete, so that using only networkdependent methods will miss potentially important signals.
Different experimental settings are represented by combinations of sample size and differential expression magnitude. In vitro cell line studies generally fall under the low sample size, high magnitude setting, represented in the upper left corners of the plots in Fig. 5. Since in vitro experiments can be wellcontrolled, the signaltonoise ratio is high, which is here represented by high differential expression magnitude. On the other side, successful in vivo studies in humans generally have many biological replicates, which is necessary due to the uncontrollable nature of study participants, resulting in lower signaltonoise ratio, represented in the lower right corners of the plots in Fig. 5. The simulations have not provided an unambiguous top performer. When detecting novel signals, we must trade between gene and link sensitivity, and hence between LIMMA and CoNE. However, when our goal is mechanistic understanding, a method with great specificity is needed, and hence CoNE is recommended.
Networkconstrained approaches to identifying regulated features are accompanied with the desire for increased power and precision to detect the truly relevant changes before an expansive, noisy background. We observe in these simulations that CoNE is highly specific, and has greater power for detecting links, while LIMMA retains greatest power for detecting genes. However, the networkconstraints at the same time bias our possible results. It may be that the noncoherent differential signals in the data point to interesting regulatory changes. These could represent cases where the actual regulatory structure has changed. Such an interpretation would rely on the validity of the underlying network model, and so it would be worthwhile to investigate how errors in the underlying network could affect the analysis of functional modules. This is however outside the scope of this article. Thus, it is worthwhile to investigate both coherent and noncoherent differential regulatory signals.
Abbreviations
 CDE:

Coherent differential expression
 CoNE:

Coherent network expression
 DE:

Differentially expressed
 FDR:

False discovery rate
 GGM:

Gaussian graphical model
 GRN:

Gene regulatory network
 PR:

Precision
 SE:

Sensitivity
 SP:

Specificity
 UFP:

Ultrafine particle
References
 1
Barabási AL, Oltvai ZN. Network biology: understanding the cell’s functional organization. Nat Rev Genet. 2004; 5(2):101–13. https://0doiorg.brum.beds.ac.uk/10.1038/nrg1272.
 2
Ravasz E, Somera AL, Mongru DA, Oltvai ZN, Barabási AL. Hierarchical organization of modularity in metabolic networks. Science. 2002; 297(5586):1551–5. https://0doiorg.brum.beds.ac.uk/10.1126/science.1073374.
 3
Friedman J, Hastie T, Tibshirani R. Sparse inverse covariance estimation with the graphical lasso. Biostatistics. 2008; 9(3):432–41. https://0doiorg.brum.beds.ac.uk/10.1093/biostatistics/kxm045.
 4
Margolin AA, 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 Bioinf. 2016;7(1). https://0doiorg.brum.beds.ac.uk/10.1186/147121057S1S7.
 5
Warsow G, Greber B, Falk SS, Harder C, Siatkowski M, Schordan S, Som A, Endlich N, Schöler H, Repsilber D, Endlich K, Fuellen G. ExprEssence  Revealing the essence of differential experimental data in the context of an interaction/regulation network. BMC Syst Biol. 2010;4(164).
 6
Woo JH, Shimoni Y, Yang WS, Subramaniam P, Iyer A, Nicoletti P, Rodríguez Martínez M, López G, Mattioli M, Realubit R, Karan C, Stockwell BR, Bansal M, Califano A. Elucidating Compound Mechanism of Action by Network Perturbation Analysis. Cell. 2015; 162(2):441–51. https://0doiorg.brum.beds.ac.uk/10.1016/j.cell.2015.05.056.
 7
Ernst M, Du Y, Warsow G, Hamed M, Endlich N, Endlich K, Escobar HM, Sklarz LM, Sender S, Junghanß C, Möller S, Fuellen G, Struckmann S. FocusHeuristics  expressiondatadriven network optimization and disease gene prediction. Sci Rep. 2017; 7:42638. https://0doiorg.brum.beds.ac.uk/10.1038/srep42638.
 8
Hill SM, Nesser NK, JohnsonCamacho K, Jeffress M, Johnson A, Boniface C, Spencer SEF, Lu Y, Heiser LM, Lawrence Y, Pande NT, Korkola JE, Gray JW, Mills GB, Mukherjee S, Spellman PT. Context Specificity in Causal Signaling Networks Revealed by Phosphoprotein Profiling. Cell Syst. 2017; 4(1):73–83. https://0doiorg.brum.beds.ac.uk/10.1016/j.cels.2016.11.013.
 9
Li C, Li H. Networkconstrained regularization and variable selection for analysis of genomic data. Bioinformatics. 2008; 24(9):1175–82. https://0doiorg.brum.beds.ac.uk/10.1093/bioinformatics/btn081.
 10
Sun H, Wang S. Penalized logistic regression for highdimensional DNA methylation data with casecontrol studies. Bioinformatics. 2012; 28(10):1368–75. https://0doiorg.brum.beds.ac.uk/10.1093/bioinformatics/bts145.
 11
Avey S, Mohanty S, Wilson J, Zapata H, Joshi SR, Siconolfi B, Tsang S, Shaw AC, Kleinstein SH. Multiple networkconstrained regressions expand insights into influenza vaccination responses. Bioinformatics. 2017; 33(14):208–16. https://0doiorg.brum.beds.ac.uk/10.1093/bioinformatics/btx260.
 12
Ma J, Shojaie A, Michailidis G. Networkbased pathway enrichment analysis with incomplete network information. Bioinformatics. 2016; 32(20):3165–74. https://0doiorg.brum.beds.ac.uk/10.1093/bioinformatics/btw410.
 13
Lenth RV. Leastsquares means: The R package lsmeans. J Stat Softw. 2016; 69(1):1–33. https://0doiorg.brum.beds.ac.uk/10.18637/jss.v069.i01.
 14
Ritchie ME, Phipson B, Wu D, Hu Y, Law CW, Shi W, Smyth GK. limma powers differential expression analyses for RNAsequencing and microarray studies. Nucleic Acids Res. 2015; 43(7):47. https://0doiorg.brum.beds.ac.uk/10.1093/nar/gkv007.
 15
Benjamini Y, Hochberg Y. Controlling the False Discovery Rate: A Practical and Powerful Approach to Multiple Testing. J Roy Stat Soc Ser B. 1995; 57(1):289–300. https://0doiorg.brum.beds.ac.uk/10.2307/2346101.
 16
Rush S, Repsilber D. Capturing contextspecific regulation in molecular interaction networks. bioRxiv:10.1101/254730. 2018. https://www.biorxiv.org/content/early/2018/01/29/254730.full.pdf. https://0doiorg.brum.beds.ac.uk/10.1101/254730. https://www.biorxiv.org/content/early/2018/01/29/254730.
 17
Kolaczyk ED, Csárdi G. Statistical Analysis of Network Data with R. New York: Springer; 2014.
 18
Albert R, Barabási AL. Statistical mechanics of complex networks. Rev Mod Phys. 2002; 74(1):47–97.
 19
Csardi G, Nepusz T. The igraph software package for complex network research. InterJournal. 2006; Complex Systems:1695.
 20
McDonald D, Waterbury L, Knight R, Betterton MD. Activating and inhibiting connections in biological network dynamics. Biol Direct. 2008;3(49). https://0doiorg.brum.beds.ac.uk/10.1186/17456150349.
 21
Wang T, Feng Y, Wang Q. PAIRS: Prediction of Activation/Inhibition Regulation Signaling Pathway. Computational Intell Neurosci. 2017. https://0doiorg.brum.beds.ac.uk/10.1155/2017/7024516.
 22
Beisser D, Klau GW, Dandekar T, Müller T, Dittrich MT. BioNet: an RPackage for the functional analysis of biological networks. Bioinformatics. 2010; 26(8):1129–30. https://0doiorg.brum.beds.ac.uk/10.1093/bioinformatics/btq089. Accessed 16 Jan 2018.
 23
Karoly ED, Li Z, Dailey LA, Hyseni X, Huang YCT. Upregulation of Tissue Factor in Human Pulmonary Artery Endothelial Cells after Ultrafine Particle Exposure. Environ Health Perspect. 2007; 115(4):535–40. https://0doiorg.brum.beds.ac.uk/10.1289/ehp.9556.
 24
Barrett T, Wilhite SE, Ledoux P, Evangelista C, Kim IF, Tomashevsky M, Marshall KA, Phillippy KH, Sherman PM, Holko M, Yefanov A, Lee H, Zhang N, Robertson CL, Serova N, Davis S, Soboleva A. NCBI GEO: archive for functional genomics data sets  update. Nucleic Acids Res. 2013; 41(D1):991–5. https://0doiorg.brum.beds.ac.uk/10.1093/nar/gks1193.
 25
Karoly E, Huang Y. Endothelial cell culture with Chapel Hill Ultrafine particle. GEO accession GSE4567; Karoly et al. 2007. https://0wwwncbinlmnihgov.brum.beds.ac.uk/geo/query/acc.cgi?acc=GSE4567. Accessed 20180409.
 26
Carvalho BS, Irizarry RA. A framework for oligonucleotide microarray preprocessing. Bioinformatics. 2010; 26(19):2363–67. https://0doiorg.brum.beds.ac.uk/10.1093/bioinformatics/btq431.
 27
Carlson M. Hgu133plus2.db: Affymetrix Human Genome U133 Plus 2.0 Array Annotation Data (chip Hgu133plus2). 2016. R package version 3.2.3. https://bioconductor.org/packages/release/data/annotation/html/hgu133plus2.db.html.
 28
Han H, Cho JW, Lee S, Yun A, Kim H, Bae D, Yang S, Kim CY, Lee M, Kim E, Lee S, Kang B, Jeong D, Kim Y, Jeon HN, Jung H, Nam S, Chung M, Kim JH, Lee I. TRRUST v2: an expanded reference database of human and mouse transcriptional regulatory interactions. Nucleic Acids Res. 2018; 46(D1):380–6. https://0doiorg.brum.beds.ac.uk/10.1093/nar/gkx1013 Accessed 22 Jan 2018.
 29
Kanehisa M, Sato Y, Kawashima M, Furumichi M, Tanabe M. KEGG as a reference resource for gene and protein annotation. Nucleic Acids Res. 2016; 44(D1)(Database issue):457–62. https://0doiorg.brum.beds.ac.uk/1093/nar/gkv1070.
 30
Schröder C, Rahmann S. A hybrid parameter estimation algorithm for beta mixtures and applications to methylation state classification. Algoritm Mol Biol. 2017;12. https://0doiorg.brum.beds.ac.uk/10.1186/s1301501701121.
Acknowledgements
The authors would like to thank Dr Georg Fuellen and Frida Gorreja for critical review of the original manuscript.
Our research was carried out at the Nutrition Gut Brain Interactions Research Centre (NGBI) at Örebro University, Sweden.
Funding
This work is supported by grants from The Knowledge Foundation (KKstiftelsen), Stockholm, Sweden [20110225]. The funding body had no role in either the design of the study, the collection, analysis, and interpretation of data, or in writing the manuscript
Availability of data and materials
An Rpackage cone implementing the methodology and simulations is available. The latest stable version may be accessed at < git.oru.se/ bioinfoPublic/CoNE>. The code to simulate and analyse the data in this article is also available, together with an archived version of cone, coine.
The application dataset for ultrafine particle stimulation was accessed from the Gene Expression Omnibus with accession number GSE4567 [25], at <https://0wwwncbinlmnihgov.brum.beds.ac.uk/geo/query/acc.cgi?acc=GSE4567>.
Author information
Affiliations
Contributions
SR and DR conceived and designed study. SR designed and implemented methodology, simulations and analyzed data. SR and DR cowrote manuscript. All authors read and approved the final manuscript.
Corresponding author
Ethics declarations
Ethics approval and consent to participate
Not applicable.
Consent for publication
Not applicable.
Competing interests
The authors declare that they have no competing interests.
Publisher’s Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
Open Access This article is distributed under the terms of the Creative Commons Attribution 4.0 International License (http://creativecommons.org/licenses/by/4.0/), which permits unrestricted use, distribution, and reproduction in any medium, provided you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license, and indicate if changes were made. The Creative Commons Public Domain Dedication waiver (http://creativecommons.org/publicdomain/zero/1.0/) applies to the data made available in this article, unless otherwise stated.
About this article
Cite this article
Rush, S., Repsilber, D. Capturing contextspecific regulation in molecular interaction networks. BMC Bioinformatics 19, 539 (2018). https://0doiorg.brum.beds.ac.uk/10.1186/s1285901825137
Received:
Accepted:
Published:
DOI: https://0doiorg.brum.beds.ac.uk/10.1186/s1285901825137
Keywords
 Activated subnetwork
 Coherent differential expression
 Differential regulation
 Error control
 Functional module
 Molecular network