Robust simplifications of multiscale biochemical networks

<p>Abstract</p> <p>Background</p> <p>Cellular processes such as metabolism, decision making in development and differentiation, signalling, etc., can be modeled as large networks of biochemical reactions. In order to understand the functioning of these systems, there is a strong need for general model reduction techniques allowing to simplify models without loosing their main properties. In systems biology we also need to compare models or to couple them as parts of larger models. In these situations reduction to a common level of complexity is needed.</p> <p>Results</p> <p>We propose a systematic treatment of model reduction of multiscale biochemical networks. First, we consider linear kinetic models, which appear as "pseudo-monomolecular" subsystems of multiscale nonlinear reaction networks. For such linear models, we propose a reduction algorithm which is based on a generalized theory of the limiting step that we have developed in <abbrgrp><abbr bid="B1">1</abbr></abbrgrp>. Second, for non-linear systems we develop an algorithm based on dominant solutions of quasi-stationarity equations. For oscillating systems, quasi-stationarity and averaging are combined to eliminate time scales much faster and much slower than the period of the oscillations. In all cases, we obtain robust simplifications and also identify the critical parameters of the model. The methods are demonstrated for simple examples and for a more complex model of NF-<it>κ</it>B pathway.</p> <p>Conclusion</p> <p>Our approach allows critical parameter identification and produces hierarchies of models. Hierarchical modeling is important in "middle-out" approaches when there is need to zoom in and out several levels of complexity. Critical parameter identification is an important issue in systems biology with potential applications to biological control and therapeutics. Our approach also deals naturally with the presence of multiple time scales, which is a general property of systems biology models.</p

Reduction of dynamical biochemical reaction networks in computational biology

Biochemical networks are used in computational biology, to model the static and dynamical details of systems involved in cell signaling, metabolism, and regulation of gene expression. Parametric and structural uncertainty, as well as combinatorial explosion are strong obstacles against analyzing the dynamics of large models of this type. Multi-scaleness is another property of these networks, that can be used to get past some of these obstacles. Networks with many well separated time scales, can be reduced to simpler networks, in a way that depends only on the orders of magnitude and not on the exact values of the kinetic parameters. The main idea used for such robust simplifications of networks is the concept of dominance among model elements, allowing hierarchical organization of these elements according to their effects on the network dynamics. This concept finds a natural formulation in tropical geometry. We revisit, in the light of these new ideas, the main approaches to model reduction of reaction networks, such as quasi-steady state and quasi-equilibrium approximations, and provide practical recipes for model reduction of linear and nonlinear networks. We also discuss the application of model reduction to backward pruning machine learning techniques

Tropical geometries and dynamics of biochemical networks. Application to hybrid cell cycle models

We use the Litvinov-Maslov correspondence principle to reduce and hybridize networks of biochemical reactions. We apply this method to a cell cycle oscillator model. The reduced and hybridized model can be used as a hybrid model for the cell cycle. We also propose a practical recipe for detecting quasi-equilibrium QE reactions and quasi-steady state QSS species in biochemical models with rational rate functions and use this recipe for model reduction. Interestingly, the QE/QSS invariant manifold of the smooth model and the reduced dynamics along this manifold can be put into correspondence to the tropical variety of the hybridization and to sliding modes along this variety, respectivelyComment: conference SASB 2011, to be published in Electronic Notes in Theoretical Computer Scienc

Asymptotology of Chemical Reaction Networks

The concept of the limiting step is extended to the asymptotology of multiscale reaction networks. Complete theory for linear networks with well separated reaction rate constants is developed. We present algorithms for explicit approximations of eigenvalues and eigenvectors of kinetic matrix. Accuracy of estimates is proven. Performance of the algorithms is demonstrated on simple examples. Application of algorithms to nonlinear systems is discussed.Comment: 23 pages, 8 figures, 84 refs, Corrected Journal Versio

Emergent Properties of Tumor Microenvironment in a Real-life Model of Multicell Tumor Spheroids

Multicellular tumor spheroids are an important {\it in vitro} model of the pre-vascular phase of solid tumors, for sizes well below the diagnostic limit: therefore a biophysical model of spheroids has the ability to shed light on the internal workings and organization of tumors at a critical phase of their development. To this end, we have developed a computer program that integrates the behavior of individual cells and their interactions with other cells and the surrounding environment. It is based on a quantitative description of metabolism, growth, proliferation and death of single tumor cells, and on equations that model biochemical and mechanical cell-cell and cell-environment interactions. The program reproduces existing experimental data on spheroids, and yields unique views of their microenvironment. Simulations show complex internal flows and motions of nutrients, metabolites and cells, that are otherwise unobservable with current experimental techniques, and give novel clues on tumor development and strong hints for future therapies.Comment: 20 pages, 10 figures. Accepted for publication in PLOS One. The published version contains links to a supplementary text and three video file

Tropicalization and tropical equilibration of chemical reactions

Systems biology uses large networks of biochemical reactions to model the functioning of biological cells from the molecular to the cellular scale. The dynamics of dissipative reaction networks with many well separated time scales can be described as a sequence of successive equilibrations of different subsets of variables of the system. Polynomial systems with separation are equilibrated when at least two monomials, of opposite signs, have the same order of magnitude and dominate the others. These equilibrations and the corresponding truncated dynamics, obtained by eliminating the dominated terms, find a natural formulation in tropical analysis and can be used for model reduction.Comment: 13 pages, 1 figure, workshop Tropical-12, Moskow, August 26-31, 2012; in press Contemporary Mathematic

solveME: fast and reliable solution of nonlinear ME models.

BackgroundGenome-scale models of metabolism and macromolecular expression (ME) significantly expand the scope and predictive capabilities of constraint-based modeling. ME models present considerable computational challenges: they are much (&gt;30 times) larger than corresponding metabolic reconstructions (M models), are multiscale, and growth maximization is a nonlinear programming (NLP) problem, mainly due to macromolecule dilution constraints.ResultsHere, we address these computational challenges. We develop a fast and numerically reliable solution method for growth maximization in ME models using a quad-precision NLP solver (Quad MINOS). Our method was up to 45 % faster than binary search for six significant digits in growth rate. We also develop a fast, quad-precision flux variability analysis that is accelerated (up to 60× speedup) via solver warm-starts. Finally, we employ the tools developed to investigate growth-coupled succinate overproduction, accounting for proteome constraints.ConclusionsJust as genome-scale metabolic reconstructions have become an invaluable tool for computational and systems biologists, we anticipate that these fast and numerically reliable ME solution methods will accelerate the wide-spread adoption of ME models for researchers in these fields

Kinetic Path Summation, Multi--Sheeted Extension of Master Equation, and Evaluation of Ergodicity Coefficient

We study the Master equation with time--dependent coefficients, a linear kinetic equation for the Markov chains or for the monomolecular chemical kinetics. For the solution of this equation a path summation formula is proved. This formula represents the solution as a sum of solutions for simple kinetic schemes (kinetic paths), which are available in explicit analytical form. The relaxation rate is studied and a family of estimates for the relaxation time and the ergodicity coefficient is developed. To calculate the estimates we introduce the multi--sheeted extensions of the initial kinetics. This approach allows us to exploit the internal ("micro")structure of the extended kinetics without perturbation of the base kinetics.Comment: The final journal versio

Hybrid stochastic simplifications for multiscale gene networks

<p>Abstract</p> <p>Background</p> <p>Stochastic simulation of gene networks by Markov processes has important applications in molecular biology. The complexity of exact simulation algorithms scales with the number of discrete jumps to be performed. Approximate schemes reduce the computational time by reducing the number of simulated discrete events. Also, answering important questions about the relation between network topology and intrinsic noise generation and propagation should be based on general mathematical results. These general results are difficult to obtain for exact models.</p> <p>Results</p> <p>We propose a unified framework for hybrid simplifications of Markov models of multiscale stochastic gene networks dynamics. We discuss several possible hybrid simplifications, and provide algorithms to obtain them from pure jump processes. In hybrid simplifications, some components are discrete and evolve by jumps, while other components are continuous. Hybrid simplifications are obtained by partial Kramers-Moyal expansion <abbrgrp><abbr bid="B1">1</abbr><abbr bid="B2">2</abbr><abbr bid="B3">3</abbr></abbrgrp> which is equivalent to the application of the central limit theorem to a sub-model. By averaging and variable aggregation we drastically reduce simulation time and eliminate non-critical reactions. Hybrid and averaged simplifications can be used for more effective simulation algorithms and for obtaining general design principles relating noise to topology and time scales. The simplified models reproduce with good accuracy the stochastic properties of the gene networks, including waiting times in intermittence phenomena, fluctuation amplitudes and stationary distributions. The methods are illustrated on several gene network examples.</p> <p>Conclusion</p> <p>Hybrid simplifications can be used for onion-like (multi-layered) approaches to multi-scale biochemical systems, in which various descriptions are used at various scales. Sets of discrete and continuous variables are treated with different methods and are coupled together in a physically justified approach.</p