Models Of Biochemical Networks Research Articles

Bayesian Inference of Stochastic Dynamic Models Using Early-Rejection Methods Based on Sequential Stochastic Simulations.

Stochastic modelling is an important method to investigate the functions of noise in a wide range of biological systems. However, the parameter inference for stochastic models is still a challenging problem partially due to the large computing time required for stochastic simulations. To address this issue, we propose a novel early-rejection method by using sequential stochastic simulations. We first show that a large number of stochastic simulations are required to obtain reliable inference results. Instead of generating a large number of simulations for each parameter sample, we propose to generate these simulations in a number of stages. The simulation process will go to the next stage only if the accuracy of simulations at the current stage satisfies a given error criterion. We propose a formula to determine the error criterion and use a stochastic differential equation model to examine the effects of different criteria. Three biochemical network models are used to evaluate the efficiency and accuracy of the proposed method. Numerical results suggest the proposed early-rejection method achieves substantial improvement in the efficiency for the inference of stochastic models.

An automatic adaptive method to combine summary statistics in approximate Bayesian computation.

To infer the parameters of mechanistic models with intractable likelihoods, techniques such as approximate Bayesian computation (ABC) are increasingly being adopted. One of the main disadvantages of ABC in practical situations, however, is that parameter inference must generally rely on summary statistics of the data. This is particularly the case for problems involving high-dimensional data, such as biological imaging experiments. However, some summary statistics contain more information about parameters of interest than others, and it is not always clear how to weight their contributions within the ABC framework. We address this problem by developing an automatic, adaptive algorithm that chooses weights for each summary statistic. Our algorithm aims to maximize the distance between the prior and the approximate posterior by automatically adapting the weights within the ABC distance function. Computationally, we use a nearest neighbour estimator of the distance between distributions. We justify the algorithm theoretically based on properties of the nearest neighbour distance estimator. To demonstrate the effectiveness of our algorithm, we apply it to a variety of test problems, including several stochastic models of biochemical reaction networks, and a spatial model of diffusion, and compare our results with existing algorithms.

A biochemical network modeling of a whole-cell

All cellular processes can be ultimately understood in terms of respective fundamental biochemical interactions between molecules, which can be modeled as networks. Very often, these molecules are shared by more than one process, therefore interconnecting them. Despite this effect, cellular processes are usually described by separate networks with heterogeneous levels of detail, such as metabolic, protein–protein interaction, and transcription regulation networks. Aiming at obtaining a unified representation of cellular processes, we describe in this work an integrative framework that draws concepts from rule-based modeling. In order to probe the capabilities of the framework, we used an organism-specific database and genomic information to model the whole-cell biochemical network of the Mycoplasma genitalium organism. This modeling accounted for 15 cellular processes and resulted in a single component network, indicating that all processes are somehow interconnected. The topological analysis of the network showed structural consistency with biological networks in the literature. In order to validate the network, we estimated gene essentiality by simulating gene deletions and compared the results with experimental data available in the literature. We could classify 212 genes as essential, being 95% of them consistent with experimental results. Although we adopted a relatively simple organism as a case study, we suggest that the presented framework has the potential for paving the way to more integrated studies of whole organisms leading to a systemic analysis of cells on a broader scale. The modeling of other organisms using this framework could provide useful large-scale models for different fields of research such as bioengineering, network biology, and synthetic biology, and also provide novel tools for medical and industrial applications.

A Probabilistic Approach to Explore Signal Execution Mechanisms With Limited Experimental Data.

Mathematical models of biochemical reaction networks are central to the study of dynamic cellular processes and hypothesis generation that informs experimentation and validation. Unfortunately, model parameters are often not available and sparse experimental data leads to challenges in model calibration and parameter estimation. This can in turn lead to unreliable mechanistic interpretations of experimental data and the generation of poorly conceived hypotheses for experimental validation. To address this challenge, we evaluate whether a Bayesian-inspired probability-based approach, that relies on expected values for quantities of interest calculated from available information regarding the reaction network topology and parameters can be used to qualitatively explore hypothetical biochemical network execution mechanisms in the context of limited available data. We test our approach on a model of extrinsic apoptosis execution to identify preferred signal execution modes across varying conditions. Apoptosis signal processing can take place either through a mitochondria independent (Type I) mode or a mitochondria dependent (Type II) mode. We first show that in silico knockouts, represented by model subnetworks, successfully identify the most likely execution mode for specific concentrations of key molecular regulators. We then show that changes in molecular regulator concentrations alter the overall reaction flux through the network by shifting the primary route of signal flow between the direct caspase and mitochondrial pathways. Our work thus demonstrates that probabilistic approaches can be used to explore the qualitative dynamic behavior of model biochemical systems even with missing or sparse data.

Robust oscillations in multi-cyclic Markov state models of biochemical clocks.

Organisms often use cyclic changes in the concentrations of chemical species to precisely time biological functions. Underlying these biochemical clocks are chemical reactions and transport processes, which are inherently stochastic. Understanding the physical basis for robust biochemical oscillations in the presence of fluctuations has thus emerged as an important problem. In a previous paper [C. del Junco and S. Vaikuntanathan, Phys. Rev. E 101, 012410 (2020)], we explored this question using the non-equilibrium statistical mechanics of single-ring Markov state models of biochemical networks that support oscillations. Our finding was that they can exploit non-equilibrium driving to robustly maintain the period and coherence of oscillations in the presence of randomness in the rates. Here, we extend our work to Markov state models consisting of a large cycle decorated with multiple small cycles. These additional cycles are intended to represent alternate pathways that the oscillator may take as it fluctuates about its average path. Combining a mapping to single-cycle networks based on first passage time distributions with our previously developed theory, we are able to make analytical predictions for the period and coherence of oscillations in these networks. One implication of our predictions is that a high energy budget can make different network topologies and arrangements of rates degenerate as far as the period and coherence of oscillations are concerned. Excellent agreement between analytical and numerical results confirms that this is the case. Our results suggest that biochemical oscillators can be more robust to fluctuations in the path of the oscillator when they have a high energy budget.

High chemical affinity increases the robustness of biochemical oscillations.

Biochemical oscillations are ubiquitous in nature and allow organisms to properly time their biological functions. In this paper, we consider minimal Markov state models of nonequilibrium biochemical networks that support oscillations. We obtain analytical expressions for the coherence and period of oscillations in these networks. These quantities are expected to depend on all details of the transition rates in the Markov state model. However, our analytical calculations reveal that driving the system out of equilibrium makes many of these details-specifically, the location and arrangement of the transition rates-irrelevant to the coherence and period of oscillations. This theoretical prediction is confirmed by excellent agreement with numerical results. As a consequence, the coherence and period of oscillations can be robustly maintained in the presence of fluctuations in the irrelevant variables. While recent work has established that increasing energy consumption improves the coherence of oscillations, our findings suggest that it plays the additional role of making the coherence and the average period of oscillations robust to fluctuations in rates that can result from the noisy environment of the cell.

Parameter estimation for biochemical reaction networks using Wasserstein distances

We present a method for estimating parameters in stochastic models of biochemical reaction networks by fitting steady-state distributions using Wasserstein distances. We simulate a reaction network at different parameter settings and train a Gaussian process to learn the Wasserstein distance between observations and the simulator output for all parameters. We then use Bayesian optimization to find parameters minimizing this distance based on the trained Gaussian process. The effectiveness of our method is demonstrated on the three-stage model of gene expression and a genetic feedback loop for which moment-based methods are known to perform poorly. Our method is applicable to any simulator model of stochastic reaction networks, including Brownian dynamics.

Interactive Multiresolution Visualization of Cellular Network Processes.

SummaryVisualization plays a central role in the analysis of biochemical network models to identify patterns that arise from reaction dynamics and perform model exploratory analysis. To facilitate these analyses, we developed PyViPR, a visualization tool that generates static and dynamic representations of biochemical network processes within a Python-based environment. PyViPR embeds network visualizations within Jupyter notebooks, thus enabling integration with modeling, simulation, and analysis workflows. To present the capabilities of PyViPR, we explore execution mechanisms of extrinsic apoptosis in HeLa cells. We show that community-detection algorithms identify groups of molecular species that capture key biological functions and ease exploration of the apoptosis network. We then show how different kinetic parameter sets that fit the experimental data equally well exhibit significantly different signal-execution dynamics as the system progresses toward mitochondrial outer-membrane permeabilization. Therefore, PyViPR aids the conceptual understanding of dynamic network processes and accelerates hypothesis generation for further testing and validation.

Efficient parameterization of large-scale dynamic models based on relative measurements.

Mechanistic models of biochemical reaction networks facilitate the quantitative understanding of biological processes and the integration of heterogeneous datasets. However, some biological processes require the consideration of comprehensive reaction networks and therefore large-scale models. Parameter estimation for such models poses great challenges, in particular when the data are on a relative scale. Here, we propose a novel hierarchical approach combining (i) the efficient analytic evaluation of optimal scaling, offset and error model parameters with (ii) the scalable evaluation of objective function gradients using adjoint sensitivity analysis. We evaluate the properties of the methods by parameterizing a pan-cancer ordinary differential equation model (>1000 state variables, >4000 parameters) using relative protein, phosphoprotein and viability measurements. The hierarchical formulation improves optimizer performance considerably. Furthermore, we show that this approach allows estimating error model parameters with negligible computational overhead when no experimental estimates are available, providing an unbiased way to weight heterogeneous data. Overall, our hierarchical formulation is applicable to a wide range of models, and allows for the efficient parameterization of large-scale models based on heterogeneous relative measurements. Supplementary code and data are available online at http://doi.org/10.5281/zenodo.3254429 and http://doi.org/10.5281/zenodo.3254441. Supplementary data are available at Bioinformatics online.

A White-Box Machine Learning Approach for Revealing Antibiotic Mechanisms of Action

Current machine learning techniques enable robust association of biological signals with measured phenotypes, but these approaches are incapable of identifying causal relationships. Here, we develop an integrated "white-box" biochemical screening, network modeling, and machine learning approach for revealing causal mechanisms and apply this approach to understanding antibiotic efficacy. We counter-screen diverse metabolites against bactericidal antibiotics in Escherichia coli and simulate their corresponding metabolic states using a genome-scale metabolic network model. Regression of the measured screening data on model simulations reveals that purine biosynthesis participates in antibiotic lethality, which we validate experimentally. We show that antibiotic-induced adenine limitation increases ATP demand, which elevates central carbon metabolism activity and oxygen consumption, enhancing the killing effects of antibiotics. This work demonstrates how prospective network modeling can couple with machine learning to identify complex causal mechanisms underlying drug efficacy.

GC-QTOFMS with a low-energy electron ionization source for advancing isotopologue analysis in 13C-based metabolic flux analysis.

For the study of different levels of (intra)cellular regulation and condition-dependent insight into metabolic activities, fluxomics experiments based on stable isotope tracer experiments using 13C have become a well-established approach. The experimentally obtained non-naturally distributed 13C labeling patterns of metabolite pools can be measured by mass spectrometric detection with front-end separation and can be consequently incorporated into biochemical network models. Here, despite a tedious derivatization step, gas chromatographic separation of polar metabolites is favorable because of the wide coverage range and high isomer separation efficiency. However, the typically employedelectron ionization energy of 70 eV leads to significant fragmentation and consequently only low-abundant ions with an intact carbon backbone. Since these ions are considered a prerequisite for the analysis of the non-naturally distributed labeling patterns and further integration into modeling strategies, a softer ionization technique is needed. In the present work, a novel lowenergy electron ionization source is optimized for the analysis of primary metabolites and compared with a chemical ionization approach in terms of trueness, precision, and sensitivity.

Simulation and inference algorithms for stochastic biochemical reaction networks: from basic concepts to state-of-the-art.

Stochasticity is a key characteristic of intracellular processes such as gene regulation and chemical signalling. Therefore, characterizing stochastic effects in biochemical systems is essential to understand the complex dynamics of living things. Mathematical idealizations of biochemically reacting systems must be able to capture stochastic phenomena. While robust theory exists to describe such stochastic models, the computational challenges in exploring these models can be a significant burden in practice since realistic models are analytically intractable. Determining the expected behaviour and variability of a stochastic biochemical reaction network requires many probabilistic simulations of its evolution. Using a biochemical reaction network model to assist in the interpretation of time-course data from a biological experiment is an even greater challenge due to the intractability of the likelihood function for determining observation probabilities. These computational challenges have been subjects of active research for over four decades. In this review, we present an accessible discussion of the major historical developments and state-of-the-art computational techniques relevant to simulation and inference problems for stochastic biochemical reaction network models. Detailed algorithms for particularly important methods are described and complemented with Matlab® implementations. As a result, this review provides a practical and accessible introduction to computational methods for stochastic models within the life sciences community.

Tandem Mass Spectrometry for 13C Metabolic Flux Analysis: Methods and Algorithms Based on EMU Framework.

In the past two decades, 13C metabolic flux analysis (13C-MFA) has matured into a powerful and widely used scientific tool in metabolic engineering and systems biology. Traditionally, metabolic fluxes have been determined from measurements of isotopic labeling by means of mass spectrometry (MS) or nuclear magnetic resonance (NMR). In recent years, tandem MS has emerged as a new analytical technique that can provide additional information for high-resolution quantification of metabolic fluxes in complex biological systems. In this paper, we present recent advances in methods and algorithms for incorporating tandem MS measurements into existing 13C-MFA approaches that are based on the elementary metabolite units (EMU) framework. Specifically, efficient EMU-based algorithms are presented for simulating tandem MS data, tracing isotopic labeling in biochemical network models and for correcting tandem MS data for natural isotope abundances.

Efficient computation of steady states in large-scale ODE models of biochemical reaction networks

In systems and computational biology, ordinary differential equations are used for the mechanistic modelling of biochemical networks. These models can easily have hundreds of states and parameters. Typically most parameters are unknown and estimated by fitting model output to observation. During parameter estimation the model needs to be solved repeatedly, sometimes millions of times. This can then be a computational bottleneck, and limits the employment of such models.In many situations the experimental data provides information about the steady state of the biochemical reaction network. In such cases one only needs to obtain the equilibrium state for a given set of model parameters. In this paper we exploit this fact and solve the steady state problem directly rather than integrating the ODE forward in time until steady state is reached. We use Newton’s method - like some previous studies - and develop several improvements to achieve robust convergence. To address the reliance of Newtons method on good initial guesses, we propose a continuation method. We show that the method works robustly in this setting and achieves a speed up of up to 100 compared to using ODE solves.

Parameter estimation and stability analysis of gene-regulation network of bacteriophage

This essay considers an ordinary differential equation on the phage λ regulatory network model, which has one and only one steady internal equilibrium by simplifying the calculation. Meanwhile, we use Ensemble Kalman Filter (EnKF) approach to compute the ratio of chemical reaction rate constant in the phage gene regulation network and combine the regulatory mechanism of the network to infer the amount of protein or DNA to avoid the high cost of protein-DNA detection. By changing the size of the initial ensemble of parameters, we get estimates with different precision. Numerical results clarify that the Ensemble Kalman Filter have an effect on parameter estimation of the phage regulatory network compared with the least square method. It perhaps is a relatively effective method to calculate unknown parameters in the biochemical network model by parameter estimation to lower the cost of biological experiments.

Multicellular Models Bridging Intracellular Signaling and Gene Transcription to Population Dynamics

Cell signaling and gene transcription occur at faster time scales compared to cellular death, division, and evolution. Bridging these multiscale events in a model is computationally challenging. We introduce a framework for the systematic development of multiscale cell population models. Using message passing interface (MPI) parallelism, the framework creates a population model from a single-cell biochemical network model. It launches parallel simulations on a single-cell model and treats each stand-alone parallel process as a cell object. MPI mediates cell-to-cell and cell-to-environment communications in a server-client fashion. In the framework, model-specific higher level rules link the intracellular molecular events to cellular functions, such as death, division, or phenotype change. Cell death is implemented by terminating a parallel process, while cell division is carried out by creating a new process (daughter cell) from an existing one (mother cell). We first demonstrate these capabilities by creating two simple example models. In one model, we consider a relatively simple scenario where cells can evolve independently. In the other model, we consider interdependency among the cells, where cellular communication determines their collective behavior and evolution under a temporally evolving growth condition. We then demonstrate the framework’s capability by simulating a full-scale model of bacterial quorum sensing, where the dynamics of a population of bacterial cells is dictated by the intercellular communications in a time-evolving growth environment.

Optimal experimental design for machine learning using the Fisher information matrix

Optimal experimental design (OED) refers to a class of methods for selecting new data collection conditions that minimize the statistical uncertainty in the inferred parameter values of a model. The Fisher information matrix (FIM) gives an estimate of the relative uncertainty in and correlation among the model parameters based on the local curvature of the cost function. FIM-based approaches to OED allow for rapid assessment of many different experimental conditions (e.g., input data type, parameterizations, etc.). In machine learning models, accurate parameter estimates are often not a priority (nor even desirable) as they have no direct physical meaning. Instead, one would like to minimize the uncertainty in the model predictions for several quantities of interest. FIM approaches to OED can be generalized to minimize statistical variance, not in parameters, but in predictions of the quantities of interest. This approach has been applied, for example, to systems biology models of biochemical reaction networks [Transtrum and Qiu, BMC Bioinformatics 13(1), 181 (2012)]. Preliminary application of the FIM to optimize experimental design for source localization in an uncertain ocean environment is a first step towards an efficient machine learning algorithm that produces results with the least uncertainty in the quantities of interest.

Identifiability and Reconstruction of Biochemical Reaction Networks from Population Snapshot Data

Inference of biochemical network models from experimental data is a crucial problem in systems and synthetic biology that includes parameter calibration but also identification of unknown interactions. Stochastic modelling from single-cell data is known to improve identifiability of reaction network parameters for specific systems. However, general results are lacking, and the advantage over deterministic, population-average approaches has not been explored for network reconstruction. In this work, we study identifiability and propose new reconstruction methods for biochemical interaction networks. Focusing on population-snapshot data and networks with reaction rates affine in the state, for parameter estimation, we derive general methods to test structural identifiability and demonstrate them in connection with practical identifiability for a reporter gene in silico case study. In the same framework, we next develop a two-step approach to the reconstruction of unknown networks of interactions. We apply it to compare the achievable network reconstruction performance in a deterministic and a stochastic setting, showing the advantage of the latter, and demonstrate it on population-snapshot data from a simulated example.

Bayesian parameter estimation for biochemical reaction networks using region-based adaptive parallel tempering.

MotivationMathematical models have become standard tools for the investigation of cellular processes and the unraveling of signal processing mechanisms. The parameters of these models are usually derived from the available data using optimization and sampling methods. However, the efficiency of these methods is limited by the properties of the mathematical model, e.g. non-identifiabilities, and the resulting posterior distribution. In particular, multi-modal distributions with long valleys or pronounced tails are difficult to optimize and sample. Thus, the developement or improvement of optimization and sampling methods is subject to ongoing research.ResultsWe suggest a region-based adaptive parallel tempering algorithm which adapts to the problem-specific posterior distributions, i.e. modes and valleys. The algorithm combines several established algorithms to overcome their individual shortcomings and to improve sampling efficiency. We assessed its properties for established benchmark problems and two ordinary differential equation models of biochemical reaction networks. The proposed algorithm outperformed state-of-the-art methods in terms of calculation efficiency and mixing. Since the algorithm does not rely on a specific problem structure, but adapts to the posterior distribution, it is suitable for a variety of model classes.Availability and implementationThe code is available both as Supplementary Material and in a Git repository written in MATLAB.Supplementary information Supplementary data are available at Bioinformatics online.

PyCoTools: a Python toolbox for COPASI.

MotivationCOPASI is an open source software package for constructing, simulating and analyzing dynamic models of biochemical networks. COPASI is primarily intended to be used with a graphical user interface but often it is desirable to be able to access COPASI features programmatically, with a high level interface.ResultsPyCoTools is a Python package aimed at providing a high level interface to COPASI tasks with an emphasis on model calibration. PyCoTools enables the construction of COPASI models and the execution of a subset of COPASI tasks including time courses, parameter scans and parameter estimations. Additional ‘composite’ tasks which use COPASI tasks as building blocks are available for increasing parameter estimation throughput, performing identifiability analysis and performing model selection. PyCoTools supports exploratory data analysis on parameter estimation data to assist with troubleshooting model calibrations. We demonstrate PyCoTools by posing a model selection problem designed to show case PyCoTools within a realistic scenario. The aim of the model selection problem is to test the feasibility of three alternative hypotheses in explaining experimental data derived from neonatal dermal fibroblasts in response to TGF-β over time. PyCoTools is used to critically analyze the parameter estimations and propose strategies for model improvement.Availability and implementationPyCoTools can be downloaded from the Python Package Index (PyPI) using the command ’pip install pycotools’ or directly from GitHub (https://github.com/CiaranWelsh/pycotools). Documentation at http://pycotools.readthedocs.io.Supplementary information Supplementary data are available at Bioinformatics online.