MetaReg: a platform for modeling, analysis and visualization of biological systems using large-scale experimental data
Genome Biology volume 9, Article number: R1 (2008)
MetaReg http://acgt.cs.tau.ac.il/metareg/application.html is a computational tool that models cellular networks and integrates experimental results with such models. MetaReg represents established knowledge about a biological system, available today mostly in informal form in the literature, as probabilistic network models with underlying combinatorial regulatory logic. MetaReg enables contrasting predictions with measurements, model improvements and studying what-if scenarios. By summarizing prior knowledge and providing visual and computational aids, it helps the expert explore and understand her system better.
Given the recent accumulation of high throughput biological data, the task of integrating and analyzing large-scale datasets is a major challenge. A variety of computational modeling approaches have been developed for the analysis of such datasets, such as clustering [1, 2] and topological interaction network models [3, 4]. While these approaches give a broad, low resolution picture of cellular processes, many biologists are interested in a specific subsystem, and wish to use the results from experiments in order to refine the current knowledge on the system. This analysis of data in the context of the available knowledge is often performed in an informal manner: The researcher sketches a diagram of a relevant subsystem according to the current knowledge. This diagram summarizes and organizes the available knowledge, and assists the expert in analyzing the predicted state of the system in various possible experiments. The predictions are then compared to experimental measurements, and if a discrepancy is found, additional experiments are performed, and the diagram is iteratively refined.
In the case of complex biological systems and massive amounts of data, manual construction of the model, state predictions, comparison with data and systematic model refinements are impractical, and automatic computational methodologies must be employed [5, 6]. To address the need for such an analysis workflow, we developed MetaReg, an integrative tool for analysis of steady-state, high-throughput data in the context of specific biological systems. The theoretical foundations of the MetaReg methodology and algorithms are outlined below in the 'MetaReg's algorithmic layer' section (for a complete description, see ). While making some gross simplifying assumptions about the behavior of real biological systems, the model was demonstrated to be highly effective on several systems [7–9]. MetaReg enables easy conversion of the current qualitative knowledge on a particular subsystem into a mathematical model, including logical relations among the biological components. The system is represented by a probabilistic graphical model called a Bayesian network , which allows distinguishing between regulatory relations that are known at a high level of certainty and those that are more speculative. Given the model, MetaReg predicts the level of each variable under any given genetic perturbation or environmental stimuli. Moreover, MetaReg allows incorporation of high throughput data, and graphical comparison between model predictions and measurements. The most advanced MetaReg capability is suggesting model refinements by systematically seeking changes that increase the fit between model predictions and experimental measurements.
The MetaReg application
MetaReg core functionality
Figure 1 illustrates the key features of the MetaReg application and its workflow. The basic workflow begins with model construction and its initial analysis through simulations. Once a current-knowledge model is established, it can be used to predict component values under any experimental treatment (for example, genetic perturbation, growth environment). Next, we compare these predictions to the values observed in the actual experiments under the same treatments, and highlight the discrepancies between them graphically. MetaReg can also automatically refine the model in order to reduce such discrepancies. Screenshots of the main windows from the application are shown in Figure 2. A comprehensive manual of the application is available online .
The first step in utilizing MetaReg is the construction of the biological system model on the 'model canvas' (Figure 2a). A MetaReg model consists of a set of biological variables and their regulatory logics. The 'variables' represent different biological entities (mRNA, protein, metabolite, and so on). Each variable may attain several discrete 'states' (three states by default), representing, for example, the transcript level of an mRNA, or the activity level of an enzyme. The state of a variable v is influenced by the states of the variables that are connected to v by incoming edges. These variables are called the 'regulators' of v. Most importantly, every variable is assigned a discrete 'logic', which defines its state given the states of its regulators. For example, if variable A has two activators B and C, its logic might be Max(B, C). We assume all the logics represent steady-state regulatory relations, and thus the model represents the steady-state behavior of the biological system. Every logic is associated with a probability that indicates the certainty in the prior biological knowledge. For example, if a logic is known with high certainty, it will be assigned with a high probability (for example, 90%), and alternative logics will have low probabilities.
The application offers several tools to help in model construction. Variables can be selected from and automatically linked to known databases, such as SGD  and NCBI Gene  (Figure 2b). Each variable can be attributed with links to relevant journal publications from PubMed, enabling further model curation. The application provides several gadgets for logic definition, including scripting, a tabular editor and a logic wizard (Figure 2c) for hierarchical construction of complex logics. The type of each regulation, activation (→), repression (⊣) or other (-○) is automatically deduced based on the logic of the regulatee (the regulated variable). The model canvas is fully interactive, including capabilities for manual or automatic variable positioning and highlighting of different sets of variables, such as all the metabolites or all the cycles in the model.
In order to view the behavior of the model in response to different experimental treatments, simulations can be performed. Given a particular experimental treatment, the possible system states are computed as described in . A 'system state' is an assignment of states to all the variables in the model. The user can dynamically design an experimental treatment scenario and visually analyze the system state on the model canvas. If the model contains cycles, several system states might be feasible, and the user can navigate among them.
The application can integrate 'observations' (measurements) from multiple studies. The measured biological components are automatically matched to the model variables. For example, gene expression data are automatically matched to the corresponding mRNA variables, and protein measurements are matched to the corresponding protein variables. As part of the data import, the user must specify the 'experimental treatment' used in each experiment, including the environmental stimulations and genetic perturbations performed in each particular experiment. For example, if the experiment was performed in surplus of nitrogen and on a yeast strain where Leu3 is knocked out, the experimental treatment is 'Leu3 = 0; Nitrogen = 2', where Leu3 and Nitrogen are model variables. Once the data are imported, it is possible to visualize all measured variables under each of the experiments in a single data matrix (Figure 2d; see below), or to view the measurements of a specific experiment projected on the model canvas (Figure 2a).
Comparing predictions with observations
In order to evaluate the model, the 'predicted' levels of each variable are compared to its 'observed' levels under each experiment. MetaReg provides a prediction engine that infers probabilistically the expected level of each variable in each experiment, given the network model and the experimental treatment (see ). MetaReg supports two visualization tools to compare these predictions with the observations, both designed to highlight cases of discrepancies, which are often the starting point of further research. First, the observed and the predicted values for a single experiment can be projected side by side on the model canvas (Figure 2a). The second visualization tool provides a comprehensive view of the discrepancies across all the experiments, in which each cell contains color-coded representation of the observed and the predicted values, along with a representation of the discrepancy between them (Figure 2d). This view allows simple detection of discrepancy 'hot-spots' in which the model fails to explain the data.
Our methodology enables refinement of the model to obtain better fit between model predictions and observations. The input of the refinement process is the target variable and a set of regulators. MetaReg searches among all possible regulatory logics and outputs the most significant one. The suggested logic can be further edited by the user (Figure 2e). This way the user can test hypotheses about variable regulation.
Case study: leucine biosynthesis in Saccharomyces cerevisiae
Modeling and simulations
We present a model for leucine biosynthesis and related signaling pathways in Saccharomyces cerevisiae. Building on literature reports, we constructed a detailed model of known regulatory relations in this system. The model contains 47 variables (nodes) and 67 regulations (arcs). The model is available from our web site .
Leucine is an essential branched-chain amino acid generated from pyruvate via α-ketoisovalerate, α-isopropylmalate (α-IPM) and β-IPM in a linear pathway in which nine catalyzing enzymes are involved (Ilv2, Ilv3, Ilv5, Leu9, Leu4, Leu1, Leu2, Bat1, Bat2). The regulation of leucine production is controlled by several known mechanisms .
Several leucine biosynthetic enzymes are subject to transcription regulation via the general regulatory pathway of amino acid biosynthesis. Starvation for any amino acid induces the translation of Gcn4 via Gcn2. Gcn4 is a transcriptional activator of enzymes that catalyze several amino acid biosynthesis pathways, including the leucine biosynthetic pathway.
The control of several catalyzing enzymes is regulated by the transcriptional activator Leu3. The activity of Leu3 is regulated by α-IPM, an intermediate of the pathway acting as a co-inducer. When α-IPM is present, Leu3 acts as activator; when α-IPM is absent, Leu3 acts as repressor . Hence, α-IPM serves as a sensor of leucine production.
The enzymatic activity of Leu4 is subject to two major controls by metabolites. The first is feedback (end product) inhibition by leucine. At high levels of leucine, Leu4 activity is inhibited, and causes a reduction in the production of the pathway. The second control is inactivation by coenzyme A, a product of the reaction catalyzed by Leu4 and a central energy metabolite in the mitochondria. This control serves as a link between the metabolic process and the energy metabolism context.
In Figure 3, we present a diagram of our model. It includes the leucine biosynthetic pathway, the catalyzing enzymes and their transcriptional control. The state of internal leucine depends on the leucine transport into the cell and on the yield of the leucine biosynthetic pathway. The transport is facilitated via amino acid permeases (Bap2, Bap3, Gap1, Tat1) that are regulated by Gcn4, Leu3, and the TOR signaling pathways. The model includes four environmental stimulators: 'NH3' (ammonium), 'rapamycin', 'leucine', and 'amino acids', which indicates availability of all amino acids except leucine that are needed to represent the environmental conditions enforced on the system. The model graph contains many cycles. For example, the general nitrogen control regulation (for example, Gcn4 → biosynthetic enzymes → leucine biosynthesis pathway → internal amino acids → Gcn2 → Gcn4), the leucine-specific transcriptional regulation via Leu3 (Leu3 → biosynthetic enzymes → leucine biosynthesis pathway → α-IPM → Leu3), and autoregulation of Leu3 transcription factor (TF) on LEU3 gene transcription (LEU3 ↔ Leu3). The variables that are part of cycles in the model are highlighted in Figure 3.
We used three states for each mRNA variable: state '0' represents reduced transcription level compared to the wild type, state '1' represents the wild-type transcription level when cells are grown on YPD medium, and state '2' represents increased transcription level. Similarly, each protein has three states reflecting its activity level (high = '2', medium = '1', low = '0'). The modeling of Leu3 is a special case, since we had to represent its dual role as activator and repressor. We used state '0' for its repressive mode, state '1' represents no effect (for example, in the leu3 mutant), and state '2' indicates the Leu3 activator mode. For example, a simulation of the system behavior in leucine starvation is shown in Figure 3.
We integrated expression profiles from four datasets that contain treatments pertinent to our model: seven profiles in rapamycin treatment after 15, 30, 60 and 120 minutes of incubation and in amino acid deprivation after 1, 1.5 and 2 hours of incubation ; six profiles in histidine starvation and various Gcn4 perturbations ; six profiles of chemostat growth in nitrogen limiting conditions with and without Leu3 perturbation ; and six profiles in nitrogen depletion after 8, 12 and 24 hours of treatment and in amino acid and adenine starvation after 1, 2 and 4 hours of treatment . A complete description of the profiles, the experimental treatments under which they were obtained and the data preprocessing, is available in Additional data file 1.
Evaluation of the model in accordance with data
We applied the prediction engine of MetaReg to the collection of experimental treatments described above. The matches and mismatches between the predictions and the observations are displayed by the discrepancy matrix in Figure 4b. While there is a good match for the majority of the components and conditions, the matrix reveals several major discrepancies between the model and the microarray experiments.
The leucine biosynthetic genes LEU1, LEU2, LEU4 and BAP2 show an unexpected decrease in expression in the leu3 mutant strain (Figure 4b, columns 16-18). The reduction was surprising since Leu3 is known to act as a repressor in these experiments.
In gcn4 mutant strains, we observed an increase in the mRNA levels of the leucine biosynthetic genes BAT1, ILV2, ILV3 and ILV5 following 3AT treatment (histidine starvation; Figure 4a, columns 11-12). In our model the effect of general amino acid control on these genes is mediated solely by Gcn4. Since Gcn4 is absent in these experiments, our model does not predict such an increase, and a discrepancy appears (Figure 4b, column 12).
For LEU3, we observed an increase in expression in two gcn4 mutant strains and in nitrogen limitation experiments (Figure 4b, row 11, columns 11-15). According to the literature, LEU3 mRNA is upregulated by either Gcn4 or Leu3 TFs. As no amino acid shortage occurs in these experiments, neither Gcn4 nor Leu3 are expected to be active, hence the model predicts a low level of LEU3 mRNA, in contradiction to the observed increase.
Following a rapamycin treatment, we observed a consistent decrease in the levels of four biosynthetic genes, BAT1, ILV3, ILV5 and LEU1. The effect of rapamycin on the biosynthetic genes is known to be mediated by the TOR pathway through Gcn4 . It is thus expected that under rapamycin treatment, Gcn4 will be active, while Leu3 will not be active. Consequently, the levels of the leucine biosynthesis genes (LEU1, ILV3, ILV5, BAT1) regulated by Gcn4 should be alleviated. Surprisingly, we witness a down-regulation of these genes.
For LEU9, BAT2, BAP3 and TAT1, we could not find any report on their regulation in the literature, and thus their predicted level is constant. Hence, the discrepancies merely reflect the lack of knowledge about them.
Leucine model refinement
In order to improve the fit of the model's predictions to the observed data, we used MetaReg's refinement algorithm. We focus here on two representative examples of model refinement. In these examples we suggest improved logics for the way in which Leu3 and Gcn4 jointly regulate LEU9, BAT2 and LEU2.
LEU9 and BAT2 have similar expression patterns (Figure 4a), but we could not find any report on their regulation in the literature. MetaReg suggests that LEU9 is regulated solely by Leu3 with no definite regulatory role for Gcn4 (Figure 5a, LEU9 table, rows 1 and 3). A similar logic is obtained for BAT2. Note that for Leu3, MetaReg's refinement matches its known repressive role: when Leu3 acts as a repressor (Leu3 = 0), we observed medium/low transcription of LEU9, even though the level of the activator Gcn4 is high (Figure 5a, LEU9 table).
LEU2 expression is known to be affected only by Leu3 . Indeed, the suggested logic (Figure 5) shows that the state of Gcn4 does not influence Leu2. As expected, when Leu3 should act as activator (Leu3 = '2') there is high transcription (LEU2 = '2'). However, we do not detect the expected repressive effect of Leu3 on its targets. When Leu3 should act as repressor (Leu3 = '0'), we observe medium LEU2 transcription (LEU2 = '1') instead of the expected low transcription.
Figure 5b,c illustrates the refinement process. During refinement, MetaReg tests the predicted activity levels of the TFs (Gcn4 and Leu3) against the observed level of the mRNA in each experiment (Figure 5b), and computes the best logic between the regulators' predicted level and the observations. Consequently, the discrepancies observed for LEU2 and LEU9 in our initial model (before refinement) are drastically reduced after refinement (Figure 5c).
In the case of LEU1, BAT1, LEU4, ILV2, ILV3 and ILV5, the results were similar to LEU2 (not shown). For BAP2, BAP3, TAT1 and LEU3, MetaReg did not succeed in deriving a high confidence logical relation, due to inconsistent effects that could not be explained by the model. For example, for TAT1, only down-regulation is observed in the data (Figure 4a, last row). For BAP3, we observe an inconsistency between two sets of nitrogen depletion experiments in different studies (Figure 4a, columns 13-15 versus 19-21). This probably indicates that each of those genes is regulated by additional elements that are not included in the model.
MetaReg's algorithmic layer
In this section, we briefly outline the algorithmic layer behind the MetaReg application. A full description can be found in .
Modeling prior knowledge
Our model consists of variables X1...Xn, represented by nodes, and regulations among them, represented by arcs. The set of variables that together regulate variable Xi are called its 'regulatory unit', denoted Pai. This is the set of nodes that have arcs directed into Xi. Each variable can be in one of several discrete 'states', and its state in any condition is assumed to be determined by its 'logic', that is, a discrete function of its regulators' states in that condition. Note that this assumption implies that the relevant conditions are in steady state. In order to model our confidence in the prior knowledge, the logic of a variable Xi is formulated probabilistically as our level of certainty that the variable attains a certain state given the state of its regulatory unit. The uncertainty is modeled by the conditional probability θi(Xi | Pai). This approach allows us to distinguish between regulatory logics that are known at a high level of certainty and those that are more speculative.
The experimental treatment is modeled by fixing the states of each variable that correspond to the environment, and by changing the regulation function priors to reflect the perturbations (for example, when a gene is knocked out, its level is set to zero under that condition, irrespective of the levels of its regulators).
In practice, biological measurements are continuous, and one does not know in advance how to translate them into discrete states. To overcome this, each logical variable Xi is associated with an observed real-valued variable Yi, and the conditional distribution ψi(Yi | Xi) specifies the probability of the variable Yi to attain a certain observed real value given its state. Hence, ψi(Yi | Xi) translates the actual measurements into the discrete model without applying any a priori discretization to the data. In MetaReg, each ψ is modeled as a mixture of Gaussians.
The complete computational model
Our probabilistic model defines a 'Bayesian score', which evaluates the fit of the model predictions to the data, measured as the log likelihood of the data given the model:
where Z is a normalization constant. The conditional probabilities θi are known from our prior knowledge of the biological system, and ψ are determined by maximizing a likelihood score using an Expectation-Maximization procedure. This model corresponds to a Bayesian network in the case of acyclic dependencies, or to a factor graph in the more general case where the model contains feedback loops.
Computing model predictions
The 'predicted level' is the expected value of a variable Xi given the model and the experimental procedure applied. This is obtained by first computing the posterior states distribution of Xi using a standard probabilistic inference method called Loopy Belief Propagation . This way we obtain a probabilistic average of all its possible system modes. Then, the (continuous) predicted level of Xi is its expectation given θi and its states distribution. The comparison of predicted and observed levels (both on the model canvas and in a discrepancy matrix) displays both levels as real values.
Given a target gene and its candidate regulatory unit, the refinement process searches in the space of discrete regulatory logics in order to achieve a logic with a locally maximum Bayesian score, while fixing the logics of all other variables. Due to an exponential number of possible logics, we apply a greedy heuristic. In the case of ties the algorithm chooses randomly among the equally scored improvements. The ψi parameters depend strongly on the particular model logics, and thus we re-optimize them using an expectation-maximization (EM)-like procedure during each step of the logical refinement procedure. Note that the refinement process utilizes the Loopy Belief Propagation algorithm, and thus the solution builds on probabilistic averaging of all possible system modes.
MetaReg provides a framework for the modeling and analysis of a biological network vis-à-vis high throughput data. A major practical need of molecular biologists today is to generate hypotheses based on network modeling and to iteratively refine the network. MetaReg is designed exactly for this purpose - it allows mathematical modeling of a biological system, interpretation of high throughput data in the context of the prior model, and computational refinement of the model based on the high throughput data. Several other tools with related capabilities, emphasizing visualization or simulations, are being developed (Table 1). The MetaReg platform is unique in its modeling and refinement capabilities, which fit the needs and workflow of biological investigations. It allows streamlined cycles of probabilistic modeling, laboratory experimentation and systematic refinement.
MetaReg is implemented efficiently, computing predictions and logic refinements within a few seconds for 100 nodes, and within an hour for 6,000 nodes (using a network with no more than three regulators per variable, 90% certainty level in all logics, and 100 gene expression profiles). However, the model has practical size limitations: the prediction algorithm run-time increases exponentially with the average number of regulators per variable. Also, for large models with over 300 variables, the automatic layout of the model topology may take several minutes.
MetaReg formalizes the biological system using discrete component states, assuming that the system is in steady state. Clearly these crucial assumptions are a simplification of the biological reality. By making such assumptions, we tried to strike a practical balance between our wish to enable a faithful description of the biological system and the scarcity of accurate knowledge at very high resolution. Indeed, biological processes are inherently temporal, but when the sampling rate (the number and time resolution of experiments) is low relative to the rate of the regulatory mechanisms, we believe that our results here as well as in [7–9] show that the steady state assumption is reasonable.
The accuracy of the prediction and refinement processes may be sensitive to the model size and the certainty in the logics. We have shown previously that the algorithms are highly robust to certainty level on small networks . Indeed, the results shown in the leucine example were obtained using a uniform certainty level of 0.99 for all variables, but we obtained very similar results when using certainty levels of 0.95 and 0.9 (not shown). However, the robustness of our methods to model size and to certainty levels requires further systematic exploration.
A major prerequisite to using MetaReg is formalizing high quality prior knowledge on the pathway of interest. Several efforts to generate databases of curated knowledge on signaling pathway are currently under way (for example, BioModels , Reactome  and SPIKE ). Thanks to such efforts, it will soon be relatively easy to apply the MetaReg methodology in studying many additional biological systems.
Availability and requirements
Project name: MetaReg (home page at ).
Operating system(s): Windows.
Programming language: Java for the envelope and C++ for the algorithms.
Other requirements: Java 1.5 or higher.
License: free for non-commercial users.
Any restrictions to use by non-academics: License needed.
Additional data files
The following additional data are available with the online version of this paper. Additional data file 1 provides a complete description of the profiles, the experimental treatments under which they were obtained and the data preprocessing.
Eisen MB, Spellman PT, Brown PO, Botstein D: Cluster analysis and display of genome-wide expression patterns. Proc Natl Acad Sci USA. 1998, 95: 14863-14868. 10.1073/pnas.95.25.14863.
Segal E, Shapira M, Regev A, Pe'er D, Botstein D, Koller D, Friedman N: Module networks: identifying regulatory modules and their condition-specific regulators from gene expression data. Nat Genet. 2003, 34: 166-176.
Bader GD, Hogue CW: An automated method for finding molecular complexes in large protein interaction networks. BMC Bioinformatics. 2003, 4: 2-10.1186/1471-2105-4-2.
Rives AW, Galitski T: Modular organization of cellular networks. Proc Natl Acad Sci USA. 2003, 100: 1128-1133. 10.1073/pnas.0237338100.
Klipp E, Nordlander B, Kruger R, Gennemark P, Hohmann S: Integrative model of the response of yeast to osmotic shock. Nat Biotechnol. 2005, 23: 975-982. 10.1038/nbt1114.
Covert MW, Knight EM, Reed JL, Herrgard MJ, Palsson BO: Integrating high-throughput and computational data elucidates bacterial networks. Nature. 2004, 429: 92-96. 10.1038/nature02456.
Gat-Viks I, Tanay A, Raijman D, Shamir R: A probabilistic methodology for integrating knowledge and experiments on biological networks. J Comput Biol. 2006, 13: 165-181. 10.1089/cmb.2006.13.165.
Gat-Viks I, Tanay A, Shamir R: Modeling and analysis of heterogeneous regulation in biological networks. J Comput Biol. 2004, 11: 1034-1049. 10.1089/cmb.2004.11.1034.
Gat-Viks I, Shamir R: Refinement and expansion of signaling pathways: the osmotic response network in yeast. Genome Res. 2007, 17: 358-367. 10.1101/gr.5750507.
Pearl J: Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference. 1988, Morgan Kaufmann, Palo Alto, CA
MetaReg Manual. [http://acgt.cs.tau.ac.il/metareg/manual/]
Cherry JM, Adler C, Ball C, Chervitz SA, Dwight SS, Hester ET, Jia Y, Juvik G, Roe T, Schroeder M, et al: SGD: Saccharomyces Genome Database. Nucleic Acids Res. 1998, 26: 73-79. 10.1093/nar/26.1.73.
Maglott D, Ostell J, Pruitt KD, Tatusova T: Entrez Gene: gene-centered information at NCBI. Nucleic Acids Res. 2005, D54-58. 33 Database
MetaReg Application. [http://acgt.cs.tau.ac.il/metareg/application.html]
Kohlhaw GB: Leucine biosynthesis in fungi: entering metabolism through the back door. Microbiol Mol Biol Rev. 2003, 67: 1-15. 10.1128/MMBR.67.1.1-15.2003.
Hardwick JS, Kuruvilla FG, Tong JK, Shamji AF, Schreiber SL: Rapamycin-modulated transcription defines the subset of nutrient-sensitive signaling pathways directly controlled by the Tor proteins. Proc Natl Acad Sci USA. 1999, 96: 14866-14870. 10.1073/pnas.96.26.14866.
Natarajan K, Meyer MR, Jackson BM, Slade D, Roberts C, Hinnebusch AG, Marton MJ: Transcriptional profiling shows that Gcn4p is a master regulator of gene expression during amino acid starvation in yeast. Mol Cell Biol. 2001, 21: 4347-4368. 10.1128/MCB.21.13.4347-4368.2001.
Boer VM, Daran JM, Almering MJ, de Winde JH, Pronk JT: Contribution of the Saccharomyces cerevisiae transcriptional regulator Leu3p to physiology and gene expression in nitrogen- and carbon-limited chemostat cultures. FEMS Yeast Res. 2005, 5: 885-897. 10.1016/j.femsyr.2005.04.003.
Gasch AP, Spellman PT, Kao CM, Carmel-Harel O, Eisen MB, Storz G, Botstein D, Brown PO: Genomic expression programs in the response of yeast cells to environmental changes. Mol Biol Cell. 2000, 11: 4241-4257.
Rohde JR, Campbell S, Zurita-Martinez SA, Cutler NS, Ashe M, Cardenas ME: TOR controls transcriptional and translational programs via Sap-Sit4 protein phosphatase signaling effectors. Mol Cell Biol. 2004, 24: 8332-8341. 10.1128/MCB.24.19.8332-8341.2004.
Kschischang FR, Frey BJ, Loeliger HA: Factor graphs and the sum-product algorithm. IEEE Trans Information Theory. 2001, 47: 498-519. 10.1109/18.910572.
Le Novère N, Bornstein B, Broicher A, Courtot M, Donizelli M, Dharuri H, Li L, Sauro H, Schilstra M, Shapiro B: BioModels Database: a free, centralized database of curated, published, quantitative kinetic models of biochemical and cellular systems. Nucleic Acids Res. 2006, D689-691. 10.1093/nar/gkj092. 34 Database
Vastrik I, D'Eustachio P, Schmidt E, Stein L: Reactome: a knowledge base of biologic pathways and processes. Genome Biol. 2007, 8: R39-10.1186/gb-2007-8-3-r39.
Fraser HB, Hirsh AE, Steinmetz LM, Scharfe C, Feldman MW: Evolutionary rate in the protein interaction network. Science. 2002, 296: 750-752. 10.1126/science.1068696.
Orlev N, Shamir R, Shiloh Y: PIVOT: protein interacions visualizatiOn tool. Bioinformatics. 2004, 20: 424-425. 10.1093/bioinformatics/btg426.
Tanay A, Steinfeld I, Kupiec M, Shamir R: Integrative analysis of genome-wide experiments in the context of a large high-throughput data compendium. Mol Syst Biol. 2005, 1: 2005.0002-10.1038/msb4100005.
Shannon P, Markiel A, Ozier O, Baliga NS, Wang JT, Ramage D, Amin N, Schwikowski B, Ideker T: Cytoscape: a software environment for integrated models of biomolecular interaction networks. Genome Res. 2003, 13: 2498-2504. 10.1101/gr.1239303.
Hu Z, Mellor J, Wu J, Yamada T, Holloway D, Delisi C: VisANT: data-integrating visual framework for biological networks and modules. Nucleic Acids Res. 2005, W352-357. 10.1093/nar/gki431. 33 Web Server
Kitano H, Funahashi A, Matsuoka Y, Oda K: Using process diagrams for the graphical representation of biological networks. Nat Biotechnol. 2005, 23: 961-966. 10.1038/nbt1111.
Bell GW, Lewitter F: Visualizing networks. Methods Enzymol. 2006, 411: 408-421. 10.1016/S0076-6879(06)11022-8.
Baigent S: Software review. Gepasi 3.0. Brief Bioinform. 2001, 2: 300-302. 10.1093/bib/2.3.300.
Adalsteinsson D, McMillen D, Elston TC: Biochemical Network Stochastic Simulator (BioNetS): software for stochastic modeling of biochemical networks. BMC Bioinformatics. 2004, 5: 24-10.1186/1471-2105-5-24.
You L, Hoonlor A, Yin J: Modeling biological systems using Dynetica - a simulator of dynamic networks. Bioinformatics. 2003, 19: 435-436. 10.1093/bioinformatics/btg009.
Rodriguez-Navarro S, Fischer T, Luo MJ, Antunez O, Brettschneider S, Lechner J, Perez-Ortin JE, Reed R, Hurt E: Sus1, a functional component of the SAGA histone acetylase complex and the nuclear pore-associated mRNA export machinery. Cell. 2004, 116: 75-86. 10.1016/S0092-8674(03)01025-0.
Alves R, Antunes F, Salvador A: Tools for kinetic modeling of biochemical networks. Nat Biotechnol. 2006, 24: 667-672. 10.1038/nbt0606-667.
Aldridge BB, Burke JM, Lauffenburger DA, Sorger PK: Physicochemical modelling of cell signalling pathways. Nat Cell Biol. 2006, 8: 1195-1203. 10.1038/ncb1497.
Price ND, Reed JL, Palsson BO: Genome-scale models of microbial cells: evaluating the consequences of constraints. Nat Rev Microbiol. 2004, 2: 886-897. 10.1038/nrmicro1023.
Calzone L, Fages F, Soliman S: BIOCHAM: an environment for modeling biological systems and formalizing experimental knowledge. Bioinformatics. 2006, 22: 1805-1807. 10.1093/bioinformatics/btl172.
Bosl WJ: Systems biology by the rules: hybrid intelligent systems for pathway modeling and discovery. BMC Syst Biol. 2007, 1: 13-10.1186/1752-0509-1-13.
Klamt S, Saez-Rodriguez J, Gilles ED: Structural and functional analysis of cellular networks with CellNetAnalyzer. BMC Syst Biol. 2007, 1: 2-10.1186/1752-0509-1-2.
Gonzalez AG, Naldi A, Sanchez L, Thieffry D, Chaouiya C: GINsim: a software suite for the qualitative modelling, simulation and analysis of regulatory networks. Biosystems. 2006, 84: 91-100. 10.1016/j.biosystems.2005.10.003.
This work was supported by the EMI-CD project, which is funded by the European Commission within its FP6 Programme, under the thematic area 'Life sciences, genomics and biotechnology for health', contract number LSHG-CT-2003-503269. The information in this document is provided as is and no guarantee or warranty is given that the information is fit for any particular purpose. The user thereof uses the information at its sole risk and liability. The graphical capabilities of the model layout and related dialogs are deeply based on the implementations of the PIVOT  and SPIKE  software developed in close collaboration by R Shamir's group and Y Shiloh's group at the School of Medicine, Tel Aviv University. We are especially indebted to Giora Sternberg and Ran Blekhman for their fruitful support. The interactive data matrix display has been developed by Israel Steinfeld for the SIMBA website . We also would like to thank Amos Tanay for helpful discussions and Ewa Szczurek for testing MetaReg and helping to improve it. I Ulitsky is a fellow of the Edmond J Safra Bioinformatics Program at Tel-Aviv University.
IU developed the tool, performed the analysis and co-wrote the paper. IG-V conceived the study, developed MetaReg, performed the analysis and co-wrote the paper. RS conceived and supervised the study and co-wrote the paper.
Igor Ulitsky, Irit Gat-Viks contributed equally to this work.
Electronic supplementary material
About this article
Cite this article
Ulitsky, I., Gat-Viks, I. & Shamir, R. MetaReg: a platform for modeling, analysis and visualization of biological systems using large-scale experimental data. Genome Biol 9, R1 (2008). https://doi.org/10.1186/gb-2008-9-1-r1