Dataset Information

Efficient manipulation and generation of Kirchhoff polynomials for the analysis of non-equilibrium biochemical reaction networks.

ABSTRACT: Kirchhoff polynomials are central for deriving symbolic steady-state expressions of models whose dynamics are governed by linear diffusion on graphs. In biology, such models have been unified under a common linear framework subsuming studies across areas such as enzyme kinetics, G-protein coupled receptors, ion channels and gene regulation. Due to 'history dependence' away from thermodynamic equilibrium, these models suffer from a (super) exponential growth in the size of their symbolic steady-state expressions and, respectively, Kirchhoff polynomials. This algebraic explosion has limited applications of the linear framework. However, recent results on the graph-based prime factorization of Kirchhoff polynomials may help subdue the combinatorial complexity. By prime decomposing the graphs contained in an expression of Kirchhoff polynomials and identifying the graphs giving rise to equal polynomials, we formulate a coarse-grained variant of the expression suitable for symbolic simplification. We devise criteria to efficiently test the equality of Kirchhoff polynomials and propose two heuristic algorithms to explicitly generate individual Kirchhoff polynomials in a compressed form; they are inspired by algebraic simplifications but operate on the corresponding graphs. We illustrate the practicality of the developed theory and algorithms for a diverse set of graphs of different sizes and for non-equilibrium gene regulation analyses.

SUBMITTER: Yordanov P

PROVIDER: S-EPMC7211475 | biostudies-literature |

REPOSITORIES: biostudies-literature

ACCESS DATA

Similar Datasets

Project description:BACKGROUND: In this paper we propose a model reduction method for biochemical reaction networks governed by a variety of reversible and irreversible enzyme kinetic rate laws, including reversible Michaelis-Menten and Hill kinetics. The method proceeds by a stepwise reduction in the number of complexes, defined as the left and right-hand sides of the reactions in the network. It is based on the Kron reduction of the weighted Laplacian matrix, which describes the graph structure of the complexes and reactions in the network. It does not rely on prior knowledge of the dynamic behaviour of the network and hence can be automated, as we demonstrate. The reduced network has fewer complexes, reactions, variables and parameters as compared to the original network, and yet the behaviour of a preselected set of significant metabolites in the reduced network resembles that of the original network. Moreover the reduced network largely retains the structure and kinetics of the original model. RESULTS: We apply our method to a yeast glycolysis model and a rat liver fatty acid beta-oxidation model. When the number of state variables in the yeast model is reduced from 12 to 7, the difference between metabolite concentrations in the reduced and the full model, averaged over time and species, is only 8%. Likewise, when the number of state variables in the rat-liver beta-oxidation model is reduced from 42 to 29, the difference between the reduced model and the full model is 7.5%. CONCLUSIONS: The method has improved our understanding of the dynamics of the two networks. We found that, contrary to the general disposition, the first few metabolites which were deleted from the network during our stepwise reduction approach, are not those with the shortest convergence times. It shows that our reduction approach performs differently from other approaches that are based on time-scale separation. The method can be used to facilitate fitting of the parameters or to embed a detailed model of interest in a more coarse-grained yet realistic environment.

Project description:The molecular simulation of chemical reaction equilibrium (CRE) is a challenging and important problem of broad applicability in chemistry and chemical engineering. The primary molecular-based approach for solving this problem has been the reaction ensemble Monte Carlo (REMC) algorithm [Turner et al. Molec. Simulation2008, 34, (2), 119-146], based on classical force-field methodology. In spite of the vast improvements in computer hardware and software since its original development almost 25 years ago, its more widespread application is impeded by its computational inefficiency. A fundamental problem is that its MC basis inhibits the implementation of significant parallelization, and its successful implementation often requires system-specific tailoring and the incorporation of special MC approaches such as replica exchange, expanded ensemble, umbrella sampling, configurational bias, and continuous fractional component methodologies. We describe herein a novel CRE algorithm (reaction ensemble molecular dynamics, ReMD) that exploits modern computer hardware and software capabilities, and which can be straightforwardly implemented for systems of arbitrary size and complexity by exploiting the parallel computing methodology incorporated within many MD software packages (herein, we use GROMACS for illustrative purposes). The ReMD algorithm utilizes these features in the context of a macroscopically inspired and generally applicable free energy minimization approach based on the iterative approximation of the system Gibbs free energy function by a mathematically simple convex ideal solution model using the composition at each iteration as a reference state. Finally, we additionally describe a simple and computationally efficient a posteriori method to estimate the equilibrium concentrations of species present in very small amounts relative to others in the primary calculation. To demonstrate the algorithm, we show its application to two classic example systems considered previously in the literature: the N2-O2-NO system and the ammonia synthesis system.

Dataset Information

Efficient manipulation and generation of Kirchhoff polynomials for the analysis of non-equilibrium biochemical reaction networks.

Similar Datasets

OmicsDI is part of the ELIXIR infrastructure

Tweets