Reduced modeling of signal transduction - a modular approach

Balanced truncation for model reduction of biological oscillators

Model reduction is a central problem in mathematical biology. Reduced order models enable modeling of a biological system at different levels of complexity and the quantitative analysis of its properties, like sensitivity to parameter variations and resilience to exogenous perturbations. However, available model reduction methods often fail to capture a diverse range of nonlinear behaviors observed in biology, such as multistability and limit cycle oscillations. The paper addresses this need using differential analysis. This approach leads to a nonlinear enhancement of classical balanced truncation for biological systems whose behavior is not restricted to the stability of a single equilibrium. Numerical results suggest that the proposed framework may be relevant to the approximation of classical models of biological systems.

A mean-field approach for modeling the propagation of perturbations in biochemical reaction networks

Often, the time evolution of a biochemical reaction network is crucial for determining the effects of combining multiple pharmaceuticals. Here we illustrate a mathematical framework for modeling the dominant temporal behaviour of a complicated molecular pathway or biochemical reaction network in response to an arbitrary perturbation, such as resulting from the administration of a therapeutic agent. The method enables the determination of the temporal evolution of a target protein as the perturbation propagates through its regulatory network. The mathematical approach is particularly useful when the experimental data that is available for characterizing or parameterizing the regulatory network is limited or incomplete. To illustrate the method, we consider the examples of the regulatory networks for the target proteins c-Myc and Chop, which play an important role in venetoclax resistance in acute myeloid leukemia. First we show how the networks that regulate each target protein can be reduced to a mean-field model by identifying the distinct effects that groups of proteins in the regulatory network have on the target protein. Then we show how limited protein-level data can be used to further simplify the mean-field model to pinpoint the dominant effects of the network perturbation on the target protein. This enables a further reduction in the number of parameters in the model. The result is an ordinary differential equation model that captures the temporal evolution of the expression of a target protein when one or more proteins in its regulatory network have been perturbed. Finally, we show how the dominant effects predicted by the mathematical model agree with RNA sequencing data for the regulatory proteins comprising the molecular network, despite the model not having a priori knowledge of this data. Thus, while the approach gives a simplified model for the expression of the target protein, it allows for the interpretation of the effects of the perturbation on the regulatory network itself. This method can be easily extended to sets of target proteins to model components of a larger systems biology model, and provides an approach for partially integrating RNA sequencing data and protein expression data. Moreover, it is a general approach that can be used to study drug effects on specific protein(s) in any disease or condition.

Using rxncon to Develop Rule-Based Models

We present a protocol for building, validating, and simulating models of signal transduction networks. These networks are challenging modeling targets due to the combinatorial complexity and sparse data, which have made it a major challenge even to formalize the current knowledge. To address this, the community has developed methods to model biomolecular reaction networks based on site dynamics. The strength of this approach is that reactions and states can be defined at variable resolution, which makes it possible to adapt the model resolution to the empirical data. This improves both scalability and accuracy, making it possible to formalize large models of signal transduction networks. Here, we present a method to build and validate large models of signal transduction networks. The workflow is based on rxncon, the reaction-contingency language. In a five-step process, we create a mechanistic network model, convert it into an executable Boolean model, use the Boolean model to evaluate and improve the network, and finally export the rxncon model into a rule-based format. We provide an introduction to the rxncon language and an annotated, step-by-step protocol for the workflow. Finally, we create a small model of the insulin signaling pathway to illustrate the protocol, together with some of the challenges-and some of their solutions-in modeling signal transduction.

Model reduction in mathematical pharmacology : Integration, reduction and linking of PBPK and systems biology models

In this paper we present a framework for the reduction and linking of physiologically based pharmacokinetic (PBPK) models with models of systems biology to describe the effects of drug administration across multiple scales. To address the issue of model complexity, we propose the reduction of each type of model separately prior to being linked. We highlight the use of balanced truncation in reducing the linear components of PBPK models, whilst proper lumping is shown to be efficient in reducing typically nonlinear systems biology type models. The overall methodology is demonstrated via two example systems; a model of bacterial chemotactic signalling in Escherichia coli and a model of extracellular regulatory kinase activation mediated via the extracellular growth factor and nerve growth factor receptor pathways. Each system is tested under the simulated administration of three hypothetical compounds; a strong base, a weak base, and an acid, mirroring the parameterisation of pindolol, midazolam, and thiopental, respectively. Our method can produce up to an 80% decrease in simulation time, allowing substantial speed-up for computationally intensive applications including parameter fitting or agent based modelling. The approach provides a straightforward means to construct simplified Quantitative Systems Pharmacology models that still provide significant insight into the mechanisms of drug action. Such a framework can potentially bridge pre-clinical and clinical modelling - providing an intermediate level of model granularity between classical, empirical approaches and mechanistic systems describing the molecular scale.

Maximal aggregation of polynomial dynamical systems

Ordinary differential equations (ODEs) with polynomial derivatives are a fundamental tool for understanding the dynamics of systems across many branches of science, but our ability to gain mechanistic insight and effectively conduct numerical evaluations is critically hindered when dealing with large models. Here we propose an aggregation technique that rests on two notions of equivalence relating ODE variables whenever they have the same solution (backward criterion) or if a self-consistent system can be written for describing the evolution of sums of variables in the same equivalence class (forward criterion). A key feature of our proposal is to encode a polynomial ODE system into a finitary structure akin to a formal chemical reaction network. This enables the development of a discrete algorithm to efficiently compute the largest equivalence, building on approaches rooted in computer science to minimize basic models of computation through iterative partition refinements. The physical interpretability of the aggregation is shown on polynomial ODE systems for biochemical reaction networks, gene regulatory networks, and evolutionary game theory.

Methods of Model Reduction for Large-Scale Biological Systems: A Survey of Current Methods and Trends

Complex models of biochemical reaction systems have become increasingly common in the systems biology literature. The complexity of such models can present a number of obstacles for their practical use, often making problems difficult to intuit or computationally intractable. Methods of model reduction can be employed to alleviate the issue of complexity by seeking to eliminate those portions of a reaction network that have little or no effect upon the outcomes of interest, hence yielding simplified systems that retain an accurate predictive capacity. This review paper seeks to provide a brief overview of a range of such methods and their application in the context of biochemical reaction network models. To achieve this, we provide a brief mathematical account of the main methods including timescale exploitation approaches, reduction via sensitivity analysis, optimisation methods, lumping, and singular value decomposition-based approaches. Methods are reviewed in the context of large-scale systems biology type models, and future areas of research are briefly discussed.

A combined model reduction algorithm for controlled biochemical systems

BACKGROUND

Systems Biology continues to produce increasingly large models of complex biochemical reaction networks. In applications requiring, for example, parameter estimation, the use of agent-based modelling approaches, or real-time simulation, this growing model complexity can present a significant hurdle. Often, however, not all portions of a model are of equal interest in a given setting. In such situations methods of model reduction offer one possible approach for addressing the issue of complexity by seeking to eliminate those portions of a pathway that can be shown to have the least effect upon the properties of interest.

METHODS

In this paper a model reduction algorithm bringing together the complementary aspects of proper lumping and empirical balanced truncation is presented. Additional contributions include the development of a criterion for the selection of state-variable elimination via conservation analysis and use of an 'averaged' lumping inverse. This combined algorithm is highly automatable and of particular applicability in the context of 'controlled' biochemical networks.

RESULTS

The algorithm is demonstrated here via application to two examples; an 11 dimensional model of bacterial chemotaxis in Escherichia coli and a 99 dimensional model of extracellular regulatory kinase activation (ERK) mediated via the epidermal growth factor (EGF) and nerve growth factor (NGF) receptor pathways. In the case of the chemotaxis model the algorithm was able to reduce the model to 2 state-variables producing a maximal relative error between the dynamics of the original and reduced models of only 2.8% whilst yielding a 26 fold speed up in simulation time. For the ERK activation model the algorithm was able to reduce the system to 7 state-variables, incurring a maximal relative error of 4.8%, and producing an approximately 10 fold speed up in the rate of simulation. Indices of controllability and observability are additionally developed and demonstrated throughout the paper. These provide insight into the relative importance of individual reactants in mediating a biochemical system's input-output response even for highly complex networks.

CONCLUSIONS

Through application, this paper demonstrates that combined model reduction methods can produce a significant simplification of complex Systems Biology models whilst retaining a high degree of predictive accuracy. In particular, it is shown that by combining the methods of proper lumping and empirical balanced truncation it is often possible to produce more accurate reductions than can be obtained by the use of either method in isolation.

Crosstalks between cytokines and Sonic Hedgehog in Helicobacter pylori infection: a mathematical model

Helicobacter pylori infection of gastric tissue results in an immune response dominated by Th1 cytokines and has also been linked with dysregulation of Sonic Hedgehog (SHH) signaling pathway in gastric tissue. However, since interactions between the cytokines and SHH during H. pylori infection are not well understood, any mechanistic understanding achieved through interpretation of the statistical analysis of experimental results in the context of currently known circuit must be carefully scrutinized. Here, we use mathematical modeling aided by restraints of experimental data to evaluate the consistency between experimental results and temporal behavior of H. pylori activated cytokine circuit model. Statistical analysis of qPCR data from uninfected and H. pylori infected wild-type and parietal cell-specific SHH knockout (PC-SHH^KO) mice for day 7 and 180 indicate significant changes that suggest role of SHH in cytokine regulation. The experimentally observed changes are further investigated using a mathematical model that examines dynamic crosstalks among pro-inflammatory (IL1β, IL-12, IFNγ, MIP-2) cytokines, anti-inflammatory (IL-10) cytokines and SHH during H. pylori infection. Response analysis of the resulting model demonstrates that circuitry, as currently known, is inadequate for explaining of the experimental observations; suggesting the need for additional specific regulatory interactions. A key advantage of a computational model is the ability to propose putative circuit models for in-silico experimentation. We use this approach to propose a parsimonious model that incorporates crosstalks between NFĸB, SHH, IL-1β and IL-10, resulting in a feedback loop capable of exhibiting cyclic behavior. Separately, we show that analysis of an independent time-series GEO microarray data for IL-1β, IFNγ and IL-10 in mock and H. pylori infected mice further supports the proposed hypothesis that these cytokines may follow a cyclic trend. Predictions from the in-silico model provide useful insights for generating new hypothesis and design of subsequent experimental studies.

A conceptual review on systems biology in health and diseases: from biological networks to modern therapeutics

Human physiology is an ensemble of various biological processes spanning from intracellular molecular interactions to the whole body phenotypic response. Systems biology endures to decipher these multi-scale biological networks and bridge the link between genotype to phenotype. The structure and dynamic properties of these networks are responsible for controlling and deciding the phenotypic state of a cell. Several cells and various tissues coordinate together to generate an organ level response which further regulates the ultimate physiological state. The overall network embeds a hierarchical regulatory structure, which when unusually perturbed can lead to undesirable physiological state termed as disease. Here, we treat a disease diagnosis problem analogous to a fault diagnosis problem in engineering systems. Accordingly we review the application of engineering methodologies to address human diseases from systems biological perspective. The review highlights potential networks and modeling approaches used for analyzing human diseases. The application of such analysis is illustrated in the case of cancer and diabetes. We put forth a concept of cell-to-human framework comprising of five modules (data mining, networking, modeling, experimental and validation) for addressing human physiology and diseases based on a paradigm of system level analysis. The review overtly emphasizes on the importance of multi-scale biological networks and subsequent modeling and analysis for drug target identification and designing efficient therapies.

Spatial rule-based modeling: a method and its application to the human mitotic kinetochore

A common problem in the analysis of biological systems is the combinatorial explosion that emerges from the complexity of multi-protein assemblies. Conventional formalisms, like differential equations, Boolean networks and Bayesian networks, are unsuitable for dealing with the combinatorial explosion, because they are designed for a restricted state space with fixed dimensionality. To overcome this problem, the rule-based modeling language, BioNetGen, and the spatial extension, SRSim, have been developed. Here, we describe how to apply rule-based modeling to integrate experimental data from different sources into a single spatial simulation model and how to analyze the output of that model. The starting point for this approach can be a combination of molecular interaction data, reaction network data, proximities, binding and diffusion kinetics and molecular geometries at different levels of detail. We describe the technique and then use it to construct a model of the human mitotic inner and outer kinetochore, including the spindle assembly checkpoint signaling pathway. This allows us to demonstrate the utility of the procedure, show how a novel perspective for understanding such complex systems becomes accessible and elaborate on challenges that arise in the formulation, simulation and analysis of spatial rule-based models.

Rule-based modeling and simulations of the inner kinetochore structure

BACKGROUND

Combinatorial complexity is a central problem when modeling biochemical reaction networks, since the association of a few components can give rise to a large variation of protein complexes. Available classical modeling approaches are often insufficient for the analysis of very large and complex networks in detail. Recently, we developed a new rule-based modeling approach that facilitates the analysis of spatial and combinatorially complex problems. Here, we explore for the first time how this approach can be applied to a specific biological system, the human kinetochore, which is a multi-protein complex involving over 100 proteins.

RESULTS

Applying our freely available SRSim software to a large data set on kinetochore proteins in human cells, we construct a spatial rule-based simulation model of the human inner kinetochore. The model generates an estimation of the probability distribution of the inner kinetochore 3D architecture and we show how to analyze this distribution using information theory. In our model, the formation of a bridge between CenpA and an H3 containing nucleosome only occurs efficiently for higher protein concentration realized during S-phase but may be not in G1. Above a certain nucleosome distance the protein bridge barely formed pointing towards the importance of chromatin structure for kinetochore complex formation. We define a metric for the distance between structures that allow us to identify structural clusters. Using this modeling technique, we explore different hypothetical chromatin layouts.

CONCLUSIONS

Applying a rule-based network analysis to the spatial kinetochore complex geometry allowed us to integrate experimental data on kinetochore proteins, suggesting a 3D model of the human inner kinetochore architecture that is governed by a combinatorial algebraic reaction network. This reaction network can serve as bridge between multiple scales of modeling. Our approach can be applied to other systems beyond kinetochores.

The Process-Interaction-Model: a common representation of rule-based and logical models allows studying signal transduction on different levels of detail

Background

Signaling systems typically involve large, structured molecules each consisting of a large number of subunits called molecule domains. In modeling such systems these domains can be considered as the main players. In order to handle the resulting combinatorial complexity, rule-based modeling has been established as the tool of choice. In contrast to the detailed quantitative rule-based modeling, qualitative modeling approaches like logical modeling rely solely on the network structure and are particularly useful for analyzing structural and functional properties of signaling systems.

Results

We introduce the Process-Interaction-Model (PIM) concept. It defines a common representation (or basis) of rule-based models and site-specific logical models, and, furthermore, includes methods to derive models of both types from a given PIM. A PIM is based on directed graphs with nodes representing processes like post-translational modifications or binding processes and edges representing the interactions among processes. The applicability of the concept has been demonstrated by applying it to a model describing EGF insulin crosstalk. A prototypic implementation of the PIM concept has been integrated in the modeling software ProMoT.

Conclusions

The PIM concept provides a common basis for two modeling formalisms tailored to the study of signaling systems: a quantitative (rule-based) and a qualitative (logical) modeling formalism. Every PIM is a compact specification of a rule-based model and facilitates the systematic set-up of a rule-based model, while at the same time facilitating the automatic generation of a site-specific logical model. Consequently, modifications can be made on the underlying basis and then be propagated into the different model specifications – ensuring consistency of all models, regardless of the modeling formalism. This facilitates the analysis of a system on different levels of detail as it guarantees the application of established simulation and analysis methods to consistent descriptions (rule-based and logical) of a particular signaling system.

Insulin signaling - mathematical modeling comes of age

Signaling pathways that only a few years ago appeared simple and understandable, albeit far from complete, have evolved into very complex multi-layered networks of cellular control mechanisms, which in turn are integrated in a similarly complex whole-body level of control mechanisms. This complexity sets limits for classical biochemical reasoning, such that a correct and complete analysis of experimental data while taking the full complexity into account is not possible. In this Opinion we propose that mathematical modeling can be used as a tool in insulin signaling research, and we demonstrate how recent developments in modeling - and the integration of modeling in the experimental process - provide new possibilities to approach and decipher complex biological systems more efficiently.

Timescale analysis of rule-based biochemical reaction networks

The flow of information within a cell is governed by a series of protein-protein interactions that can be described as a reaction network. Mathematical models of biochemical reaction networks can be constructed by repetitively applying specific rules that define how reactants interact and what new species are formed on reaction. To aid in understanding the underlying biochemistry, timescale analysis is one method developed to prune the size of the reaction network. In this work, we extend the methods associated with timescale analysis to reaction rules instead of the species contained within the network. To illustrate this approach, we applied timescale analysis to a simple receptor-ligand binding model and a rule-based model of interleukin-12 (IL-12) signaling in naïve CD4+ T cells. The IL-12 signaling pathway includes multiple protein-protein interactions that collectively transmit information; however, the level of mechanistic detail sufficient to capture the observed dynamics has not been justified based on the available data. The analysis correctly predicted that reactions associated with Janus Kinase 2 and Tyrosine Kinase 2 binding to their corresponding receptor exist at a pseudo-equilibrium. By contrast, reactions associated with ligand binding and receptor turnover regulate cellular response to IL-12. An empirical Bayesian approach was used to estimate the uncertainty in the timescales. This approach complements existing rank- and flux-based methods that can be used to interrogate complex reaction networks. Ultimately, timescale analysis of rule-based models is a computational tool that can be used to reveal the biochemical steps that regulate signaling dynamics.

A method for zooming of nonlinear models of biochemical systems

BACKGROUND

Models of biochemical systems are typically complex, which may complicate the discovery of cardinal biochemical principles. It is therefore important to single out the parts of a model that are essential for the function of the system, so that the remaining non-essential parts can be eliminated. However, each component of a mechanistic model has a clear biochemical interpretation, and it is desirable to conserve as much of this interpretability as possible in the reduction process. Furthermore, it is of great advantage if we can translate predictions from the reduced model to the original model.

RESULTS

In this paper we present a novel method for model reduction that generates reduced models with a clear biochemical interpretation. Unlike conventional methods for model reduction our method enables the mapping of predictions by the reduced model to the corresponding detailed predictions by the original model. The method is based on proper lumping of state variables interacting on short time scales and on the computation of fraction parameters, which serve as the link between the reduced model and the original model. We illustrate the advantages of the proposed method by applying it to two biochemical models. The first model is of modest size and is commonly occurring as a part of larger models. The second model describes glucose transport across the cell membrane in baker's yeast. Both models can be significantly reduced with the proposed method, at the same time as the interpretability is conserved.

CONCLUSIONS

We introduce a novel method for reduction of biochemical models that is compatible with the concept of zooming. Zooming allows the modeler to work on different levels of model granularity, and enables a direct interpretation of how modifications to the model on one level affect the model on other levels in the hierarchy. The method extends the applicability of the method that was previously developed for zooming of linear biochemical models to nonlinear models.

RuleMonkey: software for stochastic simulation of rule-based models

Background

The system-level dynamics of many molecular interactions, particularly protein-protein interactions, can be conveniently represented using reaction rules, which can be specified using model-specification languages, such as the BioNetGen language (BNGL). A set of rules implicitly defines a (bio)chemical reaction network. The reaction network implied by a set of rules is often very large, and as a result, generation of the network implied by rules tends to be computationally expensive. Moreover, the cost of many commonly used methods for simulating network dynamics is a function of network size. Together these factors have limited application of the rule-based modeling approach. Recently, several methods for simulating rule-based models have been developed that avoid the expensive step of network generation. The cost of these "network-free" simulation methods is independent of the number of reactions implied by rules. Software implementing such methods is now needed for the simulation and analysis of rule-based models of biochemical systems.

Results

Here, we present a software tool called RuleMonkey, which implements a network-free method for simulation of rule-based models that is similar to Gillespie's method. The method is suitable for rule-based models that can be encoded in BNGL, including models with rules that have global application conditions, such as rules for intramolecular association reactions. In addition, the method is rejection free, unlike other network-free methods that introduce null events, i.e., steps in the simulation procedure that do not change the state of the reaction system being simulated. We verify that RuleMonkey produces correct simulation results, and we compare its performance against DYNSTOC, another BNGL-compliant tool for network-free simulation of rule-based models. We also compare RuleMonkey against problem-specific codes implementing network-free simulation methods.

Conclusions

RuleMonkey enables the simulation of rule-based models for which the underlying reaction networks are large. It is typically faster than DYNSTOC for benchmark problems that we have examined. RuleMonkey is freely available as a stand-alone application http://public.tgen.org/rulemonkey. It is also available as a simulation engine within GetBonNie, a web-based environment for building, analyzing and sharing rule-based models.

Zooming of states and parameters using a lumping approach including back-translation

Background

Systems biology models tend to become large since biological systems often consist of complex networks of interacting components, and since the models usually are developed to reflect various mechanistic assumptions of those networks. Nevertheless, not all aspects of the model are equally interesting in a given setting, and normally there are parts that can be reduced without affecting the relevant model performance. There are many methods for model reduction, but few or none of them allow for a restoration of the details of the original model after the simplified model has been simulated.

Results

We present a reduction method that allows for such a back-translation from the reduced to the original model. The method is based on lumping of states, and includes a general and formal algorithm for both determining appropriate lumps, and for calculating the analytical back-translation formulas. The lumping makes use of efficient methods from graph-theory and ϵ-decomposition and is derived and exemplified on two published models for fluorescence emission in photosynthesis. The bigger of these models is reduced from 26 to 6 states, with a negligible deviation from the reduced model simulations, both when comparing simulations in the states of the reduced model and when comparing back-translated simulations in the states of the original model. The method is developed in a linear setting, but we exemplify how the same concepts and approaches can be applied to non-linear problems. Importantly, the method automatically provides a reduced model with back-translations. Also, the method is implemented as a part of the systems biology toolbox for matlab, and the matlab scripts for the examples in this paper are available in the supplementary material.

Conclusions

Our novel lumping methodology allows for both automatic reduction of states using lumping, and for analytical retrieval of the original states and parameters without performing a new simulation. The two models can thus be considered as two degrees of zooming of the same model. This is a conceptually new development of model reduction approaches, which we think will stimulate much further research and will prove to be very useful in future modelling projects.

Negative feedback governs gonadotrope frequency-decoding of gonadotropin releasing hormone pulse-frequency

The synthesis of the gonadotropin subunits is directed by pulsatile gonadotropin-releasing hormone (GnRH) from the hypothalamus, with the frequency of GnRH pulses governing the differential expression of the common alpha-subunit, luteinizing hormone beta-subunit (LHbeta) and follicle-stimulating hormone beta-subunit (FSHbeta). Three mitogen-activated protein kinases, (MAPKs), ERK1/2, JNK and p38, contribute uniquely and combinatorially to the expression of each of these subunit genes. In this study, using both experimental and computational methods, we found that dual specificity phosphatase regulation of the activity of the three MAPKs through negative feedback is required, and forms the basis for decoding the frequency of pulsatile GnRH. A fourth MAPK, ERK5, was shown also to be activated by GnRH. ERK5 was found to stimulate FSHbeta promoter activity and to increase FSHbeta mRNA levels, as well as enhancing its preference for low GnRH pulse frequencies. The latter is achieved through boosting the ultrasensitive behavior of FSHbeta gene expression by increasing the number of MAPK dependencies, and through modulating the feedforward effects of JNK activation on the GnRH receptor (GnRH-R). Our findings contribute to understanding the role of changing GnRH pulse-frequency in controlling transcription of the pituitary gonadotropins, which comprises a crucial aspect in regulating reproduction. Pulsatile stimuli and oscillating signals are integral to many biological processes, and elucidation of the mechanisms through which the pulsatility is decoded explains how the same stimulant can lead to various outcomes in a single cell.

Internal coarse-graining of molecular systems

Modelers of molecular signaling networks must cope with the combinatorial explosion of protein states generated by posttranslational modifications and complex formation. Rule-based models provide a powerful alternative to approaches that require explicit enumeration of all possible molecular species of a system. Such models consist of formal rules stipulating the (partial) contexts wherein specific protein-protein interactions occur. These contexts specify molecular patterns that are usually less detailed than molecular species. Yet, the execution of rule-based dynamics requires stochastic simulation, which can be very costly. It thus appears desirable to convert a rule-based model into a reduced system of differential equations by exploiting the granularity at which rules specify interactions. We present a formal (and automated) method for constructing a coarse-grained and self-consistent dynamical system aimed at molecular patterns that are distinguishable by the dynamics of the original system as posited by the rules. The method is formally sound and never requires the execution of the rule-based model. The coarse-grained variables do not depend on the values of the rate constants appearing in the rules, and typically form a system of greatly reduced dimension that can be amenable to numerical integration and further model reduction techniques.

Domain-oriented reduction of rule-based network models

The coupling of membrane-bound receptors to transcriptional regulators and other effector functions is mediated by multi-domain proteins that form complex assemblies. The modularity of protein interactions lends itself to a rule-based description, in which species and reactions are generated by rules that encode the necessary context for an interaction to occur, but also can produce a combinatorial explosion in the number of chemical species that make up the signalling network. The authors have shown previously that exact network reduction can be achieved using hierarchical control relationships between sites/domains on proteins to dissect multi-domain proteins into sets of non-interacting sites, allowing the replacement of each 'full' (progenitor) protein with a set of derived auxiliary (offspring) proteins. The description of a network in terms of auxiliary proteins that have fewer sites than progenitor proteins often greatly reduces network size. The authors describe here a method for automating domain-oriented model reduction and its implementation as a module in the BioNetGen modelling package. It takes as input a standard BioNetGen model and automatically performs the following steps: 1) detecting the hierarchical control relationships between sites; 2) building up the auxiliary proteins; 3) generating a raw reduced model and 4) cleaning up the raw model to provide the correct mass balance for each chemical species in the reduced network. The authors tested the performance of this module on models representing portions of growth factor receptor and immunoreceptor-mediated signalling networks and confirmed its ability to reduce the model size and simulation cost by at least one or two orders of magnitude. Limitations of the current algorithm include the inability to reduce models based on implicit site dependencies or heterodimerisation and loss of accuracy when dynamics are computed stochastically.

Rule-based modeling of biochemical systems with BioNetGen

Rule-based modeling involves the representation of molecules as structured objects and molecular interactions as rules for transforming the attributes of these objects. The approach is notable in that it allows one to systematically incorporate site-specific details about protein-protein interactions into a model for the dynamics of a signal-transduction system, but the method has other applications as well, such as following the fates of individual carbon atoms in metabolic reactions. The consequences of protein-protein interactions are difficult to specify and track with a conventional modeling approach because of the large number of protein phosphoforms and protein complexes that these interactions potentially generate. Here, we focus on how a rule-based model is specified in the BioNetGen language (BNGL) and how a model specification is analyzed using the BioNetGen software tool. We also discuss new developments in rule-based modeling that should enable the construction and analyses of comprehensive models for signal transduction pathways and similarly large-scale models for other biochemical systems.

ALC: automated reduction of rule-based models

Background

Combinatorial complexity is a challenging problem for the modeling of cellular signal transduction since the association of a few proteins can give rise to an enormous amount of feasible protein complexes. The layer-based approach is an approximative, but accurate method for the mathematical modeling of signaling systems with inherent combinatorial complexity. The number of variables in the simulation equations is highly reduced and the resulting dynamic models show a pronounced modularity. Layer-based modeling allows for the modeling of systems not accessible previously.

Results

ALC (Automated Layer Construction) is a computer program that highly simplifies the building of reduced modular models, according to the layer-based approach. The model is defined using a simple but powerful rule-based syntax that supports the concepts of modularity and macrostates. ALC performs consistency checks on the model definition and provides the model output in different formats (C MEX, MATLAB, Mathematica and SBML) as ready-to-run simulation files. ALC also provides additional documentation files that simplify the publication or presentation of the models. The tool can be used offline or via a form on the ALC website.

Conclusion

ALC allows for a simple rule-based generation of layer-based reduced models. The model files are given in different formats as ready-to-run simulation files.

Kinetic Monte Carlo method for rule-based modeling of biochemical networks

We present a kinetic Monte Carlo method for simulating chemical transformations specified by reaction rules, which can be viewed as generators of chemical reactions, or equivalently, definitions of reaction classes. A rule identifies the molecular components involved in a transformation, how these components change, conditions that affect whether a transformation occurs, and a rate law. The computational cost of the method, unlike conventional simulation approaches, is independent of the number of possible reactions, which need not be specified in advance or explicitly generated in a simulation. To demonstrate the method, we apply it to study the kinetics of multivalent ligand-receptor interactions. We expect the method will be useful for studying cellular signaling systems and other physical systems involving aggregation phenomena.

Exact model reduction of combinatorial reaction networks

BACKGROUND

Receptors and scaffold proteins usually possess a high number of distinct binding domains inducing the formation of large multiprotein signaling complexes. Due to combinatorial reasons the number of distinguishable species grows exponentially with the number of binding domains and can easily reach several millions. Even by including only a limited number of components and binding domains the resulting models are very large and hardly manageable. A novel model reduction technique allows the significant reduction and modularization of these models.

RESULTS

We introduce methods that extend and complete the already introduced approach. For instance, we provide techniques to handle the formation of multi-scaffold complexes as well as receptor dimerization. Furthermore, we discuss a new modeling approach that allows the direct generation of exactly reduced model structures. The developed methods are used to reduce a model of EGF and insulin receptor crosstalk comprising 5,182 ordinary differential equations (ODEs) to a model with 87 ODEs.

CONCLUSION

The methods, presented in this contribution, significantly enhance the available methods to exactly reduce models of combinatorial reaction networks.

Mathematical modeling and analysis of insulin clearance in vivo

BACKGROUND

Analyzing the dynamics of insulin concentration in the blood is necessary for a comprehensive understanding of the effects of insulin in vivo. Insulin removal from the blood has been addressed in many studies. The results are highly variable with respect to insulin clearance and the relative contributions of hepatic and renal insulin degradation.

RESULTS

We present a dynamic mathematical model of insulin concentration in the blood and of insulin receptor activation in hepatocytes. The model describes renal and hepatic insulin degradation, pancreatic insulin secretion and nonspecific insulin binding in the liver. Hepatic insulin receptor activation by insulin binding, receptor internalization and autophosphorylation is explicitly included in the model. We present a detailed mathematical analysis of insulin degradation and insulin clearance. Stationary model analysis shows that degradation rates, relative contributions of the different tissues to total insulin degradation and insulin clearance highly depend on the insulin concentration.

CONCLUSION

This study provides a detailed dynamic model of insulin concentration in the blood and of insulin receptor activation in hepatocytes. Experimental data sets from literature are used for the model validation. We show that essential dynamic and stationary characteristics of insulin degradation are nonlinear and depend on the actual insulin concentration.

Dynamic pathway modeling of signal transduction networks: a domain-oriented approach

Mathematical models of biological processes become more and more important in biology. The aim is a holistic understanding of how processes such as cellular communication, cell division, regulation, homeostasis, or adaptation work, how they are regulated, and how they react to perturbations. The great complexity of most of these processes necessitates the generation of mathematical models in order to address these questions. In this chapter we provide an introduction to basic principles of dynamic modeling and highlight both problems and chances of dynamic modeling in biology. The main focus will be on modeling of s transduction pathways, which requires the application of a special modeling approach. A common pattern, especially in eukaryotic signaling systems, is the formation of multi protein signaling complexes. Even for a small number of interacting proteins the number of distinguishable molecular species can be extremely high. This combinatorial complexity is due to the great number of distinct binding domains of many receptors and scaffold proteins involved in signal transduction. However, these problems can be overcome using a new domain-oriented modeling approach, which makes it possible to handle complex and branched signaling pathways.