 Methodology article
 Open Access
 Published:
Active subnetwork recovery with a mechanismdependent scoring function; with application to angiogenesis and organogenesis studies
BMC Bioinformatics volume 14, Article number: 59 (2013)
Abstract
Background
The learning active subnetworks problem involves finding subnetworks of a biomolecular network that are active in a particular condition. Many approaches integrate observation data (e.g., gene expression) with the network topology to find candidate subnetworks. Increasingly, pathway databases contain additional annotation information that can be mined to improve prediction accuracy, e.g., interaction mechanism (e.g., transcription, microRNA, cleavage) annotations. We introduce a mechanismbased approach to active subnetwork recovery which exploits such annotations. We suggest that neighboring interactions in a network tend to be coactivated in a way that depends on the “correlation” of their mechanism annotations. e.g., neighboring phosphorylation and dephosphorylation interactions may be more likely to be coactivated than neighboring phosphorylation and covalent bonding interactions.
Results
Our method iteratively learns the mechanism correlations and finds the most likely active subnetwork. We use a probabilistic graphical model with a Markov Random Field component which creates dependencies between the states (active or nonactive) of neighboring interactions, that incorporates a mechanismbased component to the function. We apply a heuristicbased EMbased algorithm suitable for the problem. We validated our method’s performance using simulated data in networks downloaded from GeneGO against the same approach without the mechanismbased component, and two other existing methods. We validated our methods performance in correctly recovering (1) the true interaction states, and (2) global network properties of the original network against these other methods. We applied our method to networks generated from timecourse gene expression studies in angiogenesis and lung organogenesis and validated the findings from a biological perspective against current literature.
Conclusions
The advantage of our mechanismbased approach is best seen in networks composed of connected regions with a large number of interactions annotated with a subset of mechanisms, e.g., a regulatory region of transcription interactions, or a cleavage cascade region. When applied to real datasets, our method recovered novel and biologically meaningful putative interactions, e.g., interactions from an integrin signaling pathway using the angiogenesis dataset, and a group of regulatory microRNA interactions in an organogenesis network.
Background
One aim of systems biology is to map highthroughput OMICs data or a list of genes to known pathways, as well as discover novel networks of interactions. Advanced integrated platforms such as Metacore from GeneGo Inc, Ingenuity Pathway Analysis (Ingenuity Systems, http://www.ingenuity.com), or GeneSpring Pathway Analyzer (Agilent Technologies) provide tools to allow such discoveries by mining large proprietary, often manually annotated, databases for networks of interactions enriched for genes/proteins in the user’s input gene list. The details relating to each interaction are supported by evidence in scientific literature. Such details allow the interactions to be categorized in different ways, such as effects (positive, negative, or “other”), mechanism of the interaction (e.g., binding, cleavage, phosphorylation, microRNA regulation etc.), and directionality.
However, the resulting network does not always accurately reflect the cellular events occurring in the condition from which the highthroughput experiment is taken. The interactions stored in Metacore are known to exist in a specific set of conditions in certain organisms  not necessarily under the users experimental conditions. Most programs provide an option to filter the network interactions by particular disease, tissue or species, but this limits the ability to discover new potential interactions not previously associated with the user’s disease/tissue/species, which are revealed in the user’s experiment.
On the other hand, if filtering is not used, the resulting network will contain many false positives, i.e., interactions not truly present in the user’s experimental conditions. Furthermore, the input gene list used to generate the network is simply a list, and does not encapsulate all the information in the researcher’s expression data, such as time series variation. In summary, it is likely that only a subset of interactions produced in the generated network are active  forming an active subnetwork of the interaction network.
Active subnetwork problem description and background
Ideker et al.[1] introduced a framework for identification of active subnetworks from an original network. This framework entails a problem that searches for connected regions of a molecular interaction network that show significant changes in expression over a particular subset of the conditions.
Many researchers have since investigated this problem. Ultimately, the methods developed to solve this problem involve two parts:

the scoring function: how do you score a connected region of genes and interactions that reflects the likelihood that the region is active?

the search method: how do you search among the connected regions for the regions with the highest scoring function (a global optimization problem)?
In Ideker’s work, the method proposed uses the statistical scores of individual genes obtained from gene expression data to derive an overall statistical score for every candidate subnetwork and uses simulated annealing to search from highscoring subnetworks.
Ideker et al. showed that the second step in the problem, that is, searching for a connected subnetwork with the highest score is an NPhard problem. Since then, various efforts have attempted to use heuristics to address the problem, including simulated annealing [1, 2], local greedy search [36] and mathematical programming based methods [7, 8].
Ideker’s method treats each gene’s contribution to the scoring function as fixed, because its differential expression (DE) status is determined only once. An alternative approach to active subnetwork searching is to adjust the classification of whether a gene is DE or not, according to the classification of its neighbors in an active subnetwork. By looking at the local neighborhood of a gene, and the expression levels of these genes, we can adjust what we consider to be true differential expression. By using an iterative approach, one can find an active subnetwork based on the genes adjusted DE classification.
Wei and Li [9] adopt such an approach. They use an iterative algorithm to assign a binary value to each gene in the original network that reflects the true DE state of the gene. Genes assigned to a true DE state belong to the active subnetwork, while the remainder of the genes do not belong to this subnetwork. In each iteration, a gene is assigned to a state by comparing the posterior probability of each state assignment (true DE or not). The posterior probability of a state is the product of the likelihood of observing the expression data given the state (a “noise model”  see later), and a prior probability of the state. A Markov Random Field (MRF) [10] is used to create the prior probabilities by exploiting dependencies between state assignments of neighboring genes in the network. Global parameters used in the noise model and MRF are updated at each iteration based on current state assignments using an iterated conditional mode algorithm [11].
Some methods have attempted to use observations on edges in their scoring function [2]. The advantage of edgebased methods is that returning a list of proteins (nodes) does not tell you anything about which interactions are active in the condition. Nodebased methods rely on connecting all interactions in the original network that exist between the active nodes. In fact, nodes can be connected through multiple alternate interactions, and through indirect paths. It is useful to know exactly which interactions are active in the condition, and responsible for carrying out the biological function of interest.
One measure of edge strength is the correlation of gene expression between the two adjacent nodes [12, 13]. Qiu et al. developed a tool RegMOD which classifies genes as “active” or “not active” using a support vector regression method where a diffusion kernel matrix specifies the relationship between adjacent genes using the Pearson correlation between gene’s expression levels [14].
Ma et al. claim to be the first to use both node and edgebased measures in the scoring function [15]. In particular, they use the Fstatistic to measure gene differential expression, and an expected conditional F statistic (ECF) to measure genegene differential correlation across multiple observations between groups.
In a related study, Jaimovich et al.[16] predict ground truth state of proteinprotein interactions (PPIs) from large PPI databases. They use protein interaction and cellular location assay data as noisy observation data of the ground truth state of each interaction (present or not). A relational markov network is used to create dependencies between neighboring interactions.
Function annotation in proteinprotein interaction networks: A parallel problem domain
We now describe another problem domain in the area of biological network characterization which has arisen in parallel to the active subnetwork problem. Researchers working in each problem domain have generated tools and algorithms used by researchers in the other domain. This other problem domain concerns the annotation of previously unannotated proteins in proteinprotein interaction (PPI) networks. Problems in this domain focus on optimizing the assignment of function labels to proteins with unknown function in a PPI. Solutions to this problem can also involve use of a scoring function that scores the likelihood of assigning a label to a given protein, and a search method to find the optimal assignment over all proteins in the network.
Deng et al. use a scoring function which employs a Markov Random Field that creates a dependency between neighboring proteins. The likelihood of protein being given a particular label assignment (e.g., label “A”) depends on the number of proteins assigned to that label in a local neighborhood in the PPI [17]. Letovsky and Kasif developed a protein labeling algorithm for a partially unlabeled PPI network by using a binomial model of the probability based on the local neighborhood, and a Markov Random Field belief propagation algorithm [18].
In an improvement to the work of Deng et al., Lee et al. (the same team of researchers) modified the scoring function and used a multivariate logistic regression approach. In the new function, the likelihood of assigning a given protein to a label (e.g., label “A”) depends on multiple factors, where a factor is created for each label in the set of possible protein function labels. The factor reflects the number of proteins in the local neighborhood assigned to the particular label (e.g., label “i”), weighted by a unique parameter for the two labels (e.g., a parameter for label “A” with label “i”) [19].
Comparison of methods in two problem domains
We have described how MRFs have been used in the protein function identification problem domain [17, 19], as well as in the active subnetwork problem domain [9, 20] to reflect relationships between neighboring genes and proteins in biological networks. Lee’s modification of the protein label assignment MRF model to incorporate multiple factors that reflect the varying influence of neighboring protein label assignments according to the two labels in question, has not yet been extended to the active subnetwork problem. There is a good biological motivation in the active subnetwork problem space to exploit such multivariate techniques, as we describe shortly.
A novel approach to discovering functional active subnetworks with a mechanismdependent scoring function
Method summary
Our work builds on the above literature to learn active subnetworks, where we specify that the probability that an interaction is assigned to the “active” state depends on the state of each neighbor interaction and and where the level of dependence varies according to the mechanism assigned to the two interactions. This work can be seen therefore as a modification of the work of Wei and Li to incorporate some of the advances made by Lee et al., with respect to weighting each neighbor’s influence according to predefined label assignments, rather than treating each neighbor as equally influential.
We use the controlled vocabulary provided by GeneGO Inc. to specify the mechanism labels in our problem. Table 1 states the symbols used in Metacore and this paper for the interaction mechanisms in Metacore.
Our program written in the R language [21] reads in a network of interactions from Cytoscape [22] generated SIF file, as well as the Cytoscape annotation files which specify the interaction mechanism for each interaction in the SIF file. Our program also reads in a vector of correlation coefficients, considered to be a noisy observation of the true state of the interaction in that experiment, or can alternatively calculate the correlation vector from an input gene expression matrix. The algorithm assigns states (active or nonactive) to the interactions in the network. The algorithm uses a probabilistic graphical model which incorporates both a noise model and a MRF over the interactions in the network to learn a final system state, which is described in section “A probabilistic graphical model framework”.
In this manuscript, we have used networks generated by Metacore from a list of differentially expressed genes. The networks are imported into Cytoscape using the plugin CytoscapeNetPlugin.jar, where the SIF files are exported. However, any Cytoscape network with edge labels containing mechanism annotations can be read into R and used in our algorithm.
The MRF uses parameters to express the dependence of an interaction’s state assignment on its neighbor’s state. While Wei and Li use a single parameter to express this dependence (the “single parameter approach”) [9], we learn the value of multiple parameters, where a parameter exists for each unique pair of mechanisms. The parameter expresses the relationship between a pair of neighboring interactions annotated with this pair. With a larger set of parameters, a more complex function is used to model the dependence of each interaction on a local neighborhood in the network. We iteratively learn this larger set of parameters and infer the state of interactions, to converge to an active subnetwork. We call this approach a “full parameter” approach.
We compare this approach to the single parameter approach and Ideker’s JActiveModules using artificially created original networks with simulated data. We then apply the single and full parameter approaches to learn active subnetworks from real expression data, and discuss how the full parameter approach highlights different functional aspects of the active subnetwork for closer consideration by biological scientists.
We now justify why we believe it is appropriate to split up the parameter to weight a neighbor’s influence according to its mechanism in the active subnetwork problem domain.
Assumptions about mechanismmechanism pairs in active subnetworks
In this work, we assume that interaction mechanisms are correlated with other interactions mechanisms in active subnetworks, which we refer to as mechanismmechanism (MM) correlation here, and define more formally later. The level of correlation varies according to the two mechanisms involved.
To justify this assumption, we first consider hypothetical regions of a network made up of a subset of mechanisms, using evidence and citations of such regions in real biological networks.

1.
A phosphorylation pathway that contains a series or “cascade” of phosphorylation and dephosphorylation interactions. In such a cascade, interactions with mechanisms Phosphorylation (+P) or Dephosphorylation (P) are typically physically located next to or close to one another. We would therefore expect there to be a high mechanismmechanism correlation for the mechanism pairs {+P,+P},{−P,−P}, and potentially {+P,−P}. That is, we assume if part of the signaling cascade is active in a given condition, it is likely that the remaining interactions in the cascade are also active in the condition. As an example, the ERK1/2 cascade is highly conserved, and depending on the input stimulus and cell type, regulates various cellular processes such as proliferation, differentiation, and cell cycle progression [23]. In order for the cellular processes to be properly carried out, all phosphorylation steps in the pathway must be carried out; i.e., in order for ERK 1/2 to relocate to the nucleus and phosphorylate its nuclear targets, all previous phosphorylation steps must have occurred.

2.
A large protein complex made up of multiple protein subunits that bind together through a binding mechanism (B). The formation of proteins from multiple subunits is prolific throughout biology, and genes corresponding to protein complex subunits are often coexpressed in a condition [13]. As one example, fibrin is glycoprotein made up of three pairs of nonidentical polypeptide chains: which are the fibrinogen alpha, beta and gamma subunits. Here, we expect a large mechanismmechanism correlation for the mechanism pair {B,B}.

3.
A cleavage cascade that contains a series of cleavage (C) steps. For example, the blood coagulation process involves the activation of multiple coagulation factors, which through a cascade of protein cleavage events, converge on thrombin, which in turn cleaves fibrinogen to generate a network of crosslinked fibrin that is involved in blood coagulation [24]. We would expect a large mechanismmechanism correlation for the mechanism pair {C,C}.

4.
A transcription regulatory region in which a transcription factor (TF) regulates multiple targets via a transcription mechanism (TR). Typically, a particular TF becomes biologically activated (e.g., through a mutation or phosphorylation event), locates to the nucleus, and is sufficiently expressed to regulate multiple potential gene targets. This would reflect the well documented 1many behavior of TF bindings in biological conditions. See for example Yu et al. [25] who showed that target genes of a regulator tend to be coexpressed, and that the level of coexpression is higher when multiple transcription factors are involved. We also know that transcription regulatory cascades appear in transcription regulatory networks [26]. We therefore expect a high correlation for the {T R,T R} mechanism pair in an active subnetwork with transcription regulatory regions.

5.
A transcription region involving microRNA (miRNA) activity. miRNAs are a 2223nt RNA transcript which are known to target mRNA and either break down the transcript, or prevent its translation to a protein [27, 28]. The mechanism annotation is (M). It has been shown that miRNAs often play a role in controlling mRNA transcript levels by participating in simple and complex circuits [29] such as singleinput motifs (SIMs) (one miRNA to multiple targets) and multipleinput motifs (MIMs) (multiple miRNAs bind to multiple targets to provide a coordinated regulation of targets) [30, 31]. Because miRNAs participate in SIMs and MIMs we expect high correlation for the pair {M,M} in an active subnetwork where miRNAs are functional.

6.
A complex regulatory circuit made up of miRNAs and TF activity. For example, it has been shown that miRNAs can bind to the gene target of a TF, or to the TF itself, in a feedforward loop [32, 33]. In such a region interactions with TR mechanisms neighbor interactions with M binding mechanisms, and we expect an active subnetwork containing such a region to have high a correlation for the pair {T R,M}.
We seek to find active subnetworks by using the assumption that true biological networks are likely to contain regions that are largely, (though not entirely), made up of interactions belonging to a subset of mechanisms. The mechanisms group together to carry out a meaningful biological function within the region. We have justified this assumption in this section, by providing multiple examples with evidence of such mechanism groupings in several canonical GeneGO Pathway Maps.
MM pair rich active subnetworks
We predict our method will have the greatest predictive accuracy in recovering active subnetworks which meet certain properties. First, we provide some definitions. We define an MM pair as a set of two mechanisms in IM. If n= I M, there are \frac{n\times (n+1)}{2} possible MM pairs allowing pairs of the same mechanism. First, we divide MM pairs into two types: correlated MM pairs and noncorrelated MM pairs. We now define an interactioninteraction pair (II pair) as a pair of neighboring interactions in the network. Consider one of the possible MM pairs, which we call M1M2 for convenience. We say an II pair is labeled M1M2 if one interaction from the pair is labeled M1 (i.e., has an annotated mechanism M1), and the other interaction is labeled M2 (i.e., has an assigned mechanism M2). Further, each interaction in an II pair has a true activity state in the original network: active or nonactive. (It is this state that we try to recover in the active subnetwork recovery problem.)
We now describe the properties of the original network that will generate good results with the full parameter approach. Each pair M1M2 in the set of correlated MM pairs should meet the following criteria. Consider only II pairs labeled M1M2 in the network. This set of interactions should be enriched for II pairs where the two interactions are in the same activity state. This means, among II pairs labeled M1M2, the number of pairs where both interactions in the pair are active, or both interactions are not active, should occur more frequently than expected by random assignment of activity state to interactions. Specifically, the network should have a greater number of II pairs labeled M1M2 that are in the same state relative to the number II pairs labeled M1M2 in different states (i.e. one interaction is active, and the other not active). Such a finding suggests II pairs labeled M1M2 are coactivated; that is, when one interaction labeled M1 is active in a condition, its neighbor labeled M2 is also likely to be active. These pairs will have a high mechanismmechanism correlation.
For a pair M1M2 in the set of noncorrelated pairs, the network should have a similar number of II pairs labeled M1M2 in different states relative to the number of II pairs labeled M1M2 in the same state. II pairs labeled M1M2 in this scenario are not coactivated in the condition, and are not expected to have a high mechanismmechanism correlation.
If the original network has these properties, we describe the active subnetwork as an “MM pair rich active subnetwork”. Such a network produces a range of mechanismmechanism correlations, allowing the full parameter method to finetune the dependencies of interaction activity states on a neighbor’s activity state, according to the mechanisms assigned to the interactions.
When viewing only the active or nonactive part of the original network (the active subnetwork), it should appear to contain regions with many II pairs labeled with M1M2, if M1M2 is a correlated MM pair. Figure 1 show an example of an MM pair rich active subnetwork in a Blood Coagulation Pathway Map downloaded from GeneGO Inc.
In our solution, we will see that mechanismmechanism correlations for each MM pair are not known and are learned from the data in the form of parameters. Having provided the background and justification for our approach, we now introduce our solution to the active subnetwork problem.
Methods
A probabilistic graphical model framework
We use a probabilistic graphical model framework to address our problem of finding active subnetworks within networks generated with GeneGO Metacore tool from an uploaded experimental dataset. The probabilistic graphical model contains two components. The first component describes the likelihood of observing the correlation of expression profiles between edges in the network given the state (active or nonactive) of all the interactions in the network (the Noise Model). The second component creates dependencies between the states of neighboring interactions in the physical network (the MRF component).
Random variables, parameters and assumptions
Notation
We use the following notation. We use capital letters to denote RVs (eg X) and lower case letters denote a particular realization (or observation) of a RV (e.g., x). Subscripted letters denote a particular RV from a class of RVs (e.g., X_{1}). Bold font denotes a vector of RVs belonging to the same class (e.g., X={X_{1},X_{2}…X_{ n }}). A horizontal bar over a value denotes a RV is not equal to this value (e.g., x =\overline{j} denotes x is not equal to j). For a set of variables, a horizontal bar over a RV denotes all variables in the set except this RV (e.g., for the set S, {S}_{\overline{i}}) implies all RVs in S except i.The size of a vector (or set) is denoted by  (e.g., X).
Network and graphical model definitions
We define the original network as a graph G=(V,I) with a set of components v_{ i }∈V and a set of interactions I_{i,j}∈I between components v_{ i } and v_{ j }. Y = (Y_{1},Y_{2}…Y_{ p }) is a vector of RVs comprising the timecourse gene expression profiles for p genes in the original network. Each Y_{ i }∈Y is itself a vector of size n∗t of observations for each node v_{ i } in the network with n replicates taken over t time points during the time course. Each interaction I_{i,j} is preassigned by Metacore to an interaction mechanism, which we denote by IM(I_{u,v}), where IM(I_{u,v}) ∈{B,C,C M,+P,−P,T,T n,Z,T r,M}.
To construct the graphical model, we convert interactions in I^{P} to random variables. In the graphical model, there are several classes of random variables. Q = ({Q}_{1,1},\dots {Q}_{1,{n}_{1}},{Q}_{2,1}\dots {Q}_{2,{n}_{2}}\dots {Q}_{g,{n}_{g}}) is a vector of latent discrete RVs, where Q_{u,v} is the RV corresponding to interaction I_{u,v} in the original network, and n_{ i } is the final neighbor of source node v_{ i }. We refer to I M(Q_{u,v}) to specify the interaction mechanism of the random variable Q_{u,v} in the graphical model.
Each entry Q_{u,v} in Q specifies a probability distribution over each state in the state space. Each Q_{u,v} corresponds to a state assignment (or realization) of Q_{u,v}. Q thus specifies the full system realization for all the interactions in the putative network. The state space of Q_{u,v} may be large as we shall see, however, the distribution for Q_{u,v} only specifies nonzero probabilities for two states, the active or nonactive state. We use A(Q_{u,v})=1 to denote the event that Q_{u,v} is in the active state and A(Q_{u,v})=0 to denote the event that Q_{u,v} is in the nonactive state.
R comprises the set of sample correlation statistics calculated from the expression data Y. R_{u,v} is an observed RV in the graphical model and corresponds to the Spearman correlation between expression variables (Y_{ u } and Y_{ v }) over a single timecourse experiment.
Model parameters
The parameters in this model can be thought of as latent variables. The parameters include:

Θ  A distributional parameter used to determine the likelihood of values in R given the current system realization.

Ψ  A set of parameters which describe the relationship between adjacent RVs in the MRF component of the graphical model which creates a dependency between the state of neighboring interactions in the putative network.
Model assumptions
We create the following model assumptions:

Each sample correlation R_{u,v} between RVs Y_{ u } and Y_{ v } is calculated using the Spearman correlation coefficient and thus there are no assumptions on the distribution of Y_{ u } or Y_{ v }.

Each RV Q_{u,v} is coupled to other RVs in Q via the MRF C_{ Q }. The parameters of the MRF are learned and specified in Ψ.
Graphical model representation
We define the graphical model formally as a probability distribution μ which factorizes over a graph. The nodes in the graphical model comprise the RVs defined in “Network and graphical model definitions” corresponding to interactions in the original network and parameters defined in section “Model parameters”. The edges of the graphical model describe conditional independence properties between the RVs in accordance with graphical model theory.
Figure 2 contains a diagram of two different types of cliques within the graphical model.
The noise model specifies the conditional likelihood that RV R_{u,v} is equal to its observed value R_{u,v} given the state of parent variable Q_{u,v}:
The MRF component creates a dependency between Q_{u,v} and a local neighborhood of interactions denoted by ∂_{u,v}. The MRF specifies the conditional probability of state assignment Q_{u,v} given a potential function ψ_{u,v}. The potential function ψ_{u,v} is a function of the state realization of the local neighborhood denoted by {q}_{{\partial}_{u,v}} and the parameter set Ψ.
We describe the joint likelihood function when we describe the learning and inference algorithms.
Noise model
We now define the conditional likelihood function used to express the clique potential Ψ for cliques in the noise model. We provide an explicit formula for the conditional likelihood term in equation 1.
The conditional likelihood term reflects the likelihood of observing the correlation data R given the system state. For noise model clique for example RV Q_{u,v}, this is a statistical test on RV R_{u,v}. We consider the two alternative hypotheses on Q_{u,v} for k∈{0,1}, corresponding to whether the RV is assigned to the active state (k=1) or nonactive state (k=0). Assigning the interaction to a state, is like assigning the interaction to a class. Each class k consists of a population of interactions. The population can be described by a correlation coefficient population parameter ρ_{ k }, which expresses the mean level of correlation between adjacent genes, for interactions in class k.
The null hypothesis is: H_{0}:A(Q_{u,v})=0; i.e., I_{u,v} is not active in the experimental condition, A(Q_{u,v}) is in class k=0. For interactions in class k=0, we assume R_{u,v} is sampled from a population with parameter ρ_{k=0} =0. That is, for interactions in this population, there is, on average, no correlation of expression between two genes adjacent to the interaction.
The alternative hypothesis H_{1} is: A(Q_{u,v})=1, i.e., the interaction between nodes u and v is active in the experimental condition. For interactions in class k=1, we assume the correlation is centered on some number ρ_{k=1}>0 i.e., there is, on average, some correlation of expression between the two adjacent genes over the timecourse. The assumption is if the genes tend to be coactivated at the same time points, it is likely that the interaction is active.
The likelihood function seeks to find the probability of obtaining the sample correlation coefficient, i.e., R_{u,v}=r_{u,v}, for each alternative hypothesis.
We use a Fisher transformation in R package psych[34] to generate a new RV Z_{u,v} from R_{u,v}, where Z_{u,v} is a normally distributed RV.
The Fisher transformation is:
Z_{u,v} is approximately normally distributed with mean that is Fisher transform of population CC ρ_{ k } for k∈{0,1}, and standard error \sqrt{n3} for sample size n.
We first consider the case k=1. We do not know population parameter ρ_{k=1}, however assume we have an estimate of this parameter r_{ α }, with corresponding Fisher transformation z_{ α }.
In our model, equation 1 becomes:
The transformed likelihood function is a distribution function which has the property that when R_{u,v} = r_{ α },l_{u,v}=P r(Z_{u,v}<z_{ α }A(Q_{u,v}=1))=0.5. l_{u,v} increases as R_{u,v} exceeds r_{ α }, and decreases in the other direction. Therefore, the larger the value of R_{u,v} relative to r_{ α }, the greater the value of the likelihood term.
For H_{0} : A(Q_{u,v})=0, we convert R_{u,v} to a t statistic t_{u,v} and perform a onetailed t test. Equation 1 becomes:
If R_{u,v} = 0, then l_{u,v}=μ(T_{u,v}>0A(Q_{u,v}=0))=0.5. l_{u,v} now decreases as R_{u,v} increases above 0. Therefore, the smaller the value of R_{u,v} relative to 0, the greater the value of the conditional likelihood term in calculating μ(A(Q_{u,v})=0).
These tests apply where we assume a positive correlation of expression for H_{1}, i.e., ρ_{1}>0. For negative correlation r_{u,v}<0, we use the absolute value of the correlation coefficient z_{u,v}.
Thus Θ={r_{ α }} and the parameter r_{ α } is computed using a maximum likelihood estimator discussed in Section “Mstep”.
The MRF component
We apply MRF modeling tools developed in the field of Vision Analysis (see [35]) to this problem.
As stated in equation 2, we define a probability term for each Q_{u,v} as proportionate to exp(ψ_{u,v}), where the potential function ψ_{u,v} depends only on the state of the local neighborhood of interactions ∂_{u,v} denoted by q_{∂ u,v}.
The single parameter and full parameter approaches both define the local neighborhood ∂_{u,v} as the set of interactions which are immediate neighbors in the physical network. Both approaches specify the potential function Ψ over cliques of size 1 and 2 in the graphical model. However, the single parameter and full parameter approach define ψ_{u,v} differently.
Potential function dependent on neighbor state only
We use the ccolor coding distribution [11] that assigns random variables to one of a discrete set of colors of size c. The Ising model is a special case of the ccolor coding distribution for c=2 colors, the active state A(Q_{u,v})=1 and the nonactive state A(Q_{u,v})=0.
The Gibbs total energy function is defined over all pairsite cliques (cliques of size 1 and 2), as
where n_{0} is the number of interactions with state 0, n_{1} is the number of interactions with state 1, and n_{0,1} is the number of interactions with different states, and Ψ=(γ_{0},γ_{1},β). There is a normalization constant omitted from this equation.
The conditional probability of a RV Q_{u,v} taking a given state k∈{0,1} is:
where
where {\eta}_{u,v}\left(\stackrel{\u0304}{k}\right) denotes the number of neighbors of Q_{u,v} having a state ≠ k.
Ψ={γ_{0},γ_{1},β} and the parameters in Ψ are computed with a maximum likelihood estimator discussed in section “Mstep”.
Potential function as a fully parametric model dependent on neighbor state and mechanism
In the full parameter approach the potential function Ψ now depends on the state and mechanisms of the neighbors of Q_{u,v}. Each interaction can be active or inactive, but will also be assigned a mechanism imported from Metacore which exists in the original network, denoted IM, i.e., I M={B,C,C M,+P,−P,T,T n,Z,T r,M}. Each interaction can therefore be in 2∗I M states. Lets call this new state space I M_s t a t e, e.g.,
The model now requires the ccolor method for c>2.
We reduce the state space for each interaction as follows. We first introduce some terminology. For each state in the state space k∈I M_s t a t e, we can describe state “k” as having an interaction mechanism component denoted “IM(k)” and an activity level component denoted “A(k)”. Similarly, we described RV Q_{u,v} assigned to state k as having the same two components. For example, if q_{u,v}=B_{0}, it consists of I M(Q_{u,v})=B and A(Q_{u,v})=0. Metacore makes a hard assignment of a mechanism to each interaction I_{u,v} in the original network. This means that its corresponding RV Q_{u,v} in practice can only ever be in two states for k∈I M_s t a t e, which are the active and nonactive states where the interaction mechanism component of k is the annotated value of that mechanism in the knowledge database; i.e., I M(k)=I M(I_{u,v}),A(k)=1 and I M(k)=I M(I_{u,v}),A(k)=0. In graphical model and probability language, this means that the conditional likelihood μ(Q_{u,v}=k)=0 where I M(k)≠I M(Q_{u,v}). For example, if I M(Q_{u,v})=M (a MicroRNA binding interaction), then μ(Q_{u,v}=M_{1})∈(0,1) and μ(Q_{u,v}=M_{0})∈(0,1), and μ(Q_{u,v}=B_{0})=μ(Q_{u,v}=B_{1})=μ(Q_{u,v}=+P_{0})…=0. This reduces the nonzero state space for each interaction and therefore the number of conditional likelihood terms we must calculate for the RVs in Q.
Under the full parameter model, we have parameters γ_{ k } for each state k in I M_s t a t e and parameters β_{k,l} for each pair of states k and l∈I M_s t a t e. This would give a total energy function:
where n_{ k } is the number of interactions in state k, and n_{k,l} is the number of distinct neighbor pairs colored (k,l).
The conditional likelihood function is:
where
where β_{k,l}=β_{l,k} and η_{u,v}(l) is the number of neighbors of Q_{u,v} having state l.
Many of the networks we are examining are smaller than 1000 nodes, and the original network is fairly sparse (small number of edges). Learning parameters from such small training data could lead to overfitting the parameters, so we reduce the number of parameters by setting β_{k,l} to zero where k and l have different activity state components, i.e., A(k)≠A(l). The remaining nonzero β terms therefore include only terms where states k and l possess the same activity state components.
In the reduced parameter format, we say \Psi =\{{\gamma}_{{s}_{a}},{\beta}_{s,t}\} for a∈{0,1},s∈I M,t∈I M and equation 8 becomes:
where {\eta}_{u,v}\left({t}_{\u0101}\right) is the number of neighbors of node Q_{u,v} with mechanism t not in state a.
The parameters in Ψ are computed with a maximum likelihood estimator discussed in section “Mstep”.
EM inference and learning
We implemented the inference and learning algorithm using the expectationmaximization (“EM”) algorithm to find the value of latent variables in our model [36, 37]. The EM algorithm has the advantage that each step of the algorithm increases the complete data log likelihood function (see [38]). In the work of Wei and Li [9], the inference step in the EM algorithm is performed with iterative conditional mode (ICM) algorithm [39].
In the EM algorithm, we try to find the state of latent variables A(Q_{u,v})∈{0,1} which maximizes the expected value of the complete data log likelihood function.
The expected complete data log likelihood function combines the noise model with the MRF component as follows:
where {q}_{{\partial}_{u,v}} is a vector of RVs, where each RV corresponds to the state of an interaction in the set of neighbours ∂_{u,v} i.e., {q}_{{\partial}_{u,v}} is a vector over all the possible states of the neighbors of Q_{u,v}, current estimates of {Θ,Ψ} denoted as \{\widehat{\Theta},\widehat{\Psi}\}, and \mu \left(A\right({Q}_{u,v})=jR,\widehat{\Psi},\widehat{\Theta}) is the posterior marginal probability of A(Q_{u,v}) calculated with previous parameter estimates.
The EM algorithm iterates calculating the posterior marginal distributions with maximizing the complete data log likelihood function to find the values of parameters {Θ,Ψ} which optimize the function.
Expected value
In the inference step (the Estep), we calculate the posterior distribution of the latent variables given by \mu \left(A\right({Q}_{u,v}\left)\rightR,\widehat{\Theta},\widehat{\Psi}).
With only a single parameter, calculation of the posterior distribution for latent variable Q_{u,v} becomes (considering only the MRF component):
where {q}_{{\partial}_{u,v}} is a possible realization of RV vector {q}_{{\partial}_{u,v}}, and {q}_{{\partial}_{u,v}}=\stackrel{\u0304}{j} is the number of interactions not in state j in the set realization {q}_{{\partial}_{u,v}}.
To simplify the calculation, we use a heuristic modification of belief propagation adopted by Letovsky and Kasif [18]. Instead of summing over each possible neighbour realization, we calculate the expected number of neighbors in state \stackrel{\u0304}{j} by using current values of the posterior distribution μ(A(Q)). These values are used to calculate a new posterior calculation for μ(A(Q_{u,v})).
where
i.e., {E}_{{\stackrel{\u0304}{j}}_{u,v}} is the expected number of neighboring interactions in active state \stackrel{\u0304}{j} based on current posterior distribution.
Calculation of the posterior distribution for the full parameter model modifies equation 12 so that γ, β and {E}_{{\stackrel{\u0304}{j}}_{u,v}} become vectors, and the energy function appears as in equation 9.
Mstep
In the M step we estimate parameters {Ψ,Θ} by maximizing the expected complete data log likelihood function in equation 10.
To find the maximum likelihood estimate (MLE) for Θ={r_{ α }}, we set the partial derivative of the complete data log likelihood function to zero, i.e., F= \frac{\mathrm{\partial E}\left(\phantom{\rule{1pt}{0ex}}\mathit{\text{log}}\phantom{\rule{1pt}{0ex}}\right(A\left(Q\right),R\Psi ,\Theta )}{{\partial}_{\Theta}}=0, and the Ψ term cancels out. Thus the expected log likelihood term becomes for Θ:
Given Θ contains r_{ α } which only appears in the maximum likelihood term when j=1, we can set maximum likelihood for Θ=r_{ α }.
Another option is to rank the probability (rank \mu \left(A\right({Q}_{u,v})=1R,\widehat{\Psi},\widehat{\Theta})) to weight the likelihood function. This can provide a more stable estimate when many RVs have large probabilities, by providing the largest weight to those Z_{u,v} values with the highest ranked probabilities.
To find the max likelihood assignment of Ψ, taking the partial derivative with respect to Ψ, the Θ terms cancel out. Maximum likelihood estimation of the parameters in Ψ must take into account the partition function. Solving maximum likelihood becomes intractable, and thus we use we use pseudolikelihood (PL) approach[40]. The pseudo likelihood term is:
where \mu \left(A\right({Q}_{u,v})=j{E}_{{\stackrel{\u0304}{j}}_{u,v}},\Psi ) is set out in equation 12.
The learning and inference algorithm is as follows, where the while loop is iterated until convergence of interaction state assignment is reached.
Algorithm 1 EM ALGORITHM FOR ACTIVE SUBNETWORK RECOVERY WITH HEURISTIC ESTEP (R)
Results and discussion
Validation using simulated correlation data for GeneGO pathway maps
To validate the performance of our model, we used known pathways downloaded as GeneGO Pathway Maps, from which we create active interactions as described below. Our aim is to recover the set of interactions in the original active subnetwork(s), starting with the original network and simulated correlation data for simulations k∈N. We term the set of interactions in the original active subnetwork I^{∗}. We use four different algorithms to recover a set of active interactions for a simulation k A_{ k }; A_{ k } ⊆I. We evaluate the success of each of the four algorithms in comparing A_{ k } to I^{∗}.
The algorithms evaluated are the single parameter model (see section “Potential function dependent on neighbor state only”), the full parameter model (see section “Potential function as a fully parametric model dependent on neighbor state and mechanism”), JActiveModules [1] and a “maximum likelihood approach”. JActiveModules Cytoscape plugin is popular, widely used and often used for comparison purposes by other active subnetwork researchers (e.g., see [14]);. The maximum likelihood approach uses only the maximum likelihood configuration of states from optimizing the likelihood function from the noise model specified in equation 3. This method uses no prior information from a MRF.
Generation of original active subnetworks
To generate the active subnetworks, we recreate a GeneGO Pathway Map canonical Pathway Map using the Build Networks tool on the map Network Objects in Metacore with the Direct Interactions algorithm. This contains the “pathway interactions”. We then expand the pathway network with Metacore tools to add other “expanded interactions”, to form the final original network G.
We then generate the true active subnetwork within the original network as follows. We first describe the characteristics of network where we expect large performance gains to be observed using the full parameter approach over the single parameter approach.
Formally, we require that:

1.
for some mechanismmechanism pairs (e.g., {M,T R}, interactions of the first mechanism have on average, of their neighbors of the second mechanism, a greater number are in the same activity state as the subject interaction than in a different activity state, and viceversa (“correlated pairs”); and

2.
for other mechanism mechanism pairs (e.g., {M,B}, interactions of the first mechanism, have on average, of their neighbors of the second mechanism, a greater number which are in a different activity state, and viceversa. (“noncorrelated pairs”)
We export this original network to Cytoscape and into R. For simplicity, we reduced the number of interaction mechanisms to I M=3, filtering interactions not belonging to these mechanisms. We created two classes of interactions, where we assume interactions within each class may work in concert to achieve a biological process or molecular function. Thus, for each of our simulations, one class had two mechanisms, while the second class had only one mechanism. e.g., assume an original network has I M={M,T R,B}, class 1 is {M,T R} and class 2 is {B}.
Beginning with the pathway interactions, we assign interactions in the first class {M,T R} to the active state with a 90% probability, and those in the second class {B} to the active state with a 10% probability. From the expanded interactions, we assign interactions in the second class (e.g., B) to the active state with a 90% probability, while interactions in the first class are assigned with a 10% probability. (the “90/10” rule). This creates a network with the desired mechanismmechanism correlations.
We created N simulations, where for simulation k, we simulated expression correlation data r_{ k }, using a Fisher transformation from a normally distributed random variable (see section “Noise model”), where active interaction in I^{∗} have a mean of 0.7, while the remaining nonactive interactions have a mean of 0.
We initialized our program with a vector of initial interaction states q_{0}, by performing a statistical test on the simulated correlation data.
To generate results for simulation k, we input r_{ k } and G (the original network), and generated a final system realization q_{ k }, corresponding to a set of active interactions A_{ k } in the original network. We then compare A_{ k } against I^{∗} to evaluate the performance of the 4 algorithms in terms of sensitivity, specificity and overall percentage correct.
The validation approach is described in a stepwise process diagram in Figure 3.
GeneGO pathway maps used in simulations
We performed the simulation experiments using three GeneGO Pathway Maps: VEGF signaling and activation (VEGF Sig), Cell adhesion:Integrin mediated cell adhesion and migration (Cell adhesion), and Blood Coagulation. Additional files 1, 2 and 3 contain the GeneGO representation of these Pathway Maps.
We created the original active subnetworks from the GeneGO Pathway Maps using the 90/10 rule as described in “Validation using simulated correlation data for GeneGO pathway maps”. This created original networks with the following specifications. For the VEGF network: 1065 interactions (635 active) I M={M,B,T R}, active interactions remaining active with 90% probability (class 1) : {M,T R}; nonactive interactions becoming active with 90% probability (class 2): {B}; i.e., we postulated the active subnetwork containing a region with high transcription and microRNA activity in the first instance, and region with high binding activity in the second.
For the cell adhesion network: 344 interactions (200 active); I M={+P,−P,T R}, active interactions remaining active with 90% probability (class 1): {+P,−P}; nonactive interactions becoming active with 90% probability (class 2): {T R}; i.e., we postulated an active subnetwork containing a region with much phosphorylation and dephosphorylation activity, and a region with regulatory interactions.
For the blood coagulation network: 94 interactions (71 active); I M={C,B,+P}, active interactions remaining active with 90% probability (class 1): {C,B}; nonactive interactions becoming active with 90% probability (class 2): {+P}; i.e., we postulated an active subnetwork containing a region with binding activity and a region with high cleavage activity.
Parameter initialization
When generating results, we initialized Ψ as (γ_{0}=1,γ_{1}=1,β=2) for the single parameter model. For the full parameter model, we set all {\gamma}_{{s}_{a}} for s∈I M,a∈{0,1} values to be 1, while β_{s,t} for s∈I M,t∈I M were set to 2 for s=t to set slight encouragement for a pair of neighboring interactions of the same mechanism to be in the same state, and to 0 otherwise.
Method comparison and evaluation
The single parameter approach as implemented by Wei and Li, and JActiveModules, are node based methods. They are designed to find active subnetworks in a gene or protein network when the gene expression signal is observed and is a feature of the nodes in the network. However, as described, our method is designed to find active subnetworks when a strong correlation of expression over time between two neighboring genes is observed, and this correlation is a feature of the interactions in the network. Therefore, the scoring function in our method contains an edgebased measure.
Therefore, to provide a fair comparison of our method to the single parameter approach, and JActiveModules, we convert their scoring function to an edgebased measure. For the single parameter approach, we simply reimplement the algorithm to create a neighborhood function over edges rather than nodes as described above in section “The MRF component”. In the case of JactiveModules, we convert the edges in the network to nodes, and nodes to edges. That is, each interaction in the original network becomes a node with a correlation score associated with that node. It is then easy enough to run JActiveModules on the new graph. For the p values, we do a statistical test on the N=5 simulated r_{ k } values, using n=5 for the number of time points (samples) (as above).
In JActiveModules, we run the module finder over all p values from all N=5 simulations. We use simulated annealing as a search method with default parameter values. We switched off “regional scoring” because this feature avoids finding regions active in the case where several of a hubs genes are switched on. Our simulated dataset assumes precisely this scenario: that is, that hubs are very influential on target nodes, and therefore we want the state of one hub target to influence the state of another hub target.
We run JActiveModules module finder 3 times. For each run, we merge the resulting significant modules (modules with a Z−s c o r e>3) into a single module. We export the 3 resulting modules and load the resulting subnetworks into R for performance analysis.
When we ran the full parameter approach for the cell adhesion and blood coagulation pathways, we used only two bias parameters for γ_{ k } where k∈{0,1} corresponding to the active and nonactive states of the network. We limited the number of bias parameters to avoid overfitting, since the two networks were much smaller than the VEGF signaling network, and so do not need separate overall active state weightings per mechanism.
One simulation in each of the cell adhesion and the blood coagulation pathways resulted in runaway reinforcement where all interactions were switched to the one state. We excluded these simulations from our summary of results below. Also, one simulation did not converge in the cell adhesion pathway in the maximum number of iterations, so we excluded this simulation also. (As EM is guaranteed to converge, it would have converged with a larger maximum number of iterations.) For the blood coagulation network, we used the rank weight variation when calculating the maximum likelihood estimate for the noise function (see Section “Mstep”.
Tables 2, 3 and 4 contain details of the sensitivity,specificity and percentage correct for the methods and pathways.
When comparing the full parameter and single parameter models to the maximum likelihood approach, we must consider the noise in the simulated correlation data, which depends on the sample size n. When n is small, there is a large variation in the simulated correlation values for each interaction. In this case, the correlation statistic is less indicative of the true interaction state, and incorporating the local neighborhood activity states via the MRF component becomes more important. When n is large, the simulated correlation values more accurately reflect the activity state of interactions in the original network, and a statistical test on the correlation will provide a good indication of whether the interaction is active (regardless of neighboring interactions). In this scenario, we might expect the maximum likelihood performance will improve. However, we used n=5 in our simulations, which is a reasonable estimate of the number of samples often used in biological experiments.
For the VEGF signaling and activation network, we found that with respect to total correct interactions recovered, the full parameter approach was by far the most successful (mean of 82.01% correct), followed by the singleparameter approach (mean of 78.03% correct), followed by the Maximum Likelihood approach (mean of 74.36% correct), followed by JActiveModules (mean of 64.10% correct). On the other hand, for the Cell adhesion network, JActiveModules was slightly more successful than (but comparable to) the full parameter approach in recovering total correct interactions, with means of 84.69% and 83.91% correct respectively. Possibly, the smaller size of the network (384 interactions compared with the VEGF signaling network size of 1065 interactions), meant that there was a shortage of interactions belonging to each MM pair used to train the model. The full parameter model was however more successful than the single parameter model and the maximum likelihood approach. Similar results are seen in the Blood Coagulation Network.
While results are comparable to JActiveModules, the use of the MRFbased approach presents additional advantages in that parameter values can be analyzed to identify mechanism correlations in the network. Further, when MRF is teamed with other tools such as a diffusion kernel [8], the accuracy may improve further, bringing advantages of both a modelbased approach, efficiency and excellent accuracy.
Comparison of global and local feature properties of networks
We are interested in comparing how well the methods were able to recover network characteristics of the original active (or nonactive) subnetwork.
We are most interested in seeing the advantage of incorporating a feature that searches for mechanismenriched regions into active subnetwork finding algorithms. The fairest way to see this advantage is to compare characteristics of networks generated by an algorithm that incorporates this feature (the full parameter approach) to networks generated by the same algorithm without this feature (the single parameter approach). Specifically, does the full parameter approach more successfully recover topological characteristics present in the original active subnetwork than the single parameter approach? Therefore, we do not further analyze the characteristics of networks generated by JActiveModules or the Maximum Likelihood approach.
We use the Cytoscape plugin NetworkAnalyzer [41] to analyze global characteristics of the networks generated from the full parameter and single parameter approaches, and compared these to the characteristics of the original active subnetwork. We considered networks formed from interactions that were identified as active in at least 80% of the simulations (4/5).
We use the VEGF signaling and activation network to perform our analysis. Because of the way we artificially created the active subnetwork from the original network, most of the active subnetwork is made up of interactions of the binding mechanism (B), while the nonactive subnetwork contains many interactions of all mechanism (B, TR and M). We therefore looked at both the active subnetworks recovered, and the nonactive subnetworks recovered, which we considered to be active under other conditions and therefore still of interest.
For the active subnetworks, we first considered the betweenness centrality characteristics. The betweenness centrality (BC) of a node reflects the amount of control that this node exerts over other nodes in the network. The original active subnetwork contained a node for Entrez Gene ID 5295 (PI3K reg class IA) which had the highest BC value in the original network (BC: 0.24). The active subnetwork recovered by the full parameter approach has a BC of 0.20, while the active subnetwork recovered from the single parameter has a BC of 0.15 for the same node. The BC measure favors nodes that join dense communities, thus as expected by theory, the full parameter approach is better able to recover the dense regions of the original activesubnetwork (i.e., those dense in neighboring interactions of particular mechanisms), and is better able to recover properties of the nodes that connect these regions.
Similarly, stress centrality (SC) measures the number of shortest paths through the node. A node has a high stress if it is traversed by a high number of shortest paths. Entrez Gene ID 5295 also has the highest SC value in the original active subnetwork (SC:16335). The parameter value was recovered closely by the full parameter approach (SC:17209), while the single parameter approach network had a SC of (SC:4711) for the same node.
We also looked at the clustering coefficient (CC) of the 3 active subnetworks. The CC of a node is a measure of how well connected neighbors of a the node are. The CC distribution gives the distribution of the average of CC values for all nodes with k neighbors. A CC distribution that follows a strong power law (i.e., the CC value of a node drops off quickly with the number of neighbors of the node) can also indicate the subnetwork contains many dense regions, connected by individual nodes. Fitting a power law creates a linear relationship between the CC value against the number of neighbors of a node. The Rsquared value measures the correlation between the two variables. After fitting a power law to the CC distribution, we found the original active subnetwork had an Rsquared value of 0.775, the full parameter approach had an Rsquared value of 0.646 and the single parameter approach had an Rsquared value of 0.539. That is, the full parameter approach was better able to capture the modular nature of the original active subnetwork.
We then examined some characteristics of the nonactive subnetwork, which contained interactions of type B, TR and M, and was thus in part a regulatory network. An important topological property of a biological network is outdegree distribution, since this can provide evidence of hubs. Analysis of outdegree distribution revealed Entrez ID 4790 (NFkB) was the node with the largest outdegree in the network (outdegree of 31). The active subnetwork recovered using the full parameter approach has an outdegree of 35 while the single parameter approach network has outdegree 18 for the same node. While the full parameter method switched too many adjacent interactions of NFkB to the nonactive state, it achieved the outdegree value closest to the value of the node in the original nonactive subnetwork. Similarly, node 407035 (microRNA 31) has outdegree 16 in the original network, 17 in the full parameter approach network, and 14 in the single parameter approach network.
Similarly, node with Entrez ID 6401 (eselectin) has indegree of 16 in the original active subnetwork, which is the highest indegree in the original network. The same node has indegree 16 in the full parameter approach network and indegree 12 in the single parameter approach network. Thus the full parameter approach was better able to capture the nature of the multiinput regulation of eselectin.
With regard to stress centrality (SC) parameters in the nonactive network, the original network had 6 nodes in the bucket containing the nodes with the largest SC values, i.e., SC values above 10^{3}, while the full parameter approach network had 5 nodes in this bucket, and the single parameter approach network had 0 nodes in this bucket. Again, the full parameter approach is best able to capture the nature of modular regions, which require the presence of “stressed” nodes, through which other nodes pass. Looking at some nodes with large SC values, cmyc (Entrez ID 4609) has SC of 3211 in the original network, SC 3234 in the full parameter network, and only SC of 735 in the single parameter network. Showing a similar pattern, cJun/Fos (Entrez ID 3725) has an SC of 3327 in the original network, 2162 in the full parameter network, and only SC of 243 in the single parameter network.
The Cytoscape files containing the full analysis of networks generated by both methods for both pathways are available upon request to the authors.
Application to angiogenesis model
Hahn et al. previously reported on studies involving microarraybased gene expression profiling and analysis of endothelial cells plated on a wellcharacterized threedimensional collagen gel model of in vitro angiogenesis (“the 3D model”) [42]. Gene expression levels were detected at times = 0.5, 3, 6, 24 hours after stimulation using microarray technology. We call this set of experiments the “mRNA angiogenesis array”. The mRNA angiogenesis array data is available at NCBI Gene Expression Omnibus [43] (Accession GSE779).
Subsequently, the angiogenesis 3D model experiment was repeated with a miRNA array and expression levels recorded at times = 0.5, 3, 6, 12, 24 hours (unpublished observations, Gamble JG). We call this the “miRNA angiogenesis array”.
We uploaded the gene list from the mRNA angiogenesis array and the miRNA angiogenesis array to Metacore and generated a network using the Build Networks tool with the Analyze network algorithm. We expanded this network to include interactions that belong to canonical Pathway Maps known to regulate the angiogenesis program. We included maps corresponding to integrinmediated pathways because vascular integrins are essential regulators and mediators of physiological and pathological angiogenesis [44, 45]. The maps used are “cytoskeleton remodeling Integrin outsidein signaling” and “Cell adhesion Integrin mediated cell adhesion and migration”. We named the network “Original Angiogenesis Network”, and imported the network into Cytoscape and R.
We then generated correlation scores for the data. As there were only four experimental time points consistent between the gene array and the microRNA array, we generated a correlation score artificially.
Specifically, we created a list of significant genes in R using the topTable command in the limma gene expression package [46] for each time point, 0.5, 3 hr, 6 hr and 12 hr (regardless of whether the gene was over or under expressed significantly at that time point). We then generated the artificial correlation score to each interaction based on the following criteria:

1.
If neither gene was significantly expressed at any time point, score : 0

2.
If at least one gene was significantly expressed at any time point:

Create a binary vector for each gene specifying whether it had significant expression at times 0.5, 3 hr, 6 hr, 24 hr.

Perform a binary “and” operation on the two vectors.

Let subscore=length of the number of 1s in the result (i.e., number of common time points where the two genes either side of the interaction are coexpressed significantly).

Otherwise, interaction score : 0.4 + subscore/(5*2)  i.e., equally spaced between 0.4 and 0.8.

As we artificially generated correlation scores described above, the application of our algorithm to this dataset merely gives us an indication of which interactions are active, and cannot be considered to be a statistical application.
We ran the single parameter and the full parameter algorithms on the Original Angiogenesis Network using the artificial correlation scores. We identified interactions recovered as active under the full parameter but not the single parameter approach (“FP extra interactions”), and those recovered as active under the single parameter but not the full parameter approach (“SP extra interactions”). We uploaded the full set of active interactions, and the extra interactions, for both algorithmic approaches to Metacore for further analysis. There were 12 FP extra interactions and 9 SP extra interactions in total.
Many of the interactions recovered by the two methods appeared in signaling cascades common to GeneGO Pathway Maps that are active during the angiogenesis process. The relevant GeneGo Pathway Maps contain pathways that regulate the cell adhesion process via the integrins. The GeneGO Pathway Maps we considered are: Cell Adhesion  ECM Remodeling; Cell AdhesionIntegrinmediated adhesion and migration, and Cytoskeleton RemodelingIntegrin OutsideIn Signaling. Integrins are heterodimeric adhesion receptors composed of alpha and betasubunits. It is known that at least 18 distinct alpha subunits and 8 or more beta subunits lead to generation of 24 alpha/beta heterodimeric receptors. Most integrins recognize extracellular matrix (ECM) proteins, such as Laminin, Fibronectin, Vitronectin and Collagen (types I, II and IV) [47].
Looking at the FP extra interactions, only the full parameter approach recovered the interaction “ITGB B Talin” (beta integrin unit binding to Talin). Talin binding to integrin beta tails is a common element of the signaling cascades in the aforementioned Pathway Maps that control integrin activation. The binding step causes the integrin receptors to change conformation and increase binding affinity to ECM proteins. Collagen binding to integrins is part of the cytoskeleton remodeling. While both full parameter and single parameter approaches detected binding of Collagen II to alpha2/beta1 integrin, only the full parameter approach detected Collagen IV binding to the same integrin.
Looking further downstream in the Cytoskeleton RemodelingIntegrin OutsideIn Signaling pathway, both approaches failed to recover the phosphorylation of MEK1(MAP2K1) and MEK2(MAP2K2) by cRaf1, or the subsequent phosphorylation by both kinases of ERK1/2. This cascade leads to the activation of the cJun/cFos complex transcription factor that is required for cell proliferation. However, the full parameter approach did detect Tcf(Lef) activation of CyclinD1, which is required for cell cycle activation. There were several additional transcription regulation (TR) interactions detected for Tcf(Lef) in the full parameter method but not the single parameter method, which is consistent with the large parameter value learned for MM pair “TRTR” (5.04). The activation of Tcf(Lef) together with the learned strong correlation for TRTR, indicating such interactions tend to be coregulated, meant that other Tcf(Lef) target interactions were detected including SOX2 and hsalet7c.
Further, only the full parameter method detected the interaction A R P2/3→A c t i n C y t o s k e l e t o n, which is required to activate actin polymerization [48]. Only the full parameter method recovered the interaction C R K→R A C1. Activation of Rac1 leads to membrane ruffles, formation of lamellipodia and cell migration [49]. The only interaction recovered by the single parameter approach in the cell adhesion and cytoskeleton remodeling pathways was GSK3 activation of betacatenin. In all, the full parameter approach was more successful at recovering interactions within this group of GeneGO Pathway Maps, while the extra interactions recovered by the single parameter approach do not belong to any particular pathway. The large value for MM pair parameter for “BB” (2.63) meant the full parameter approach had a tendency to keep the binding interactions which characterise integrin binding to ECM proteins in the same state as oneanother, allowing recovery of more active binding interactions in this pathway.
Recent evidence suggests the miR29 family consisting of miR29a, miR29b and miR29c are antiangiogenic [50]. Both approaches recovered miR29 targeting of beta integrin subunit (ITGB1) in the active subnetwork. The Original Angiogenesis Network also contained an interaction from the GeneGO database showing miR29b targeting of collagen IV gene COL4A1 [51, 52]. This interaction was not recovered by either the single parameter or full parameter approach. We might have thought the full parameter approach would detect this interaction, since miR29b is already considered to be active in its role in inhibiting the proangiogenic integrins. However, in this situation, there was no evidence of gene expression of the collagen genes in our input gene list, and thus possibly the low artificial correlation score (the noise component) was more influential than the local neighborhood influence (MRF component) in this circumstance.
Figure 4 contains the interactions from GeneGO Pathway Map: Cytoskeleton Remodeling  Integrin Inside Out Signaling, overlaid with the extra interactions detected using the full parameter approach.
Application to mouse organogenesis data
In order to test our method using actual Spearman correlation values in the likelihood function, rather than our artificial scoring system used on the angiogenesis data, we applied the method to data from a developmental mouse lung organogenesis study [53], downloaded from NCBI Gene Expression Omnibus (GEO) [43], Accession GSE20954 and GSE21052. As the experiments were performed using Affymetrix chips with known 45,000 probes (mRNA data) as opposed to the home made chips, we had expression data matching nearly all Network Objects in the Metacore networks, not only the socalled seed nodes. Secondly, we had a stronger signal when calculating Spearman correlation coefficients across interaction expression data.
To create a set of mRNA and miRNA genes to upload to Metacore in our list we wished to identify miRNAs and mRNAs that were expected to regulate the same processes. In particular, we wanted lateonset genes that had high expression in the adulthood stage, so we could compare our own biological analysis of resulting networks with the biological analysis of similar gene sets in the original network. In this work, cluster 6 mRNAs and cluster 1 miRNAs were considered to be late onset genes. For the miRNA array, we used the clusters generated by [53] (provided to us by the authors) and selected miRNA cluster 1, which also had a peak late onset adulthood among member miRNAs.
To closely reproduce their results, we clustered the 11220 mRNA probes identified as active in [53]. We selected a subset using decideTests in the limma package in R in the contrast PN30.adultPN10 as active. We then clustered the Affymetrix probe expression values over the 7 time points using hierarchical clustering in R (hclust). We created a representative expression profile for each cluster by finding the mean expression value of all probes in the cluster at each time point (see Additional file 4). Among our clusters, the representative profile for cluster 2 (containing 850 probes) showed a peak at the late adulthood time. We converted the probe IDs to Entrez Gene IDs using tools in the package GEOQuery [54] and limma [46]. We then input the two sets of late onset genes for the miRNA and mRNA clusters into Metacore and used the Build Networks tool with the “Analyze network” algorithm to create a network in Metacore, which we called “Original Mouse Lung Organogenesis (MLO) Network”.
Some difficulties arose in creating a correlation score for each interaction because Metacore network interactions are between Network Objects which map to multiple Entrez Gene IDs, which in turn map to multiple Affymetrix probe IDs. As the expression data is matched to Affymetrix probe IDs, some choice was required when selecting which probes’ expression data should be used to create a correlation score for an interaction between two Network Objects. First, we created a correlation matrix for the Entrez IDs, and where there were multiple probes matching one Entrez Gene ID, we selected the probe, which had the largest mean correlation score against each other probe in the network. That is, we calculated the probes correlation with all the other probes matching genes in the network, and selected the probe with the largest mean value to represent the Entrez ID. When creating a correlation vector to match the interaction between two Network Objects, where there were multiple Entrez Gene IDs matching the Network Object, we took the mean of the correlation values to represent the interaction.
We exported the Original MLO Network from Metacore into Cytoscape and into R. The resulting network had 99 unique nodes and 106 interactions. We imported the correlation data into R and ran the single and full parameter approaches on the data, using the rank weight estimate. We adjusted the noise model slightly, since we now had correlation values <0, and so we tested the absolute value of the correlation coefficient.
Both the full parameter and the single parameter approaches found some interactions present in the Cytoskeleton Remodeling  Keratin Filaments Pathway Map. This map shows the components of the intermediate filaments cytoskeletal system, that interact with actin and microtubule filament systems to control cell assembly. Binding proteins such as Plectin 1 and Desmoplakin coordinate the interconnection of the three filament systems by binding to filament systems. For example, Plectin 1 binds to Keratin 5/14 complex in the Pathway Map and the Metacore network [55]. Kinases including CDK1 (p34) regulate the activity of these binding proteins and IFs. In particular, only the full parameter approach recovered CDK1(p34) inhibition of Plectin 1 [56] by phosphorylation and also via inhibition of GRB2 which binds to Plectin 1 [57]. These interaction are present in the Cytoskeleton Intermediate Filaments process network and the Keratin Pathway Map.
The full parameter approach also switched on a cluster of phosphorylation interactions by the two kinases TRPM6 and TRPM7 of the myosin superfamily, including MYH14, MYH9 and MYH10. All three myosin Network Objects were found to be regulated by both kinases. Myosins are actinbased motor proteins that function in the generation of mechanical force in eukaryotic cells. Nonmuscle myosin heavy chain proteins (MYH9, MYH10, MYH14) are involved in control of cytokinesis, cell motility and maintenance of cell shape. The three myosins are a group relation of MYHC (see in the figure). MYHC functions in skeletal muscle contraction. Interestingly, smooth muscle contraction was found to be an overregulated category for cluster6 (late onset mRNAs) in the study of Dong et. al, and thus this finding is consistent with the findings in the original study.
The single parameter approach only detected the interaction TPRM6 phosphorylation of MYH14, while as mentioned the full parameter approach recovered 7 phosphorylation interactions of the myosin proteins in this cluster. The reason for the more successful detection of the phosphorylation of the myosin proteins by the kinases can be found by examining the parameter for mechanismmechanism pair {+P,+P} which was found to be the moderately high value of 0.85.
In the Original MLO Network, there were many additional miRNA interactions recovered as active in the full parameter approach, that were not recovered by the single parameter approach. These interactions are: “microRNA 30b” → “LIN28” (“M”), “microRNA 26b” → “CPEB2” (“M”), “microRNA 223” → “Galpha(q)specific peptide GPCRs, CCR1” (“M”), “microRNA 223” → “PLEKHM1” (“M”), “microRNA 34b ∗” → “WNT3” (“M”), “microRNA 34b ∗” → “Rab3” (“M”), “microRNA 667” → “MYH14” (“M”) and “microRNA 241 ∗” → “TTLL4” (“M”). The mechanismmechanism parameter for the {M,M} pair is 0.75, again a moderately high value.
A potential interaction worth further exploration is the regulation by microRNA 241 ∗ of TTLL4, which is a polyglutamylase that preferentially modifies betatubulin and therefore regulates the formation of microtubules that control cytoskeleton stability and dynamics. A further interaction of interest is miRNA 34b ∗→ WNT3, as the p53miR34 ∗ network is known to regulate the canonical Wnt signaling pathway in organ development and human cancer [58].
Some of the interactions annotated in Metacore of mechanism “M” are supported by sequence based predictions and are therefore low trust interactions. They do not appear in GeneGO Pathway Maps or other canonical pathways. For example, “microRNA 667” → “MYH14” (“M”) and “microRNA 241 ∗” → “TTLL4” (“M”) are both low trust interactions in the GeneGO knowledge base, but are recovered using the full parameter approach. By highlighting low trust interactions using the full parameter approach, we are able to guide the user to possible new interactions active in their data which regulate known processes and pathways.
Figure 5 shows interactions in the Original MLO Network identified as active using the full parameter approach, which were not identified as active using the single parameter approach.
Conclusions
We developed and implemented a method to find active subnetworks in a condition from an original network generated by Metacore. Our method is unique in that it learns the value of distinct parameters that express the relationship between a pair of interactions based on the two respective mechanisms of the pair. We compared our method to a previously published method, which was a simpler, more general, method using only a single parameter to express such dependencies, as well as to the popular active subnetwork recovery tool JActiveModules, and a straightforward maximum likelihood tool.
Our method was validated against these methods using original networks generated from GeneGO canonical Pathway Maps. We found our method have better performance than these three methods among networks meeting certain criteria, which we describe as MM Pair Rich Active Subnetworks (described in section “MM pair rich active subnetworks”). We applied our method to two sets of experimental data which both consisted of matching mRNA and microRNA timecourse expression data. We were able to find interactions belonging to biological pathways consistent with the experimental study in the full parameter approach, that were not detected with the single parameter approach.
Advantages of the full parameter approach
The full parameter method has several advantages over the single parameter approach. First, it is an edgebased method (rather than a nodebased method) which gives it some advantages over nodebased methods. Nodebased methods do not provide information as to which interactions from the original network participate in the condition. This is typically inferred by connecting the active nodes [1]. Edgebased methods provide additional information regarding which paths are active between nodes, and therefore describe exactly how the active subnetwork executes its functions. Second, analyzing a set of active nodes can provide an understanding of enriched functional categories of genes [59]. However, if we accurately know the active interactions, we can analyze network properties such as global topology properties, and local properties such as the presence of functional local components (motifs).
The second advantage is that we apply a heuristicEM algorithm for this probabilistic problem with a latent variable approach, which is a superior optimization method to the method invoking the ICM inference algorithm used in [35]. Third, as emphasized, we incorporate multiple finelytuned mechanismbased parameters in the scoring function. Indeed, our literature search suggests we are the first to design an active subnetwork scoring function that incorporates a neighborhood influence factor that varies according to a neighbor’s biological type or function.
Advantages of using MM Pair correlation parameters
The incorporation of multiple parameters to model mechanismmechanism pair effects provides many benefits. The first, is the potential for greater predictive accuracy so long as the complexity of the multiparameter model does not lead to overfitting. This method will have the greatest predictive accuracy in recovering active subnetworks in MM Pair Rich Active Subnetworks. Our method when applied to such networks will recover a wide range of parameter values, with larger values expected for pairs with corresponding II interactions that occur in the same region of the active subnetwork.
A second benefit of using the modelbased approach is the parameters representing the mechanismmechanism correlations provide insight into the biological function of the active subnetwork. If the active subnetwork is responsible for carrying out a biological function (e.g., adhering cells in the creation of new blood vessels), this function may broken up into parts (e.g., regulatory, signaling, protein binding), where those parts are executed through regions containing only a small set of all possible mechanisms. For example, in the Original Angiogenesis Network, a large parameter value for {T R−T R} pair (5.04) cluster of neighboring Transcription Factor interactions outgoing from Tcf(Lef) were found to be active by the full parameter approach. This suggests the existence of a region of the network responsible for carrying out a regulatory function.
Limitations and future work
There are several limitations to our approach. One limitation is that increasing the number of parameters may lead to overfitting in cases where the network only has a small number of II pairs corresponding to the mechanismmechanism pair for that parameter. This can be overcome by filtering the network to only include interactions belonging to mechanismmechanism pairs that have a minimum number of corresponding II pairs in the network.
Another limitation is that our noise model currently relies on calculating the similarity of gene expression between two components as a measure of the likelihood of an interaction, regardless of its mechanism. Some interactions belong to mechanisms which occur at the protein level, and it would be more appropriate to use other data sources such as proteinprotein interaction data, or binding assay data. For other interactions which occur at the transcription level, RNA sequence or array data is perhaps more appropriate.
A further limitation of our work is that it assumes that the genes matching interacting Network Objects will be positively or negatively correlated in their differential expression (i.e., activated and inhibited together) in the one condition, regardless of the annotated effect of that interaction (inhibitive or activating). This can be improved in future versions of our algorithm, by requiring a positive correlation for activating interactions and negative correlation for inhibitive interactions. Future work could also model expected expression behavior of genes in simple 3node network motifs, where such motifs are properly annotated, such as in GeneGO Metacore. For example, competitive binding versus cooperative binding could be modeled. Competitive interaction between two transcription factors, may mean that when one factor is active, the other is less likely to be active. This would improve accuracy over our current model which treats all neighboring transcription factor  target interactions equally.
Finally, a problem lies in that the algorithm currently learns parameters expressing a correlation between mechanismmechanism pairs across the entire network. Sometimes, correlations differ according to context, i.e., subcellular localization, regional function etc. A future improvement may limit the use of global parameters to local regions, i.e., only apply a parameter for BB mechanisms to a region of the network identified as protein binding.
This work is a first attempt at learning global rules expressing correlations between mechanismmechanism pairs, and future finetuning of this work would be a welcome extension.
References
 1.
Ideker T, Ozier O, Schwikowski B, Siegel AF: Discovering regulatory and signaling circuits in molecular interaction networks. Bioinformatics. 2002, 18 (Suppl 1): S233S240. 10.1093/bioinformatics/18.suppl_1.S233.
 2.
Guo Z, Li Y, Gong X, Yao C, Ma W, Wang D, Ly Y, Zhu J, Zhang M, Yang D: Edgebased scoring and searching method for identifying conditionresponsive proteinprotein interaction subnetwork. Bioinformatics. 2007, 23 (16): 21212128. 10.1093/bioinformatics/btm294.
 3.
Brietling R, Amtmann A, Herzyk P: Graphbased iterative Group Analysis enhances microarray interpretation. BMC Bioinformatics. 2004, 5: 10010.1186/147121055100.
 4.
Rajagopalan D, Agarwal P: Inferring pathways from gene lists using a literaturederived network of biological relationships. Bioinformatics. 2005, 21 (6): 788793. 10.1093/bioinformatics/bti069.
 5.
Nacu S, CritchleyThorne R, Lee P, Holmes S: Gene expression netework analysis and applications to immunology. Bioinformatics. 2007, 23 (7): 85010.1093/bioinformatics/btm019.
 6.
Ulitsky I, Karp R, Shamir R: Detecting diseasespecific dysregulated pathways via analsis of clinical expression profiles. Lecture Notes Comput Sci. 2008, 4955: 34710.1007/9783540788393_30.
 7.
Dittrich T, Klau W, Rosenwald A, Dandekar T, Muller T: Identifying functional modules in proteinprotein interaction networks: an integrated exact approach. Bioinformatics. 2008, 24 (13): i223231. 10.1093/bioinformatics/btn161.
 8.
Qiu Y, Zhang S, Zhang X, Chen L: Identifying differentially expressed pathways va amixed integer linearprogramming model. IET Syst Biol. 2009, 3 (6): 475486. 10.1049/ietsyb.2008.0155.
 9.
Wei L, Li L: A Markov Random Field model for networkbased analysis of genomic data. Bioinformatics. 2007, 23 (12): 15371544. 10.1093/bioinformatics/btm129.
 10.
Kindermann R, Snell J: Markov Random Fields and Their Applications. 1980, Providence: American Mathematical Society
 11.
Besag J: On the statistical analysis of dirty pictures. J R Stat Soc Ser B. 1986, 48 (3): 259302.
 12.
Han J, Bertin N, Hao T, Goldberg D, Berriz G, Zhang L, Dupuy D, Walhout A, Cusick M, Roth F, Vidal M: Evidence for dynamically organized modularity in the yeast proteinprotein interaction network. Nature. 2004, 430: 8893. 10.1038/nature02555.
 13.
Jansen R, Greenbaum D, Gerstein M: Relating wholegenome expression data with proteinprotein interactions. Genome Res. 2002, 12: 3746. 10.1101/gr.205602.
 14.
Qiu Y, Zhang S, Zhang X, Chen L: Detecting disease associated modules and proritizing active genes based on high throuput data. BMC Bioinformatics. 2010, 11: 2610.1186/147121051126.
 15.
Ma H, Schadt E, Kaplan L, Zhao H: COSINE:COnditionSpecIfic subNetwork identification using a global optimization method. Bioinformatics. 2011, 27 (9): 12901298. 10.1093/bioinformatics/btr136.
 16.
Jaimovich A, Elidan G, Margalit H, Friedman N: Towards and integrated protein protein interaction network: a relational Markov approach. J Comput Biol. 2006, 13 (2): 145164. 10.1089/cmb.2006.13.145.
 17.
Deng M, Cheng T, Sun F: Integrated probabilistic model for functional prediction of proteins. J Comput Biol. 2004, 11 (23): 463476. 10.1089/1066527041410346.
 18.
Letovsky S, Kasif S: Predicting protein function from protein/protein interaction data: a probabilistic approach. 2003, 19 (Suppl 1): i197i204.
 19.
Lee H, Tu Z, Deng M, Sun F, Chen T: Diffusion kernelbased logistic regression models for protein function prediction. OMICS, J Integr Biol. 2006, 10: 4055. 10.1089/omi.2006.10.40.
 20.
Wei L, Li L: A hidden spatialtemporal markov random field model for networkbased analysis of time course gene expression data. Ann Appl Stat, Volume 2. Edited by: Edited by of Mathematical Statistics I, Edited by of Mathematical Statistics I . 2008
 21.
Team RDC: R: A Language and Environment for Statistical Computing. 2009, Vienna: R Foundation for Statistical Computing
 22.
Shannon P, Markiel A, Ozier O, Baliga N, Wang J, Ramage D, Amin N, Schwikowski B, Ideker T: Cytoscape: a software environment for integrated models of biomolecular interaction networks. Genome Res. 2003, 13 (11): 24982504. 10.1101/gr.1239303.
 23.
Seger R, Krebs E: The MAPK signaling cascade. FASEB J. 1995, 9 (9): 72635.
 24.
Mann K: Biochemistry and physiology of blood coagulation. Thromb Haemost. 1999, 82 (2): 165174.
 25.
Yu H, Luscombe N, Qian J, Gerstein M: Genomic analysis of gene expression relationships in transcriptional regulatory networks. Trends Genet. 2003, 19: 422427. 10.1016/S01689525(03)001756.
 26.
Babu M, Teichmann S: Evolution of transcription factors and the gene regulatory network in Escherichia coli. Nucleic Acids Res. 2003, 31 (4): 12341244. 10.1093/nar/gkg210.
 27.
Lee R, Feinbaum R, V A: The C. elegans heterochronic gene lin4 encodes small RNAs with antisense complementarity to lin14. Cell. 1993, 75: 843854. 10.1016/00928674(93)90529Y.
 28.
Wightman B, Ha I, Ruvkun G: Posttranscriptional regulation of the heterochronic gene lin14 by lin4 mediates temporal pattern formation in C. elegans. Cell. 1993, 75: 855862. 10.1016/00928674(93)905304.
 29.
Bartel D, Chen C: Micromanagers of Gene Expression: The Potentially Widespread Influcence of Metwazoan MicroRNAs. Nat Rev Genet. 2004, 5: 396400.
 30.
Zhou X, Ruan J, Wang G, Zhang W: Characterization and identification of MicroRNA core promoters in four model species. PLoS Comput Biol. 2007, 3 (3): e3710.1371/journal.pcbi.0030037.
 31.
Shalgi R, Lieber D, M O, Pilpel R: Global and local architecture of the Mammalian microRNAtranscription factor regulatory network. PLoS Comput Biol. 2007, 3 (7): e13110.1371/journal.pcbi.0030131.
 32.
Hornstein E, Shomron N: Canalization of Development by microRNAs. Nature Genet. 2006, 38 (Suppl): s20s24.
 33.
Johnston RJ, Chang S, Etchberger J, Ortiz C, Hobert O: MicroRNAs acting in a doublenegative feedback loop to control a neuronal cell fate decision. PNAS USA, Volume 102. 2005, 1244912454.
 34.
Revelle W: psych: Procedures for Psychological, Psychometric, and Personality Research. 2009, [http://cran.rproject.org/web/packages/psych/index.html]. [R package version 1.076].
 35.
Li SL: Markov Random Field Modeling in Image Analysis, Advances in Pattern Recognition. 2009, London: SpringerVerlag
 36.
Dempster A, Laird N, Rubin D: Maximum likelihood from incomplete data via the EM algorithm. J R Stat Soc B. 1997, 39: 138.
 37.
McLachlan G, Krishnan T: 1997, New York: Wiley
 38.
Bishop C: 2006, New York: Springer Science and Business Media
 39.
Kittler J, F¨glein J: Contextual classification of multispectral pixel data. Image and Vision Computing. 1984, 2: 1329. 10.1016/02628856(84)900404.
 40.
Besag J: Statistical analysis of nonlattice data. Statistician. 1975, 24 (3): 179195. 10.2307/2987782.
 41.
Assenov Y: Computing topological parameters of biological networks. Bioinformatics. 2008, 24: 282284. 10.1093/bioinformatics/btm554.
 42.
Hahn CN, Su ZJ, DC J, Tsykin A, Waterman SR, Brautigan PJ, Yu S, Kremmidiotis G, Gardner A, Solomon PJ, Goodall GJ, Vadas MA, Gamble JR: Expression profiling reveals actively important genes and coordinatetly regulated signaling pathway genes during in vitro angiogenesis. Physiol Genomics. 2005, 22: 5769. 10.1152/physiolgenomics.00278.2004.
 43.
Edgar R, Domrachev M, Lash AE: Gene Expression Omnibus: NCBI gene expression and hybridization array data repository. Nucleic Acids Res. 2002, 30: 207210. 10.1093/nar/30.1.207.
 44.
Rüegg C, Dormond O, Mariotti A: Endothelial cell integrins and COX2: mediators and therapeutic targets of tumor angiogenesis. Biochim Biophys Acta. 2004, 1654 (1): 5167.
 45.
Rüegg C, Alghisi G: Vascular integrins: therapeutic and imaging targets of tumor angiogenesis. Recent Results Cancer Res. 2010, 180: 83101. 10.1007/9783540782810_6.
 46.
Smyth G: Linear models and empirical Bayes methods for assessing differential expression in microarray experiments. Stat Appl Genet Mol Biol. 2004, 3: Article 3
 47.
Lee J, Juliano R: Mitogenic signal transduction by integrin and growth factor receptormediated pathways. Mol Cells. 2004, 17 (2): 188202.
 48.
dos Remedios C, Chhabra D, Kekic M, Dedova I, Tsubakihara M, Berry D, Nosworthy N: Actin binding proteins: regulation of cytoskeletal microfilaments. Physiol Rev. 2003, 83 (2): 433473.
 49.
Parsons JTSJTJ, Martin KH, SA W: Focal adhesion kinase: a regulator of focal adhesion dynamics and cell movement. Oncogene. 2000, 19 (49): 56065613. 10.1038/sj.onc.1203877.
 50.
Fang J, Zhou H, Zeng C, Yang J, Liu Y, Huang X, Zhang J, Guan X, Zhuang S: MicroRNA29b suppresses tumor angiogenesis, invasion, and metastasis by regulating matrix metalloproteinase 2 expression. Hepatology. 2011, 54 (5): 17291740. 10.1002/hep.24577.
 51.
Steele R MJ, RB R: MBP1 upregulates miR29b that represses Mcl1, collagens, and matrixmetalloproteinase2 in prostate cancer cells. Genes Cancer. 2010, 1 (4): 381387. 10.1177/1947601910371978.
 52.
Liu Y, Taylor N, Lu L, Usa K, Cowley AJ, Ferreri N, Yeo N, Liang M: Renal medullary microRNAs in Dahl saltsensitive rats: miR29b regulates several collagens and related genes. Hypertension. 2010, 55 (4): 97482. 10.1161/HYPERTENSIONAHA.109.144428.
 53.
Dong J, Jiang G, Asmann Y, Tomaszek S, Jen J, Kislinger T, Wigle D: MicroRNA networks in mouse lung organogenesis. PLoS ONE. 5 (5): e10854[doi:10.1371/journal.pone.0010854]
 54.
Davis S, Meltzer P: GEOquery: a bridge between the Gene Expression Omnibus (GEO) and BioConductor. Bioinformatics. 2007, 14: 18461847.
 55.
Steinbock F, Nikolic B, Coulombe P, Fuchs E, Traub P, Wiche G: Dosedependent linkage, assembly inhibition and disassembly of vimentin and cytokeratin 5/14 filaments through plectin’s intermediate filamentbinding domain. J Cell Sci. 2000, 113 (Pt 3): 483491.
 56.
Linding R, Jensen L, Ostheimer G, van Vugt M, Jorgensen C, Miron I, Diella F, Colwill K, Taylor L, Elder K, Metalnikov P, Nguyen V, Pasculescu A, Jin J, Park J, Samson L, Woodgett J, Russell R, Bork P, Yaffe M, T P: Systematic discovery of in vivo phosphorylation networks. Cell. 2007, 129 (7): 14151426. 10.1016/j.cell.2007.05.052.
 57.
Blagoev B, Kratchmarova I, Ong S, Nielsen M, Foster L, Mann M: A proteomics strategy to elucidate functional proteinprotein interactions applied to EGF signaling. Nat Biotechnol. 2003, 21 (3): 315318. 10.1038/nbt790.
 58.
Kim NH, Kim HS, Kim NG, Lee I, Choi HS, Li XY, Kang SE, Cha SY, Ryu JK, Na JM, Park C, Kim K, Lee S, Gumbiner BM, Yook JI, Weiss SJ: p53 and MicroRNA34 Are Suppressors of Canonical Wnt Signaling. Sci Signal. 2011, 4: ra7110.1126/scisignal.2001744.
 59.
Subramanian A, Tamayo P, Mootha V, Mukherjee S, Ebert B, Gillette M, Paulovich A, Pomeroy S, Golub T, Lander E, Mesirov J: Gene set enrichment analysis: A knowledgebased approach for interpreting genomewide expression profiles. PNAS. 2005, 102 (43): 1554515550. 10.1073/pnas.0506580102.
Acknowledgments
We wish to acknowledge Dr Greg Goodall, Centre for Cancer Biology, SA and Dr Anna Tsykin, School of Mathematical Sciences, University of Adelaide, for the acquisition and analysis of the angiogenesis mRNA and miRNA array data used in this study. This work was funded by NH&MRC Program Grant #571408. JRG holds the Wenkart Chair of the Endothelium, University of Sydney. Part of this work was developed at the NICTA Machine Learning group based in Canberra. NICTA is funded by the Australian Government as represented by the Department of Broadband, Communications and the Digital Economy and the Australian Research Council through the ICT Centre of Excellence program.
Author information
Affiliations
Corresponding author
Additional information
Competing interests
The authors declare that they have no competing interests.
Authors’ contributions
IL conceived the idea of finding active subnetworks enriched in a set of mechanisms by exploiting the controlled vocabulary in Metacore. TC and IL designed the probabilistic graphical model and factor graph. MC and IL planned the validation approach and application of the model to two separate experimental data sets. JG and MV were responsible for the acquisition of the angiogenesis data sets. IL implemented the program in R, performed the simulations, validation, and application to the experimental data sets, and prepared the manuscript. All authors have revised the manuscript and given approval for publication.
Electronic supplementary material
12859_2012_5887_MOESM4_ESM.jpeg
Additional file 4: Clusters of mRNA Affymetrix probes. Clusters of 11220 mRNA Affymetrix probes from mouse organogenesis data set filtered by those with a significant contrast from PN30PN10. The yaxis shows the mean expression value of all probes in the cluster, at each time point (xaxis). (JPEG 117 KB)
Authors’ original submitted files for images
Below are the links to the authors’ original submitted files for images.
Rights and permissions
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.
About this article
Cite this article
Lichtenstein, I., Charleston, M.A., Caetano, T.S. et al. Active subnetwork recovery with a mechanismdependent scoring function; with application to angiogenesis and organogenesis studies. BMC Bioinformatics 14, 59 (2013). https://doi.org/10.1186/147121051459
Received:
Accepted:
Published:
DOI: https://doi.org/10.1186/147121051459
Keywords
 Conditionspecific networks
 Active subnetwork
 Markov random field
 Edge label