BACKGROUND
new proteomics techniques enabled large-scale experiments that monitor phosphorylation states of many proteins under different physiological stimuli and/or pharmacological treatments.
each measurement captures a static picture of how the cellular signaling network responses to the binding of a ligand to its receptor, but the interconnections among many different ligand-activated pathways are complex and dynamic.
thus, it is of biological importance to infer which signaling path is at work in response to a particular ligand and how pathways "cross-talk" to each other in a cell-type-specific manner, and eventually to develop computational models capable of predicting cellular responses under different stimuli.
one of the most common approaches to signaling network modeling is to represent the dynamic system as a set of ordinary differential equations  using mass action kinetics, by which the concentration of species over time can be analyzed  <cit> .
additionally, when spatial information is important for such modeling, a system of partial differential equations  is considered to be more precise tool to model biochemical processes in both space and time dimension  <cit> .
odes or pdes mathematically represent signal transduction by introducing many parameters in the model, which becomes impractical for extremely large networks due to the increasing difficulty in parameter estimation  <cit> .
to approach large-scale signaling network modeling, several data-driven methods have emerged and applied to simulate signal transduction: constraint-based network analysis that allows reconstruction of large systems of biochemical reactions in analyzing genome-scale metabolic networks  <cit> ; network component analysis  which incorporates prior knowledge of network topology to infer signaling pathways  <cit> ; partial least squares regression  analysis to investigate complicated signaling networks by identifying optimal principle component-based dimensions from a proposed relationship  <cit> .
many of the approaches described above are deterministic models, which are not aimed at accommodating the noise inherent in biologically data  <cit> .
in contrast, bayesian network analysis is an alternative probabilistic graphical approach to model signaling pathways  <cit> .
bayesian network, which can explicitly handle the uncertainty of unobserved events  <cit> , provides a compact graphical representation of the joint probability distributions over all random variables, and has been used for reconstruction of signaling networks  <cit> .
to assess the current state of the art network inference methods, columbia university, the new york academy of sciences, and the ibm computational biology center have been organizing the dialogue for reverse engineering assessments and method , an annual international competition to assess methods that infer network structures and predict cellular response to different combination of stimuli from actual experimental data  <cit> .
challenge  <dig> of the  <dig> dream <dig> competition  was titled predictive signaling network modeling and included two tasks.
in the first part, a canonical protein phosphorylation network was provided.
this network was constructed by combining pathways from different cell types reported in the current literature.
the participants were also provided with a dataset of protein phosphorylation measurements collected from hepg <dig> hepatocellular carcinoma cells that were treated with various stimuli and inhibitors.
the task was to induce a hepg <dig> cell specific protein phosphorylation pathway out of the canonical network and to build a predictive model of how the cell responds to these stimuli and inhibitors.
the second part of the challenge was to use this induced pathway to predict the activities of the phosphoproteins under a new set of perturbations.
the provided canonical pathway consists of a union of the known signaling pathways responding to the following ligands tnfα, il1α, igf- <dig>  and tgfα .
the training data consisted of the activities of seven downstream phosphoproteins measured when cells were treated with four cytokine  stimuli in various combinations with four inhibitors at  <dig>   <dig> minutes and  <dig> hours post-stimulation.
the test data was generated similarly, but the cells were treated with different combination of stimuli and inhibitors  <cit> .
our approach to this challenge is to employ an enhanced bayesian network to identify the most plausible hepg <dig> specific signaling network and to predict the cellular responses to new stimuli.
bayesian network is a directed acyclic graph  model representing the probabilistic relationships between a set of random variables  <cit> .
given a signal transduction pathway such as the canonical network of dream <dig> challenge, a bayesian network can represent the propagation of cellular signal for the biological network in such a way that the state of a downstream phosphoprotein is determined by the states of its upstream kinases, and their relationships can be quantified by conditional probabilities  <cit> .
we could then transform the task of inducing cell-type-specific network as a task to find a subnetwork within the canonical network that explains the observed data as well as possible--a data-driven structure search problem.
it is well known that brute force exhaustive search of bayesian network structure is intractable  <cit>  although different heuristic algorithms exist to address the task.
however, solely employing these heuristic algorithms in our setting would fail to utilize a wealth of biological knowledge regarding genes and proteins and their relationships.
ignoring this knowledge may result in a bayesian network that captures the statistical relationships between the states of phosphoproteins perfectly but does not make any biological sense--a phenomenon referred to as equivalent classes of bayesian networks in the machine learning field  <cit> .
in order to address this problem, we developed a bayesian network searching algorithm that incorporates prior biological knowledge.
we recently developed the concept of the ontology fingerprint from biomedical literature and gene ontology   <cit> .
the ontology fingerprint for a gene or a phenotype is a set of go terms overrepresented in the pubmed abstracts linked to the gene or phenotype, along with these terms' corresponding enrichment p-values  <cit> .
by comparing two genes' ontology fingerprints, we can assess their biological relevance quantitatively.
such relevance can be used to assess gene-gene connections for model selection in bayesian network-based signaling network prediction.
incorporating this information accelerates the network search process and helps to identify biologically sound connections in predicting signaling networks, eventually leading to better models.
we thus developed an enhanced bayesian network method by incorporating the ontology fingerprint for model selection.
this novel approach was used to predict a signaling network for the dream  <dig> challenge and performed very well, indicating ontology and prior biological knowledge can make a significant contribution to signaling network predictions.
methods
combining prior knowledge with experimental data, we adopted a bayesian network approach to infer the most plausible signaling network from a web of complex networks.
figure  <dig> outlines the workflow of our method and figure  <dig> illustrates the graph-searching algorithm.
data
the training data were provided by the dream <dig> challenge  <dig>  including phosphorylation measurements for  <dig> proteins under  <dig> experimental conditions  at  <dig> time points.
we used the provided canonical pathway as the original dag which contains  <dig> nodes and  <dig> edges .
the nodes were classified into four color-coded categories: 1) four ligand receptor nodes ; 2) seven phosphoprotein nodes whose phosphorylation level were measured as fluorescent signal readings ; 3) two inhibited nodes , which were inhibited under some experimental conditions; and 4) hidden nodes .
nodes mek <dig> and p <dig> are both observed and inhibited nodes under their inhibition condition.
in addition, pi3k and ikk were inhibited in some experiments but their phosphorylation states were not measured.
in order to incorporate independent biological knowledge to learn the network structure, we evaluated the degree of biological relevance between genes by using the gene-gene similarity scores derived from their ontology fingerprints; the pairwise similarity scores among the  <dig> nodes were calculated.
the detailed procedures of constructing ontology fingerprint were described in  <cit> .
specifically, we downloaded and processed the june 13th,  <dig> version of go to extract go terms and their descriptions.
the  <dig> version of pubmed abstracts in xml format was also downloaded and processed to extract the pubmed id and the text of each abstract.
the links between pubmed abstracts and genes were obtained from the ncbi "pubmed2gene" file.
abstracts that contained go terms were identified by exact string match.
we also labeled the abstracts containing a go term with all of the term's parent terms.
in addition, each abstract was labeled with a go term only once regardless of how many times the term occurred in the abstract.
the ontology fingerprints were derived from  <dig>  abstracts linked to at least one human gene.
in total, we constructed ontology fingerprints for  <dig>  human genes using  <dig>  ontology terms mapped to the pubmed abstracts that linked to human genes.
bayesian network
a bayesian network was constructed based on the provided canonical signal transduction network, in which nodes are proteins and directed edges represent signaling flows  <cit> .
for the proteins whose phosphorylation signals were measured, we represented their phosphorylation states using bernulli variables, such that state =  <dig>  and state =  <dig> .
under such a setting, the observed fluorescent signals reflecting the phosphorylation level of a protein  can be modeled using a gaussian distribution conditioning on their states ):
p~np~n
where vi denotes the activity reading of observed node i, si denotes its state; μi, <dig> and μi, <dig> represent the average activity reading of node i at sate  <dig> and state  <dig> respectively; σi, <dig> and σi, <dig> represent the variance of activity readings of node i at sate  <dig> and state  <dig> respectively.
the fluorescent measurements of the seven observed nodes are modeled using a mixture of signals produced by phosphorylated and unphosphorylated proteins.
under the causal markov assumption  <cit> , we represented the conditional probabilistic relationship between a phosphoprotein and its upstream signaling molecules  with a logistic function, i.e.
given the states of a node i's parents, the probability of the node i being at active state  is independent of its nondescendents' states.
this logistic function was defined in equation
p)=11+e-βi,jsj)
where pa denotes the set of parent nodes of node i, and j denotes one of i's parent nodes; sj represents the state of j; βi, <dig> is the interception and βi,j is the logistic regression coefficient between node i and its parent node j.
learning structure of cell-type-specific signaling network
the dream  <dig> challenge requires inferring the cell-type-specific signal network and predicting the cellular response under certain stimulations.
we formulated these tasks as learning the structure and parameterization of the bayesian network and adopted a bayesian learning approach to determine the structure.
under this framework, the goal is to identify a network structure, a model m, which has the maximal posterior probability given data d  and ):
m*=argmaxm∈gp
p~pp
the number of all possible network structures of a bayesian network g ) is super exponential  <cit>  with respect to the number of nodes.
thus, exhaustive search of all possible structures is intractable.
in this study, we developed a heuristic approach to utilize prior biological knowledge to guide a stochastic search of biologically plausible candidate graphs, equivalent to selecting networks with higher prior p. based on these candidate networks, we further performed a data-driven search of network structure through parameterization.
we identified an optimal cell-type-specific network for hepg <dig> cells by combining the networks that were preferentially selected based on prior knowledge and that explained the observed data well.
searching for biological plausible network using the ontology fingerprint
using the provided canonical network as a starting point, we explored the space of the cell-type-specific networks by stochastically adding and deleting edges.
the edge selection was based on the available prior biological knowledge in order to search for network structures that are more biologically sensible.
to this end, we employed the ontology fingerprint  <cit>  to represent the prior knowledge of proteins of interest.
the ontology fingerprint of a gene provides the characteristics of the cellular component, molecular function, or biological process captured in the literature with a quantitative measure.
by comparing two genes' ontology fingerprints using a modified inner product, a similarity score is generated to quantify the gene-gene relationship--the higher the score, the more the two genes are biologically relevant.
we used these similarity scores to guide the exploration of model space of possible networks.
we calculated the similarity scores for all pairs of  <dig> genes in the canonical pathway.
the similarity score was used to assess whether an edge should be added or deleted in the canonical network: edges linking two genes with strong biological relevance  will be added into the network with a higher chance, while edges with weak biological relevance and weak data support will be deleted from the network with a higher chance.
figure  <dig> shows the heuristic rules of network search.
the candidate graphs were then used to infer the parameters by applying the em algorithm.
searching for network structure based on observed data
given a candidate network produced in the aforementioned space exploration, we further evaluated if the model explains the observed experimental data well by calculating the term p in equation .
this involves learning the parameters of the network model and considering all possible combination of parameterization of the model to derive the marginal probability p. in this study, we employed lasso logistic regression to perform regularized  estimation of parameters.
we also used the bayesian information criteria   <cit>  as a surrogate of the marginal probability of the network to assess the goodness of fit of the models.
in addition, we took advantage of the fact that, when the logistic regression parameter between a target phosphoprotein and one of its parents is set to zero by the lasso logistic regression, we can effectively delete the edge between these two proteins--searching for network model through parameterization.
bayesian learning of network model
the true phosphorylation states of the protein nodes were not observed but indirectly reflected by the fluorescence signals in the training data.
therefore the nodes representing protein phosphorylation states were latent variables.
we used an expectation-maximization  algorithm to infer the hidden state of each node and further estimated the parameters of candidate models  <cit> .
the hidden states of the protein nodes were inferred using a gibbs-sampling-based belief propagation in the em algorithm, i.e.
monte carlo em algorithm   <cit> .
in the e step, the state of a node was inferred based on the states of its markov blanket nodes using a gibbs sampling algorithm, and all the nodes' states were updated following the belief propagation algorithm.
in the m step the parameters associated with edges were estimated based on the sampled states of the nodes.
the markov blanket of node x is a set of nodes consisting of x's parents, children, and other parents of x's children nodes.
given the states of the nodes within x's markov blanket, the x's state is independent of the states of nodes outside the markov blanket.
we derived the full conditional probability of a hidden node  - ):
p)=p)p|pa),si=0)dh
p)=p)p|pa),si=1)dh
dh=p)p|pa),si=0)+p)p|pa),si=1)
similarly, the full conditional probability of the observed node was described in equation  - , where the probability of each node's state conditioned on the states of its parents )) can be determined using equation :
p)=pp)p|pa),si=0)do=np)p|pa),si=0)do
p)=pp)p|pa),si=1)do=np)p|pa),si=1)do
do=np)p|pa),si=0)+np)p|pa),si=1)
logistic regression was then used in the m-step to estimate the parameters of the generalized linear model.
in order to reduce the search space, lasso regression implemented in the lars package from r  <cit>  was applied in the final round of the em algorithm to determine whether to perform regularization.
this would set certain parameters to zero between a parent-child protein pair in the candidate network  <cit>  while retaining the edges that were sufficient to model the observed data.
lasso regression could thus reduce the number of edges in networks that have weak or duplicated effect on signaling cascade.
prediction of test data
to predict the fluorescent signals of  <dig> phosphoproteins in response to cytokine stimuli under  <dig> testing conditions, the phosphorylation states of these proteins were sampled using the aforementioned em algorithms  and the belief propagation algorithm.
the fluorescent signals were then simulated by mixture of the signals of proteins in both phosphorylated and unphosphorylated states defined in equation .
we generated  <dig> samples of the activation state for each protein node according to its posterior probability and each sample predicted the strength of fluorescent signal of the monitored proteins from the learned normal distribution conditioned on sampled states.
the final prediction was then produced by averaging the predicted measurements of the observed nodes across all samples.
RESULTS
the task of learning cell-type-specific network is equivalent to determining which subset of vertices and edges from the canonical network should be retained for that cell type.
we addressed the task of learning network structure through combining prior knowledge and experimental data in the following steps: 1) stochastically exploring candidate network structures based on prior knowledge; 2) training candidate bayesian network using experimental data, which further modifies network structure through parameterization, i.e., setting the parameters associated with certain edges to the values that would be equivalent to deleting these edges; and 3) selecting the network model that best simulates the experimental results.
a bayesian network can also readily simulate the propagation of a signal in the system using a belief propagation algorithm  <cit> , which can predict the system's response to cellular stimuli.
the novelty of our approach is to update the network by leveraging prior biological knowledge captured in the ontology fingerprints  <cit>  in order to efficiently search for better network structure.
the similarity of the ontology fingerprints of a pair of genes captures their biological relevance, e.g.
whether they participate in a common biology process within a common biological setting such as the same cell type.
therefore, two genes with similar ontology fingerprints are more likely to cooperatively work in a common biological environment than those that are not.
this information could be used as prior knowledge to preferentially retain or reject the edges in the canonical network in a principled manner.
learning cell-type-specific signaling network
using the provided experimental data, we trained our bayesian network-learning algorithm to infer a hepg <dig> cell specific network.
figure 3a shows the provided canonical network and the final predicted network is shown in figure 3b.
dream <dig> competition only required to report a collapsed graph, i.e.
all hidden nodes removed, and only the paths among the observed phosphoproteins  shown.
figure  <dig> shows the comparison between the collapsed canonical network and the network learned by our algorithm.
the figure shows that the learned graph is simpler than the canonical graph: it contains  <dig> edges instead of  <dig> in the canonical network.
notably, the number of each receptor's edges was reduced to three, resulting in a narrower transduction path for each receptor.
an intermediary node  lost all outgoing signals except one, and two terminal nodes  lost their connecting edge.
another intermediary node  lost its incoming signals from three of the four signal nodes .
the predicted network represents a biologically plausible signaling pathway specific to hepg <dig> cells, partially due to the novel graph search algorithm based on the ontology fingerprints.
for instance, the connections between ikk and ikb tended to be kept during graph updating due to the relatively high similarity of their ontology fingerprints, with the similarity score ranking above the 80th percentile.
in contrast, the connection between erk1/ <dig> and hsp2/ <dig> was deleted with a high probability since their similarity score lies on the 30th percentile.
overall, the model updating process based on the novel graph search algorithm seamlessly included prior biological knowledge embedded in the literature and go.
based on the training data of hepg <dig> cell, employing lasso regression  <cit>  in learning bayesian network parameters further identifies main paths specifically transducing the signal in this cell type, resulting in a sparse network.
our results also indicate that bayesian network is particularly suitable for modeling cellular signal transduction in that principled statistical inference algorithms, e.g., the belief propagation algorithm, enabled us to represent hidden variables  in the graph and to infer detailed signal transduction in the pathway.
in contrast, other modeling approaches reported at the dream <dig> conference, e.g., methods based biochemical systems theory  <cit> , usually ignore all hidden variables to reduce the complexity of network modeling and parameter estimation at the cost of missing intermediate information.
the full network predicted by our approach consists of  <dig> nodes connected by totally  <dig> edges, and each edge is associated with a parameter that quantifies the relationship of the signal propagated from the parent node to its child node .
in this network, twenty-four nodes are hidden but our inference algorithm correctly inferred their states and relationships between the nodes in the network.
for instance, the directed edge from ras to raf, both of which are hidden nodes, was assigned with a positive coefficient , indicating that ras plays a strong activation role for raf <dig>  this infer-ence agrees with previous findings  <cit>  that raf <dig> is a critical ras effector target, and its activation is a consequence of ras activation and the formation of ras-gtp-raf <dig> complex.
the positive connection between another pair of hidden nodes, from rac to pak , is also consistent with the fact that pak is the downstream effector of rac  <cit> .
zimmerman and moelling  <cit>  suggested that akt-mediated phosphorylation of raf <dig> leads to the inhibition of the raf-mek-erk cascade and the modulation of the cellular response  <cit> .
indeed, our algorithm correctly captured this relationship, which assigned a negative coefficient  to the edge from akt to raf <dig> in our predicted network.
while the low coefficient may reflect the fact that the inference used the measurement performed on two distal nodes--akt and erk, the negative value is indeed consistent with the known inhibitory effect.
these evidences demonstrate that our approach can utilize the limited observed data to infer the signal transduction of the full network, even though the state of certain nodes are not observed.
predicting cellular responses to stimuli
using the final graph and the associated parameters learned from the bayesian network approach, we performed simulation studies to predict cellular responses to a set of provided stimuli and compared the "predicted" results with the observed training data.
the comparison showed a very significant correlation .
figure  <dig> shows the scatter plot between the predicted versus the observed levels for the phosphoprotein activity of all  <dig> proteins under all conditions.
figure  <dig> compares the fitting of the data under different conditions for each of the  <dig> proteins.
the black curves denote the observed phosphoprotein activity levels, while the red curves represent the corresponding predicted values.
the blue-line within each box indicates the detection threshold of the detector .
overall, the predictions are highly consistent with the observed data, indicating that our model is able to capture the signal transduction in hepg <dig> cells with a sparse network.
using the predicted hepg <dig> specific network and the learned parameters, we then predicted the phosphoprotein activity levels of the  <dig> proteins under the test conditions given by the dream  <dig> challenge.
the predicated phosphoprotein activities were evaluated against experimental measurement by the organizers of dream <dig> challenge using two criteria: first, the accuracy evaluated by a prediction cost function ; second, network parsimony.
our group  ranked within the top five  among all submissions for this challenge .
this outcome demonstrates that incorporating prior biological knowledge in the form of the ontology fingerprint with statistical algorithms for graph searching and parameter estimation can significantly outperform many other approaches for signaling network inference.
our results also demonstrate a novel way to integrate ontological data and literature in learning signaling network construction, as well as the feasibility of applying ontology as biological information in other challenging data-mining problems.
discussion
a signaling network is a complex and dynamic system that governs biological activities and coordinates cellular functions  <cit> .
defects in signal transduction are responsible for diseases such as cancer, autoimmunity, and diabetes  <cit> .
by understanding signaling networks, mechanisms of diseases can be investigated more specifically, and the disease could be targeted and treated more efficiently.
moreover, different cell types often activate different parts of signaling networks, resulting in different responses to the same perturbation.
in this study, we addressed the dream <dig> challenge of predicting signaling networks using two innovative approaches: 1) by incorporating prior knowledge in the form of the ontology fingerprint, we efficiently and preferentially search biologically plausible models, and 2) by using lasso regression, we unified the bayesian network parameter learning and structure learning in a data-driven manner.
these improvements are principled from a statistical learning point of view and sensible from a biological point of view.
participants of the dream <dig> challenge developed various computational approaches to model the signaling network and predict their cellular responses to different stimuli.
dynamic mathematical modeling implemented in a system of differential equations is one of the mainstream approaches  <cit> .
the method represents signal transduction as detailed and biochemically realistic mathematical equations with the need to estimate many free parameters.
however, the parameter estimation becomes extremely challenge as the number of species in the network increases  <cit> .
to circumvent this pitfall, one of the participant teams using this approach omitted all hidden nodes, i.e.
species not subjected to experimental manipulation or measurement.
such simplification resulted in missing information of network topology and intermediate signal transduction.
an alternative approach is to depict the signaling pathway as a logical model and utilize a two-state discrete  logic to approximate the signal propagation in the network.
however, the boolean model is a deterministic approach not rigorous enough to capture real biological events.
furthermore, this model also involved node compression process to remove non-identifiable elements  <cit> .
by contrast, bayesian network analysis represents an effective mean to encode both the prior knowledge of network topology and the probabilistic dependency in signaling networks  <cit> .
this approach has the advantage of being able to handle hidden nodes in a principled manner and to model mixed information of both the noisy continuous measurements and the discrete regulatory logic by modeling these nodes as latent variables and infer novel signaling paths from observed data.
such advantage is particularly useful in real world application where experimental measurements are expansive and limited to certain selected proteins.
the utility of these data can be maximized by using latent variables to infer novel signaling paths that contain proteins not been measured.
however, the application of bayesian network in real world modeling is limited due to the super exponential space one has to search in order to identify the optimal model  <cit> .
compared with other approaches applied in the dream <dig> challenge, our approach has several significant advantages: 1) it is able to predict the discrete state of proteins in a probabilistic manner under different stimuli, without the requirement of node compression; 2) the incorporation of prior biological knowledge embedded in the ontology fingerprint accelerates the search for optimal network topology, in other words, it increases the probability of obtaining an optimal network within limited learning time; 3) the ontology fingerprint enhanced network search process makes the inferred network more biologically sensible; 4) the lasso model regularization method efficiently assist the search for a sparse network.
our algorithm was further improved by embedding biological information from the ontology fingerprint into the learning stage of the bayesian network modeling.
this was accomplished through the introduction of prior distributions for the variables.
the seamless integration of prior knowledge into the bayesian network framework allowed us to construct a cell-type specific signal transduction pathway and to use the pathway to predict novel perturbation outcomes in the dream <dig> competition.
the ontology fingerprint derived from pubmed literature and biomedical ontology serve as a comprehensive characterization of genes.
compared to current gene annotation, the ontology fingerprints were generated by a largely unsupervised method, thus do not need well-annotated corpus which is difficult to assemble.
in addition, the enrichment p-value associated with each ontology term in an ontology fingerprint can be used as a quantitative measure of biological relevance between genes--a feature that is lacking in current gene annotations.
this comprehensive and quantitative characterization of genes works well as prior knowledge in our graph searching strategy.
in contrast, commonly used graph searching algorithms, such as genetic algorithms, only rely on a randomized exhaustive search that is not able to utilize useful prior information.
this limitation not only makes these algorithms inefficient in searching the plausible model space but also potentially lead to networks that are biologically irrelevant.
to assess the contribution of the ontology fingerprints to bayesian network learning algorithm, we compared the likelihoods of bayesian networks iteratively updated with or without the guidance of prior knowledge derived from the ontology fingerprints.
starting with the canonical network, we iteratively updated network structure until a fixed number of networks were obtained.
the converged likelihood of each network was obtained by monte carlo em algorithm   <cit> .
the likelihoods from ontology fingerprint-guided network update were significantly higher than those without the guide .
in addition, we investigated the performance of ontology fingerprint enhanced bayesian network in eliminating biologically irrelevant relationships from the network.
we randomly added edges with similarity scores of zero into the canonical network, and considered the new network as a noisy network.
starting with this noisy network, we performed the same comparison as described above, and the resulting likelihoods from ontology fingerprint-guided network update were also significantly higher than the update process without prior knowledge .
furthermore, the network update with prior knowledge successfully identified and eliminated noisy edges quickly at the first several iterations.
these results demonstrated that integrating the ontology fingerprint as prior knowledge can speed up the convergence of likelihood, resulting in the increased efficiency of both identifying optimal network structure and retaining biological meaningful connections in the final network.
in addition to prior knowledge, our approach also employed the lasso technique  <cit>  to select a plausible model in a data driven manner.
lasso is one of the regularization algorithms originally proposed for linear regression models, and has become a popular model shrinkage and selection method.
the lasso method combines shrinkage and model selection by automatically setting certain regression coefficients to zero  <cit> .
this approach effectively deleted certain candidate edges between signaling molecules, and helped to remove redundant variables to obtain a concise model in the final step.
CONCLUSIONS
by incorporating prior biological knowledge, utilizing advanced statistical method for parameter estimation and modeling unobserved nodes as latent variables, we developed a novel approach to infer active signaling networks from experimental data and a canonical network.
our results demonstrated that these improvements allow us to predict signaling network structure and responses that match closely to those identified by experimental approaches.
competing interests
the authors declare that they have no competing interests.
authors' contributions
wjz initiated the idea of incorporating the ontology fingerprint for network prediction and guided the development of the ontology fingerprints.
tq and lct worked on the method development and signaling network prediction.
kjs advised the biological knowledge about the signaling pathway.
xl advised the bayesian network development.
tq and lct drafted and wjz and xl finalized the manuscript.
wjz supervised the overall development of the project.
all authors have read and approved the manuscript.

 new proteomics techniques enabled large-scale experiments that monitor phosphorylation states of many proteins under different physiological stimuli and/or pharmacological treatments. each measurement captures a static picture of how the cellular signaling network responses to the binding of a ligand to its receptor, but the interconnections among many different ligand-activated pathways are complex and dynamic. thus, it is of biological importance to infer which signaling path is at work in response to a particular ligand and how pathways "cross-talk" to each other in a cell-type-specific manner, and eventually to develop computational models capable of predicting cellular responses under different stimuli. one of the most common approaches to signaling network modeling is to represent the dynamic system as a set of ordinary differential equations using mass action kinetics, by which the concentration of species over time can be analyzed. additionally, when spatial information is important for such modeling, a system of partial differential equations is considered to be more precise tool to model biochemical processes in both space and time dimension. odes or pdes mathematically represent signal transduction by introducing many parameters in the model, which becomes impractical for extremely large networks due to the increasing difficulty in parameter estimation. to approach large-scale signaling network modeling, several data-driven methods have emerged and applied to simulate signal transduction: constraint-based network analysis that allows reconstruction of large systems of biochemical reactions in analyzing genome-scale metabolic networks; network component analysis which incorporates prior knowledge of network topology to infer signaling pathways; partial least squares regression analysis to investigate complicated signaling networks by identifying optimal principle component-based dimensions from a proposed relationship. many of the approaches described above are deterministic models, which are not aimed at accommodating the noise inherent in biologically data. in contrast, bayesian network analysis is an alternative probabilistic graphical approach to model signaling pathways. bayesian network, which can explicitly handle the uncertainty of unobserved events, provides a compact graphical representation of the joint probability distributions over all random variables, and has been used for reconstruction of signaling networks. to assess the current state of the art network inference methods, columbia university, the new york academy of sciences, and the ibm computational biology center have been organizing the dialogue for reverse engineering assessments and method, an annual international competition to assess methods that infer network structures and predict cellular response to different combination of stimuli from actual experimental data. challenge of the dream competition was titled predictive signaling network modeling and included two tasks. in the first part, a canonical protein phosphorylation network was provided. this network was constructed by combining pathways from different cell types reported in the current literature. the participants were also provided with a dataset of protein phosphorylation measurements collected from hepg hepatocellular carcinoma cells that were treated with various stimuli and inhibitors. the task was to induce a hepg cell specific protein phosphorylation pathway out of the canonical network and to build a predictive model of how the cell responds to these stimuli and inhibitors. the second part of the challenge was to use this induced pathway to predict the activities of the phosphoproteins under a new set of perturbations. the provided canonical pathway consists of a union of the known signaling pathways responding to the following ligands tnfα, il1α, igf- and tgfα. the training data consisted of the activities of seven downstream phosphoproteins measured when cells were treated with four cytokine stimuli in various combinations with four inhibitors at minutes and hours post-stimulation. the test data was generated similarly, but the cells were treated with different combination of stimuli and inhibitors. our approach to this challenge is to employ an enhanced bayesian network to identify the most plausible hepg specific signaling network and to predict the cellular responses to new stimuli. bayesian network is a directed acyclic graph model representing the probabilistic relationships between a set of random variables. given a signal transduction pathway such as the canonical network of dream challenge, a bayesian network can represent the propagation of cellular signal for the biological network in such a way that the state of a downstream phosphoprotein is determined by the states of its upstream kinases, and their relationships can be quantified by conditional probabilities. we could then transform the task of inducing cell-type-specific network as a task to find a subnetwork within the canonical network that explains the observed data as well as possible--a data-driven structure search problem. it is well known that brute force exhaustive search of bayesian network structure is intractable although different heuristic algorithms exist to address the task. however, solely employing these heuristic algorithms in our setting would fail to utilize a wealth of biological knowledge regarding genes and proteins and their relationships. ignoring this knowledge may result in a bayesian network that captures the statistical relationships between the states of phosphoproteins perfectly but does not make any biological sense--a phenomenon referred to as equivalent classes of bayesian networks in the machine learning field. in order to address this problem, we developed a bayesian network searching algorithm that incorporates prior biological knowledge. we recently developed the concept of the ontology fingerprint from biomedical literature and gene ontology. the ontology fingerprint for a gene or a phenotype is a set of go terms overrepresented in the pubmed abstracts linked to the gene or phenotype, along with these terms' corresponding enrichment p-values. by comparing two genes' ontology fingerprints, we can assess their biological relevance quantitatively. such relevance can be used to assess gene-gene connections for model selection in bayesian network-based signaling network prediction. incorporating this information accelerates the network search process and helps to identify biologically sound connections in predicting signaling networks, eventually leading to better models. we thus developed an enhanced bayesian network method by incorporating the ontology fingerprint for model selection. this novel approach was used to predict a signaling network for the dream challenge and performed very well, indicating ontology and prior biological knowledge can make a significant contribution to signaling network predictions. methods combining prior knowledge with experimental data, we adopted a bayesian network approach to infer the most plausible signaling network from a web of complex networks. figure outlines the workflow of our method and figure illustrates the graph-searching algorithm. data the training data were provided by the dream challenge including phosphorylation measurements for proteins under experimental conditions at time points. we used the provided canonical pathway as the original dag which contains nodes and edges. the nodes were classified into four color-coded categories: 1) four ligand receptor nodes; 2) seven phosphoprotein nodes whose phosphorylation level were measured as fluorescent signal readings; 3) two inhibited nodes, which were inhibited under some experimental conditions; and 4) hidden nodes. nodes mek and p are both observed and inhibited nodes under their inhibition condition. in addition, pi3k and ikk were inhibited in some experiments but their phosphorylation states were not measured. in order to incorporate independent biological knowledge to learn the network structure, we evaluated the degree of biological relevance between genes by using the gene-gene similarity scores derived from their ontology fingerprints; the pairwise similarity scores among the nodes were calculated. the detailed procedures of constructing ontology fingerprint were described in. specifically, we downloaded and processed the june 13th, version of go to extract go terms and their descriptions. the version of pubmed abstracts in xml format was also downloaded and processed to extract the pubmed id and the text of each abstract. the links between pubmed abstracts and genes were obtained from the ncbi "pubmed2gene" file. abstracts that contained go terms were identified by exact string match. we also labeled the abstracts containing a go term with all of the term's parent terms. in addition, each abstract was labeled with a go term only once regardless of how many times the term occurred in the abstract. the ontology fingerprints were derived from abstracts linked to at least one human gene. in total, we constructed ontology fingerprints for human genes using ontology terms mapped to the pubmed abstracts that linked to human genes. bayesian network a bayesian network was constructed based on the provided canonical signal transduction network, in which nodes are proteins and directed edges represent signaling flows. for the proteins whose phosphorylation signals were measured, we represented their phosphorylation states using bernulli variables, such that state = and state =. under such a setting, the observed fluorescent signals reflecting the phosphorylation level of a protein can be modeled using a gaussian distribution conditioning on their states ): p~np~n where vi denotes the activity reading of observed node i, si denotes its state; μi, and μi, represent the average activity reading of node i at sate and state respectively; σi, and σi, represent the variance of activity readings of node i at sate and state respectively. the fluorescent measurements of the seven observed nodes are modeled using a mixture of signals produced by phosphorylated and unphosphorylated proteins. under the causal markov assumption, we represented the conditional probabilistic relationship between a phosphoprotein and its upstream signaling molecules with a logistic function, i.e. given the states of a node i's parents, the probability of the node i being at active state is independent of its nondescendents' states. this logistic function was defined in equation p)=11+e-βi,jsj) where pa denotes the set of parent nodes of node i, and j denotes one of i's parent nodes; sj represents the state of j; βi, is the interception and βi,j is the logistic regression coefficient between node i and its parent node j. learning structure of cell-type-specific signaling network the dream challenge requires inferring the cell-type-specific signal network and predicting the cellular response under certain stimulations. we formulated these tasks as learning the structure and parameterization of the bayesian network and adopted a bayesian learning approach to determine the structure. under this framework, the goal is to identify a network structure, a model m, which has the maximal posterior probability given data d and ): m*=argmaxm∈gp p~pp the number of all possible network structures of a bayesian network g ) is super exponential with respect to the number of nodes. thus, exhaustive search of all possible structures is intractable. in this study, we developed a heuristic approach to utilize prior biological knowledge to guide a stochastic search of biologically plausible candidate graphs, equivalent to selecting networks with higher prior p. based on these candidate networks, we further performed a data-driven search of network structure through parameterization. we identified an optimal cell-type-specific network for hepg cells by combining the networks that were preferentially selected based on prior knowledge and that explained the observed data well. searching for biological plausible network using the ontology fingerprint using the provided canonical network as a starting point, we explored the space of the cell-type-specific networks by stochastically adding and deleting edges. the edge selection was based on the available prior biological knowledge in order to search for network structures that are more biologically sensible. to this end, we employed the ontology fingerprint to represent the prior knowledge of proteins of interest. the ontology fingerprint of a gene provides the characteristics of the cellular component, molecular function, or biological process captured in the literature with a quantitative measure. by comparing two genes' ontology fingerprints using a modified inner product, a similarity score is generated to quantify the gene-gene relationship--the higher the score, the more the two genes are biologically relevant. we used these similarity scores to guide the exploration of model space of possible networks. we calculated the similarity scores for all pairs of genes in the canonical pathway. the similarity score was used to assess whether an edge should be added or deleted in the canonical network: edges linking two genes with strong biological relevance will be added into the network with a higher chance, while edges with weak biological relevance and weak data support will be deleted from the network with a higher chance. figure shows the heuristic rules of network search. the candidate graphs were then used to infer the parameters by applying the em algorithm. searching for network structure based on observed data given a candidate network produced in the aforementioned space exploration, we further evaluated if the model explains the observed experimental data well by calculating the term p in equation. this involves learning the parameters of the network model and considering all possible combination of parameterization of the model to derive the marginal probability p. in this study, we employed lasso logistic regression to perform regularized estimation of parameters. we also used the bayesian information criteria as a surrogate of the marginal probability of the network to assess the goodness of fit of the models. in addition, we took advantage of the fact that, when the logistic regression parameter between a target phosphoprotein and one of its parents is set to zero by the lasso logistic regression, we can effectively delete the edge between these two proteins--searching for network model through parameterization. bayesian learning of network model the true phosphorylation states of the protein nodes were not observed but indirectly reflected by the fluorescence signals in the training data. therefore the nodes representing protein phosphorylation states were latent variables. we used an expectation-maximization algorithm to infer the hidden state of each node and further estimated the parameters of candidate models. the hidden states of the protein nodes were inferred using a gibbs-sampling-based belief propagation in the em algorithm, i.e. monte carlo em algorithm. in the e step, the state of a node was inferred based on the states of its markov blanket nodes using a gibbs sampling algorithm, and all the nodes' states were updated following the belief propagation algorithm. in the m step the parameters associated with edges were estimated based on the sampled states of the nodes. the markov blanket of node x is a set of nodes consisting of x's parents, children, and other parents of x's children nodes. given the states of the nodes within x's markov blanket, the x's state is independent of the states of nodes outside the markov blanket. we derived the full conditional probability of a hidden node - ): p)=p)p|pa),si=0)dh p)=p)p|pa),si=1)dh dh=p)p|pa),si=0)+p)p|pa),si=1) similarly, the full conditional probability of the observed node was described in equation -, where the probability of each node's state conditioned on the states of its parents )) can be determined using equation: p)=pp)p|pa),si=0)do=np)p|pa),si=0)do p)=pp)p|pa),si=1)do=np)p|pa),si=1)do do=np)p|pa),si=0)+np)p|pa),si=1) logistic regression was then used in the m-step to estimate the parameters of the generalized linear model. in order to reduce the search space, lasso regression implemented in the lars package from r was applied in the final round of the em algorithm to determine whether to perform regularization. this would set certain parameters to zero between a parent-child protein pair in the candidate network while retaining the edges that were sufficient to model the observed data. lasso regression could thus reduce the number of edges in networks that have weak or duplicated effect on signaling cascade. prediction of test data to predict the fluorescent signals of phosphoproteins in response to cytokine stimuli under testing conditions, the phosphorylation states of these proteins were sampled using the aforementioned em algorithms and the belief propagation algorithm. the fluorescent signals were then simulated by mixture of the signals of proteins in both phosphorylated and unphosphorylated states defined in equation. we generated samples of the activation state for each protein node according to its posterior probability and each sample predicted the strength of fluorescent signal of the monitored proteins from the learned normal distribution conditioned on sampled states. the final prediction was then produced by averaging the predicted measurements of the observed nodes across all samples.  the task of learning cell-type-specific network is equivalent to determining which subset of vertices and edges from the canonical network should be retained for that cell type. we addressed the task of learning network structure through combining prior knowledge and experimental data in the following steps: 1) stochastically exploring candidate network structures based on prior knowledge; 2) training candidate bayesian network using experimental data, which further modifies network structure through parameterization, i.e., setting the parameters associated with certain edges to the values that would be equivalent to deleting these edges; and 3) selecting the network model that best simulates the experimental results. a bayesian network can also readily simulate the propagation of a signal in the system using a belief propagation algorithm, which can predict the system's response to cellular stimuli. the novelty of our approach is to update the network by leveraging prior biological knowledge captured in the ontology fingerprints in order to efficiently search for better network structure. the similarity of the ontology fingerprints of a pair of genes captures their biological relevance, e.g. whether they participate in a common biology process within a common biological setting such as the same cell type. therefore, two genes with similar ontology fingerprints are more likely to cooperatively work in a common biological environment than those that are not. this information could be used as prior knowledge to preferentially retain or reject the edges in the canonical network in a principled manner. learning cell-type-specific signaling network using the provided experimental data, we trained our bayesian network-learning algorithm to infer a hepg cell specific network. figure 3a shows the provided canonical network and the final predicted network is shown in figure 3b. dream competition only required to report a collapsed graph, i.e. all hidden nodes removed, and only the paths among the observed phosphoproteins shown. figure shows the comparison between the collapsed canonical network and the network learned by our algorithm. the figure shows that the learned graph is simpler than the canonical graph: it contains edges instead of in the canonical network. notably, the number of each receptor's edges was reduced to three, resulting in a narrower transduction path for each receptor. an intermediary node lost all outgoing signals except one, and two terminal nodes lost their connecting edge. another intermediary node lost its incoming signals from three of the four signal nodes. the predicted network represents a biologically plausible signaling pathway specific to hepg cells, partially due to the novel graph search algorithm based on the ontology fingerprints. for instance, the connections between ikk and ikb tended to be kept during graph updating due to the relatively high similarity of their ontology fingerprints, with the similarity score ranking above the 80th percentile. in contrast, the connection between erk1/ and hsp2/ was deleted with a high probability since their similarity score lies on the 30th percentile. overall, the model updating process based on the novel graph search algorithm seamlessly included prior biological knowledge embedded in the literature and go. based on the training data of hepg cell, employing lasso regression in learning bayesian network parameters further identifies main paths specifically transducing the signal in this cell type, resulting in a sparse network. our results also indicate that bayesian network is particularly suitable for modeling cellular signal transduction in that principled statistical inference algorithms, e.g., the belief propagation algorithm, enabled us to represent hidden variables in the graph and to infer detailed signal transduction in the pathway. in contrast, other modeling approaches reported at the dream conference, e.g., methods based biochemical systems theory, usually ignore all hidden variables to reduce the complexity of network modeling and parameter estimation at the cost of missing intermediate information. the full network predicted by our approach consists of nodes connected by totally edges, and each edge is associated with a parameter that quantifies the relationship of the signal propagated from the parent node to its child node. in this network, twenty-four nodes are hidden but our inference algorithm correctly inferred their states and relationships between the nodes in the network. for instance, the directed edge from ras to raf, both of which are hidden nodes, was assigned with a positive coefficient, indicating that ras plays a strong activation role for raf this infer-ence agrees with previous findings that raf is a critical ras effector target, and its activation is a consequence of ras activation and the formation of ras-gtp-raf complex. the positive connection between another pair of hidden nodes, from rac to pak, is also consistent with the fact that pak is the downstream effector of rac. zimmerman and moelling suggested that akt-mediated phosphorylation of raf leads to the inhibition of the raf-mek-erk cascade and the modulation of the cellular response. indeed, our algorithm correctly captured this relationship, which assigned a negative coefficient to the edge from akt to raf in our predicted network. while the low coefficient may reflect the fact that the inference used the measurement performed on two distal nodes--akt and erk, the negative value is indeed consistent with the known inhibitory effect. these evidences demonstrate that our approach can utilize the limited observed data to infer the signal transduction of the full network, even though the state of certain nodes are not observed. predicting cellular responses to stimuli using the final graph and the associated parameters learned from the bayesian network approach, we performed simulation studies to predict cellular responses to a set of provided stimuli and compared the "predicted" results with the observed training data. the comparison showed a very significant correlation. figure shows the scatter plot between the predicted versus the observed levels for the phosphoprotein activity of all proteins under all conditions. figure compares the fitting of the data under different conditions for each of the proteins. the black curves denote the observed phosphoprotein activity levels, while the red curves represent the corresponding predicted values. the blue-line within each box indicates the detection threshold of the detector. overall, the predictions are highly consistent with the observed data, indicating that our model is able to capture the signal transduction in hepg cells with a sparse network. using the predicted hepg specific network and the learned parameters, we then predicted the phosphoprotein activity levels of the proteins under the test conditions given by the dream challenge. the predicated phosphoprotein activities were evaluated against experimental measurement by the organizers of dream challenge using two criteria: first, the accuracy evaluated by a prediction cost function; second, network parsimony. our group ranked within the top five among all submissions for this challenge. this outcome demonstrates that incorporating prior biological knowledge in the form of the ontology fingerprint with statistical algorithms for graph searching and parameter estimation can significantly outperform many other approaches for signaling network inference. our results also demonstrate a novel way to integrate ontological data and literature in learning signaling network construction, as well as the feasibility of applying ontology as biological information in other challenging data-mining problems. discussion a signaling network is a complex and dynamic system that governs biological activities and coordinates cellular functions. defects in signal transduction are responsible for diseases such as cancer, autoimmunity, and diabetes. by understanding signaling networks, mechanisms of diseases can be investigated more specifically, and the disease could be targeted and treated more efficiently. moreover, different cell types often activate different parts of signaling networks, resulting in different responses to the same perturbation. in this study, we addressed the dream challenge of predicting signaling networks using two innovative approaches: 1) by incorporating prior knowledge in the form of the ontology fingerprint, we efficiently and preferentially search biologically plausible models, and 2) by using lasso regression, we unified the bayesian network parameter learning and structure learning in a data-driven manner. these improvements are principled from a statistical learning point of view and sensible from a biological point of view. participants of the dream challenge developed various computational approaches to model the signaling network and predict their cellular responses to different stimuli. dynamic mathematical modeling implemented in a system of differential equations is one of the mainstream approaches. the method represents signal transduction as detailed and biochemically realistic mathematical equations with the need to estimate many free parameters. however, the parameter estimation becomes extremely challenge as the number of species in the network increases. to circumvent this pitfall, one of the participant teams using this approach omitted all hidden nodes, i.e. species not subjected to experimental manipulation or measurement. such simplification resulted in missing information of network topology and intermediate signal transduction. an alternative approach is to depict the signaling pathway as a logical model and utilize a two-state discrete logic to approximate the signal propagation in the network. however, the boolean model is a deterministic approach not rigorous enough to capture real biological events. furthermore, this model also involved node compression process to remove non-identifiable elements. by contrast, bayesian network analysis represents an effective mean to encode both the prior knowledge of network topology and the probabilistic dependency in signaling networks. this approach has the advantage of being able to handle hidden nodes in a principled manner and to model mixed information of both the noisy continuous measurements and the discrete regulatory logic by modeling these nodes as latent variables and infer novel signaling paths from observed data. such advantage is particularly useful in real world application where experimental measurements are expansive and limited to certain selected proteins. the utility of these data can be maximized by using latent variables to infer novel signaling paths that contain proteins not been measured. however, the application of bayesian network in real world modeling is limited due to the super exponential space one has to search in order to identify the optimal model. compared with other approaches applied in the dream challenge, our approach has several significant advantages: 1) it is able to predict the discrete state of proteins in a probabilistic manner under different stimuli, without the requirement of node compression; 2) the incorporation of prior biological knowledge embedded in the ontology fingerprint accelerates the search for optimal network topology, in other words, it increases the probability of obtaining an optimal network within limited learning time; 3) the ontology fingerprint enhanced network search process makes the inferred network more biologically sensible; 4) the lasso model regularization method efficiently assist the search for a sparse network. our algorithm was further improved by embedding biological information from the ontology fingerprint into the learning stage of the bayesian network modeling. this was accomplished through the introduction of prior distributions for the variables. the seamless integration of prior knowledge into the bayesian network framework allowed us to construct a cell-type specific signal transduction pathway and to use the pathway to predict novel perturbation outcomes in the dream competition. the ontology fingerprint derived from pubmed literature and biomedical ontology serve as a comprehensive characterization of genes. compared to current gene annotation, the ontology fingerprints were generated by a largely unsupervised method, thus do not need well-annotated corpus which is difficult to assemble. in addition, the enrichment p-value associated with each ontology term in an ontology fingerprint can be used as a quantitative measure of biological relevance between genes--a feature that is lacking in current gene annotations. this comprehensive and quantitative characterization of genes works well as prior knowledge in our graph searching strategy. in contrast, commonly used graph searching algorithms, such as genetic algorithms, only rely on a randomized exhaustive search that is not able to utilize useful prior information. this limitation not only makes these algorithms inefficient in searching the plausible model space but also potentially lead to networks that are biologically irrelevant. to assess the contribution of the ontology fingerprints to bayesian network learning algorithm, we compared the likelihoods of bayesian networks iteratively updated with or without the guidance of prior knowledge derived from the ontology fingerprints. starting with the canonical network, we iteratively updated network structure until a fixed number of networks were obtained. the converged likelihood of each network was obtained by monte carlo em algorithm. the likelihoods from ontology fingerprint-guided network update were significantly higher than those without the guide. in addition, we investigated the performance of ontology fingerprint enhanced bayesian network in eliminating biologically irrelevant relationships from the network. we randomly added edges with similarity scores of zero into the canonical network, and considered the new network as a noisy network. starting with this noisy network, we performed the same comparison as described above, and the resulting likelihoods from ontology fingerprint-guided network update were also significantly higher than the update process without prior knowledge. furthermore, the network update with prior knowledge successfully identified and eliminated noisy edges quickly at the first several iterations. these results demonstrated that integrating the ontology fingerprint as prior knowledge can speed up the convergence of likelihood, resulting in the increased efficiency of both identifying optimal network structure and retaining biological meaningful connections in the final network. in addition to prior knowledge, our approach also employed the lasso technique to select a plausible model in a data driven manner. lasso is one of the regularization algorithms originally proposed for linear regression models, and has become a popular model shrinkage and selection method. the lasso method combines shrinkage and model selection by automatically setting certain regression coefficients to zero. this approach effectively deleted certain candidate edges between signaling molecules, and helped to remove redundant variables to obtain a concise model in the final step.  by incorporating prior biological knowledge, utilizing advanced statistical method for parameter estimation and modeling unobserved nodes as latent variables, we developed a novel approach to infer active signaling networks from experimental data and a canonical network. our results demonstrated that these improvements allow us to predict signaling network structure and responses that match closely to those identified by experimental approaches. competing interests the authors declare that they have no competing interests. authors' contributions wjz initiated the idea of incorporating the ontology fingerprint for network prediction and guided the development of the ontology fingerprints. tq and lct worked on the method development and signaling network prediction. kjs advised the biological knowledge about the signaling pathway. xl advised the bayesian network development. tq and lct drafted and wjz and xl finalized the manuscript. wjz supervised the overall development of the project. all authors have read and approved the manuscript. 
while statistical method such as bayesian network has been explored to meet this challenge, employing existing biological knowledge for network prediction is difficult. the objective of this study is to develop a novel approach that integrates prior biological knowledge in the form of the ontology fingerprint to infer cell-type-specific signaling networks via data-driven bayesian network learning; and to further use the trained model to predict cellular responses. bayesian network can be used to simulate the propagation of signals in cellular systems. the challenge results showed that our method accurately captured signal transduction of a network of protein kinases and phosphoproteins in that the predicted protein phosphorylation levels under all experimental conditions were highly correlated with the observed results. based on the evaluation of the dream organizer, our team was ranked as one of the top five best performers in predicting network structure and protein phosphorylation activity under test conditions. incorporating the ontology fingerprint as prior biological knowledge allows us to efficiently infer concise signaling network structure and to accurately predict cellular responses. we applied our novel approach to address the predictive signaling network modeling challenge of the fourth dialog for reverse engineering assessment's and methods competition.
 despite large amounts of available genomic and proteomic data, predicting the structure and response of signaling networks is still a significant challenge. while statistical method such as bayesian network has been explored to meet this challenge, employing existing biological knowledge for network prediction is difficult. the objective of this study is to develop a novel approach that integrates prior biological knowledge in the form of the ontology fingerprint to infer cell-type-specific signaling networks via data-driven bayesian network learning; and to further use the trained model to predict cellular responses.  we applied our novel approach to address the predictive signaling network modeling challenge of the fourth dialog for reverse engineering assessment's and methods competition. the challenge results showed that our method accurately captured signal transduction of a network of protein kinases and phosphoproteins in that the predicted protein phosphorylation levels under all experimental conditions were highly correlated with the observed results. based on the evaluation of the dream organizer, our team was ranked as one of the top five best performers in predicting network structure and protein phosphorylation activity under test conditions.  bayesian network can be used to simulate the propagation of signals in cellular systems. incorporating the ontology fingerprint as prior biological knowledge allows us to efficiently infer concise signaling network structure and to accurately predict cellular responses. 22- april the international conference on intelligent biology and medicine nashville, tn, usa 