1
|
Liu C, Wang J. Error-Controlled Coarse-Graining Dynamics with Mean-Field Randomization. J Chem Theory Comput 2023; 19:7505-7517. [PMID: 37906962 DOI: 10.1021/acs.jctc.3c00470] [Citation(s) in RCA: 0] [Impact Index Per Article: 0] [Reference Citation Analysis] [Abstract] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 11/02/2023]
Abstract
In order to comprehend the stochastic behavior of biological systems, it is essential to accurately infer the dynamics of chemical reaction networks. However, computation of the likelihood remains a bottleneck. In this study, we propose the mean-field randomization procedure as a means of efficiently generating error-controlled coarse-graining dynamics. The error is measured by mutual information between the generated trajectories and the coarse-graining procedure. We demonstrate that the exact dynamics can be recovered by resampling, which eliminates the correlation between the dynamics and the procedure. We developed three algorithms to efficiently generate exact or coarse-graining trajectories within a specified error range. By subjecting our algorithms to testing on chemical reaction systems of varying complexities and scales, we observe that they outperform existing state-of-the-art algorithms, and the efficiency of coarse-graining trajectory generation is only weakly dependent on system scales.
Collapse
Affiliation(s)
- Chuanbo Liu
- State Key Laboratory of Electroanalytical Chemistry, Changchun Institute of Applied Chemistry, Chinese Academy of Sciences, Changchun, Jilin 130022, P. R. China
| | - Jin Wang
- Department of Chemistry and of Physics and Astronomy, State University of New York, Stony Brook, New York 11794-3400, United States
| |
Collapse
|
2
|
Sinzger-D’Angelo M, Startceva S, Koeppl H. Bye bye, linearity, bye: quantification of the mean for linear CRNs in a random environment. J Math Biol 2023; 87:43. [PMID: 37573263 PMCID: PMC10423146 DOI: 10.1007/s00285-023-01973-x] [Citation(s) in RCA: 0] [Impact Index Per Article: 0] [Reference Citation Analysis] [Abstract] [Key Words] [MESH Headings] [Grants] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Received: 08/26/2022] [Revised: 07/04/2023] [Accepted: 07/22/2023] [Indexed: 08/14/2023]
Abstract
Molecular reactions within a cell are inherently stochastic, and cells often differ in morphological properties or interact with a heterogeneous environment. Consequently, cell populations exhibit heterogeneity both due to these intrinsic and extrinsic causes. Although state-of-the-art studies that focus on dissecting this heterogeneity use single-cell measurements, the bulk data that shows only the mean expression levels is still in routine use. The fingerprint of the heterogeneity is present also in bulk data, despite being hidden from direct measurement. In particular, this heterogeneity can affect the mean expression levels via bimolecular interactions with low-abundant environment species. We make this statement rigorous for the class of linear reaction systems that are embedded in a discrete state Markov environment. The analytic expression that we provide for the stationary mean depends on the reaction rate constants of the linear subsystem, as well as the generator and stationary distribution of the Markov environment. We demonstrate the effect of the environment on the stationary mean. Namely, we show how the heterogeneous case deviates from the quasi-steady state (Q.SS) case when the embedded system is fast compared to the environment.
Collapse
Affiliation(s)
- Mark Sinzger-D’Angelo
- Electrical Engineering and Information Technology, Technische Universität Darmstadt, Darmstadt, Germany
- Centre for Synthetic Biology, Technische Universität Darmstadt, Darmstadt, Germany
| | - Sofia Startceva
- Electrical Engineering and Information Technology, Technische Universität Darmstadt, Darmstadt, Germany
- Centre for Synthetic Biology, Technische Universität Darmstadt, Darmstadt, Germany
| | - Heinz Koeppl
- Electrical Engineering and Information Technology, Technische Universität Darmstadt, Darmstadt, Germany
- Centre for Synthetic Biology, Technische Universität Darmstadt, Darmstadt, Germany
| |
Collapse
|
3
|
Reh M, Schmitt M, Gärttner M. Time-Dependent Variational Principle for Open Quantum Systems with Artificial Neural Networks. PHYSICAL REVIEW LETTERS 2021; 127:230501. [PMID: 34936784 DOI: 10.1103/physrevlett.127.230501] [Citation(s) in RCA: 11] [Impact Index Per Article: 3.7] [Reference Citation Analysis] [Abstract] [Track Full Text] [Subscribe] [Scholar Register] [Received: 04/26/2021] [Revised: 07/16/2021] [Accepted: 11/05/2021] [Indexed: 06/14/2023]
Abstract
We develop a variational approach to simulating the dynamics of open quantum many-body systems using deep autoregressive neural networks. The parameters of a compressed representation of a mixed quantum state are adapted dynamically according to the Lindblad master equation by employing a time-dependent variational principle. We illustrate our approach by solving the dissipative quantum Heisenberg model in one dimension for up to 40 spins and in two dimensions for a 4×4 system and by applying it to the simulation of confinement dynamics in the presence of dissipation.
Collapse
Affiliation(s)
- Moritz Reh
- Kirchhoff-Institut für Physik, Universität Heidelberg, Im Neuenheimer Feld 227, 69120 Heidelberg, Germany
| | - Markus Schmitt
- Institut für Theoretische Physik, Universität zu Köln, 50937 Köln, Germany
| | - Martin Gärttner
- Kirchhoff-Institut für Physik, Universität Heidelberg, Im Neuenheimer Feld 227, 69120 Heidelberg, Germany
- Physikalisches Institut, Universität Heidelberg, Im Neuenheimer Feld 226, 69120 Heidelberg, Germany
- Institut für Theoretische Physik, Ruprecht-Karls-Universität Heidelberg, Philosophenweg 16, 69120 Heidelberg, Germany
| |
Collapse
|
4
|
Ion IG, Wildner C, Loukrezis D, Koeppl H, De Gersem H. Tensor-train approximation of the chemical master equation and its application for parameter inference. J Chem Phys 2021; 155:034102. [PMID: 34293878 DOI: 10.1063/5.0045521] [Citation(s) in RCA: 3] [Impact Index Per Article: 1.0] [Reference Citation Analysis] [Abstract] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 11/15/2022] Open
Abstract
In this work, we perform Bayesian inference tasks for the chemical master equation in the tensor-train format. The tensor-train approximation has been proven to be very efficient in representing high-dimensional data arising from the explicit representation of the chemical master equation solution. An additional advantage of representing the probability mass function in the tensor-train format is that parametric dependency can be easily incorporated by introducing a tensor product basis expansion in the parameter space. Time is treated as an additional dimension of the tensor and a linear system is derived to solve the chemical master equation in time. We exemplify the tensor-train method by performing inference tasks such as smoothing and parameter inference using the tensor-train framework. A very high compression ratio is observed for storing the probability mass function of the solution. Since all linear algebra operations are performed in the tensor-train format, a significant reduction in the computational time is observed as well.
Collapse
Affiliation(s)
- Ion Gabriel Ion
- Centre for Computational Engineering, Technische Universität Darmstadt, Darmstadt, Germany
| | - Christian Wildner
- Department of Electrical Engineering and Information Technology, Technische Universität Darmstadt, Darmstadt, Germany
| | - Dimitrios Loukrezis
- Centre for Computational Engineering, Technische Universität Darmstadt, Darmstadt, Germany
| | - Heinz Koeppl
- Centre for Computational Engineering, Technische Universität Darmstadt, Darmstadt, Germany
| | - Herbert De Gersem
- Centre for Computational Engineering, Technische Universität Darmstadt, Darmstadt, Germany
| |
Collapse
|
5
|
Johnson ME, Chen A, Faeder JR, Henning P, Moraru II, Meier-Schellersheim M, Murphy RF, Prüstel T, Theriot JA, Uhrmacher AM. Quantifying the roles of space and stochasticity in computer simulations for cell biology and cellular biochemistry. Mol Biol Cell 2021; 32:186-210. [PMID: 33237849 PMCID: PMC8120688 DOI: 10.1091/mbc.e20-08-0530] [Citation(s) in RCA: 10] [Impact Index Per Article: 3.3] [Reference Citation Analysis] [Abstract] [MESH Headings] [Grants] [Track Full Text] [Download PDF] [Figures] [Journal Information] [Subscribe] [Scholar Register] [Received: 08/12/2020] [Revised: 10/13/2020] [Accepted: 11/17/2020] [Indexed: 12/29/2022] Open
Abstract
Most of the fascinating phenomena studied in cell biology emerge from interactions among highly organized multimolecular structures embedded into complex and frequently dynamic cellular morphologies. For the exploration of such systems, computer simulation has proved to be an invaluable tool, and many researchers in this field have developed sophisticated computational models for application to specific cell biological questions. However, it is often difficult to reconcile conflicting computational results that use different approaches to describe the same phenomenon. To address this issue systematically, we have defined a series of computational test cases ranging from very simple to moderately complex, varying key features of dimensionality, reaction type, reaction speed, crowding, and cell size. We then quantified how explicit spatial and/or stochastic implementations alter outcomes, even when all methods use the same reaction network, rates, and concentrations. For simple cases, we generally find minor differences in solutions of the same problem. However, we observe increasing discordance as the effects of localization, dimensionality reduction, and irreversible enzymatic reactions are combined. We discuss the strengths and limitations of commonly used computational approaches for exploring cell biological questions and provide a framework for decision making by researchers developing new models. As computational power and speed continue to increase at a remarkable rate, the dream of a fully comprehensive computational model of a living cell may be drawing closer to reality, but our analysis demonstrates that it will be crucial to evaluate the accuracy of such models critically and systematically.
Collapse
Affiliation(s)
- M. E. Johnson
- Thomas C. Jenkins Department of Biophysics, Johns Hopkins University, Baltimore, MD, 21218
| | - A. Chen
- Thomas C. Jenkins Department of Biophysics, Johns Hopkins University, Baltimore, MD, 21218
| | - J. R. Faeder
- Department of Computational and Systems Biology, University of Pittsburgh School of Medicine, Pittsburgh, PA, 15260
| | - P. Henning
- Institute for Visual and Analytic Computing, University of Rostock, 18055 Rostock, Germany
| | - I. I. Moraru
- Department of Cell Biology, Center for Cell Analysis and Modeling, University of Connecticut Health Center, Farmington, CT 06030
| | - M. Meier-Schellersheim
- Laboratory of Immune System Biology, National Institute of Allergy and Infectious Diseases, National Institutes of Health, Bethesda, MD 20892
| | - R. F. Murphy
- Computational Biology Department, Department of Biological Sciences, Department of Biomedical Engineering, Machine Learning Department, Carnegie Mellon University, Pittsburgh, PA 15289
| | - T. Prüstel
- Laboratory of Immune System Biology, National Institute of Allergy and Infectious Diseases, National Institutes of Health, Bethesda, MD 20892
| | - J. A. Theriot
- Department of Biology and Howard Hughes Medical Institute, University of Washington, Seattle, WA 98195
| | - A. M. Uhrmacher
- Institute for Visual and Analytic Computing, University of Rostock, 18055 Rostock, Germany
| |
Collapse
|
6
|
Dinh T, Sidje RB. An adaptive solution to the chemical master equation using quantized tensor trains with sliding windows. Phys Biol 2020; 17:065014. [PMID: 32610302 DOI: 10.1088/1478-3975/aba1d2] [Citation(s) in RCA: 5] [Impact Index Per Article: 1.3] [Reference Citation Analysis] [Abstract] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 11/12/2022]
Abstract
To cope with an extremely large or even infinite state space when solving the chemical master equation in biological problems, a potent strategy is to restrict to a finite state projection (FSP) and represent the transition matrix and probability vector in quantized tensor train (QTT) format, leading to savings in storage while retaining accuracy. In an earlier adaptive FSP-QTT algorithm, the multidimensional state space was downsized and kept in the form of a hyper rectangle that was updated when needed by selectively doubling some of its side dimensions. However, this could result in a much larger state space than necessary, with the effect of hampering both the execution time and stepping scheme. In this work, we improve the algorithm by enabling sliding windows that can dynamically slide, shrink or expand, with updates driven by a number of stochastic simulation algorithm trajectories. The ensuing state space is a considerably reduced hyper rectangle containing only the most probable states at each time step. Three numerical experiments of varying difficulty are performed to compare our approach with the original adaptive FSP-QTT algorithm.
Collapse
|
7
|
Kosarwal R, Kulasiri D, Samarasinghe S. Novel domain expansion methods to improve the computational efficiency of the Chemical Master Equation solution for large biological networks. BMC Bioinformatics 2020; 21:515. [PMID: 33176690 PMCID: PMC7656229 DOI: 10.1186/s12859-020-03668-2] [Citation(s) in RCA: 2] [Impact Index Per Article: 0.5] [Reference Citation Analysis] [Abstract] [Key Words] [MESH Headings] [Track Full Text] [Download PDF] [Figures] [Journal Information] [Subscribe] [Scholar Register] [Received: 04/19/2020] [Accepted: 07/17/2020] [Indexed: 12/23/2022] Open
Abstract
BACKGROUND Numerical solutions of the chemical master equation (CME) are important for understanding the stochasticity of biochemical systems. However, solving CMEs is a formidable task. This task is complicated due to the nonlinear nature of the reactions and the size of the networks which result in different realizations. Most importantly, the exponential growth of the size of the state-space, with respect to the number of different species in the system makes this a challenging assignment. When the biochemical system has a large number of variables, the CME solution becomes intractable. We introduce the intelligent state projection (ISP) method to use in the stochastic analysis of these systems. For any biochemical reaction network, it is important to capture more than one moment: this allows one to describe the system's dynamic behaviour. ISP is based on a state-space search and the data structure standards of artificial intelligence (AI). It can be used to explore and update the states of a biochemical system. To support the expansion in ISP, we also develop a Bayesian likelihood node projection (BLNP) function to predict the likelihood of the states. RESULTS To demonstrate the acceptability and effectiveness of our method, we apply the ISP method to several biological models discussed in prior literature. The results of our computational experiments reveal that the ISP method is effective both in terms of the speed and accuracy of the expansion, and the accuracy of the solution. This method also provides a better understanding of the state-space of the system in terms of blueprint patterns. CONCLUSIONS The ISP is the de-novo method which addresses both accuracy and performance problems for CME solutions. It systematically expands the projection space based on predefined inputs. This ensures accuracy in the approximation and an exact analytical solution for the time of interest. The ISP was more effective both in predicting the behavior of the state-space of the system and in performance management, which is a vital step towards modeling large biochemical systems.
Collapse
Affiliation(s)
- Rahul Kosarwal
- Centre for Advanced Computational Solutions (C-fACS), Lincoln University, Lincoln, Christchurch, New Zealand
- Complex Systems, Big Data, and Informatics Initiative (CSBII), Lincoln University, Lincoln, Christchurch, New Zealand
| | - Don Kulasiri
- Centre for Advanced Computational Solutions (C-fACS), Lincoln University, Lincoln, Christchurch, New Zealand.
- Complex Systems, Big Data, and Informatics Initiative (CSBII), Lincoln University, Lincoln, Christchurch, New Zealand.
| | - Sandhya Samarasinghe
- Centre for Advanced Computational Solutions (C-fACS), Lincoln University, Lincoln, Christchurch, New Zealand
- Complex Systems, Big Data, and Informatics Initiative (CSBII), Lincoln University, Lincoln, Christchurch, New Zealand
| |
Collapse
|
8
|
Sharpe DJ, Wales DJ. Efficient and exact sampling of transition path ensembles on Markovian networks. J Chem Phys 2020; 153:024121. [DOI: 10.1063/5.0012128] [Citation(s) in RCA: 9] [Impact Index Per Article: 2.3] [Reference Citation Analysis] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 12/20/2022] Open
Affiliation(s)
- Daniel J. Sharpe
- Department of Chemistry, University of Cambridge, Lensfield Road, Cambridge CB2 1EW, United Kingdom
| | - David J. Wales
- Department of Chemistry, University of Cambridge, Lensfield Road, Cambridge CB2 1EW, United Kingdom
| |
Collapse
|
9
|
Catanach TA, Vo HD, Munsky B. BAYESIAN INFERENCE OF STOCHASTIC REACTION NETWORKS USING MULTIFIDELITY SEQUENTIAL TEMPERED MARKOV CHAIN MONTE CARLO. INTERNATIONAL JOURNAL FOR UNCERTAINTY QUANTIFICATION 2020; 10:515-542. [PMID: 34007522 PMCID: PMC8127724 DOI: 10.1615/int.j.uncertaintyquantification.2020033241] [Citation(s) in RCA: 0] [Impact Index Per Article: 0] [Reference Citation Analysis] [Abstract] [Key Words] [Grants] [Track Full Text] [Subscribe] [Scholar Register] [Indexed: 05/03/2023]
Abstract
Stochastic reaction network models are often used to explain and predict the dynamics of gene regulation in single cells. These models usually involve several parameters, such as the kinetic rates of chemical reactions, that are not directly measurable and must be inferred from experimental data. Bayesian inference provides a rigorous probabilistic framework for identifying these parameters by finding a posterior parameter distribution that captures their uncertainty. Traditional computational methods for solving inference problems such as Markov Chain Monte Carlo methods based on classical Metropolis-Hastings algorithm involve numerous serial evaluations of the likelihood function, which in turn requires expensive forward solutions of the chemical master equation (CME). We propose an alternate approach based on a multifidelity extension of the Sequential Tempered Markov Chain Monte Carlo (ST-MCMC) sampler. This algorithm is built upon Sequential Monte Carlo and solves the Bayesian inference problem by decomposing it into a sequence of efficiently solved subproblems that gradually increase both model fidelity and the influence of the observed data. We reformulate the finite state projection (FSP) algorithm, a well-known method for solving the CME, to produce a hierarchy of surrogate master equations to be used in this multifidelity scheme. To determine the appropriate fidelity, we introduce a novel information-theoretic criteria that seeks to extract the most information about the ultimate Bayesian posterior from each model in the hierarchy without inducing significant bias. This novel sampling scheme is tested with high performance computing resources using biologically relevant problems.
Collapse
Affiliation(s)
- Thomas A. Catanach
- Sandia National Laboratories, Livermore, CA, 94550
- Address all correspondence to: Thomas A. Catanach,
| | - Huy D. Vo
- Dept. of Chemical and Biological Engr., Colorado State University, Fort Collins, CO, 80521
| | - Brian Munsky
- Dept. of Chemical and Biological Engr., Colorado State University, Fort Collins, CO, 80521
| |
Collapse
|
10
|
Reid BM, Sidje RB. Finite state projection for approximating the stationary solution to the chemical master equation using reaction rate equations. Math Biosci 2019; 316:108243. [PMID: 31449893 DOI: 10.1016/j.mbs.2019.108243] [Citation(s) in RCA: 0] [Impact Index Per Article: 0] [Reference Citation Analysis] [Abstract] [Key Words] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Received: 04/18/2019] [Revised: 08/21/2019] [Accepted: 08/22/2019] [Indexed: 10/26/2022]
Abstract
When modeling a physical system using a Markov chain, it is often instructive to compute its probability distribution at statistical equilibrium, thereby gaining insight into the stationary, or long-term, behavior of the system. Computing such a distribution directly is problematic when the state space of the system is large. Here, we look at the case of a chemical reaction system that models the dynamics of cellular processes, where it has become popular to constrain the computational burden by using a finite state projection, which aims only to capture the most likely states of the system, rather than every possible state. We propose an efficient method to further narrow these states to those that remain highly probable in the long run, after the transient behavior of the system has dissipated. Our strategy is to quickly estimate the local maxima of the stationary distribution using the reaction rate formulation, which is of considerably smaller size than the full-blown chemical master equation, and from there develop adaptive schemes to profile the distribution around the maxima. We include numerical tests that show the efficiency of our approach.
Collapse
Affiliation(s)
- Brandon M Reid
- Department of Mathematics, The University of Alabama, Tuscaloosa, AL 35487, USA.
| | - Roger B Sidje
- Department of Mathematics, The University of Alabama, Tuscaloosa, AL 35487, USA.
| |
Collapse
|
11
|
Terebus A, Liu C, Liang J. Discrete flux and velocity fields of probability and their global maps in reaction systems. J Chem Phys 2018; 149:185101. [PMID: 30441929 DOI: 10.1063/1.5050808] [Citation(s) in RCA: 5] [Impact Index Per Article: 0.8] [Reference Citation Analysis] [Abstract] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 01/14/2023] Open
Abstract
Stochasticity plays important roles in reaction systems. Vector fields of probability flux and velocity characterize time-varying and steady-state properties of these systems, including high probability paths, barriers, checkpoints among different stable regions, as well as mechanisms of dynamic switching among them. However, conventional fluxes on continuous space are ill-defined and are problematic when at the boundaries of the state space or when copy numbers are small. By re-defining the derivative and divergence operators based on the discrete nature of reactions, we introduce new formulations of discrete fluxes. Our flux model fully accounts for the discreetness of both the state space and the jump processes of reactions. The reactional discrete flux satisfies the continuity equation and describes the behavior of the system evolving along directions of reactions. The species discrete flux directly describes the dynamic behavior in the state space of the reactants such as the transfer of probability mass. With the relationship between these two fluxes specified, we show how to construct time-evolving and steady-state global flow-maps of probability flux and velocity in the directions of every species at every microstate and how they are related to the outflow and inflow of probability fluxes when tracing out reaction trajectories. We also describe how to impose proper conditions enabling exact quantification of flux and velocity in the boundary regions, without the difficulty of enforcing artificial reflecting conditions. We illustrate the computation of probability flux and velocity using three model systems, namely, the birth-death process, the bistable Schlögl model, and the oscillating Schnakenberg model.
Collapse
Affiliation(s)
- Anna Terebus
- Department of Bioengineering, University of Illinois at Chicago, Chicago, Illinois 60607, USA
| | - Chun Liu
- Department of Applied Mathematics, Illinois Institute of Technology, Chicago, Illinois 60616, USA
| | - Jie Liang
- Department of Bioengineering, University of Illinois at Chicago, Chicago, Illinois 60607, USA
| |
Collapse
|
12
|
Stochastic hybrid models of gene regulatory networks – A PDE approach. Math Biosci 2018; 305:170-177. [DOI: 10.1016/j.mbs.2018.09.009] [Citation(s) in RCA: 18] [Impact Index Per Article: 3.0] [Reference Citation Analysis] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Received: 03/29/2018] [Revised: 09/14/2018] [Accepted: 09/19/2018] [Indexed: 12/14/2022]
|
13
|
Kyriakopoulos C, Grossmann G, Wolf V, Bortolussi L. Lumping of degree-based mean-field and pair-approximation equations for multistate contact processes. Phys Rev E 2018; 97:012301. [PMID: 29448315 DOI: 10.1103/physreve.97.012301] [Citation(s) in RCA: 8] [Impact Index Per Article: 1.3] [Reference Citation Analysis] [Abstract] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Received: 07/03/2017] [Indexed: 11/07/2022]
Abstract
Contact processes form a large and highly interesting class of dynamic processes on networks, including epidemic and information-spreading networks. While devising stochastic models of such processes is relatively easy, analyzing them is very challenging from a computational point of view, particularly for large networks appearing in real applications. One strategy to reduce the complexity of their analysis is to rely on approximations, often in terms of a set of differential equations capturing the evolution of a random node, distinguishing nodes with different topological contexts (i.e., different degrees of different neighborhoods), such as degree-based mean-field (DBMF), approximate-master-equation (AME), or pair-approximation (PA) approaches. The number of differential equations so obtained is typically proportional to the maximum degree k_{max} of the network, which is much smaller than the size of the master equation of the underlying stochastic model, yet numerically solving these equations can still be problematic for large k_{max}. In this paper, we consider AME and PA, extended to cope with multiple local states, and we provide an aggregation procedure that clusters together nodes having similar degrees, treating those in the same cluster as indistinguishable, thus reducing the number of equations while preserving an accurate description of global observables of interest. We also provide an automatic way to build such equations and to identify a small number of degree clusters that give accurate results. The method is tested on several case studies, where it shows a high level of compression and a reduction of computational time of several orders of magnitude for large networks, with minimal loss in accuracy.
Collapse
Affiliation(s)
| | - Gerrit Grossmann
- Computer Science Department, Saarland University, Saarbrücken, Germany
| | - Verena Wolf
- Computer Science Department, Saarland University, Saarbrücken, Germany
| | - Luca Bortolussi
- Department of Mathematics and Geosciences, University of Trieste, Trieste, Italy
| |
Collapse
|
14
|
Mu C, Dittrich P, Parker D, Rowe JE. Organisation-Oriented Coarse Graining and Refinement of Stochastic Reaction Networks. IEEE/ACM TRANSACTIONS ON COMPUTATIONAL BIOLOGY AND BIOINFORMATICS 2018; 15:1152-1166. [PMID: 29994367 DOI: 10.1109/tcbb.2018.2804395] [Citation(s) in RCA: 3] [Impact Index Per Article: 0.5] [Reference Citation Analysis] [Abstract] [MESH Headings] [Track Full Text] [Subscribe] [Scholar Register] [Indexed: 06/08/2023]
Abstract
Chemical organisation theory is a framework developed to simplify the analysis of long-term behaviour of chemical systems. In this work, we build on these ideas to develop novel techniques for formal quantitative analysis of chemical reaction networks, using discrete stochastic models represented as continuous-time Markov chains. We propose methods to identify organisations, and to study quantitative properties regarding movements between these organisations. We then construct and formalise a coarse-grained Markov chain model of hierarchic organisations for a given reaction network, which can be used to approximate the behaviour of the original reaction network. As an application of the coarse-grained model, we predict the behaviour of the reaction network systems over time via the master equation. Experiments show that our predictions can mimic the main pattern of the concrete behaviour in the long run, but the precision varies for different models and reaction rule rates. Finally, we propose an algorithm to selectively refine the coarse-grained models and show experiments demonstrating that the precision of the prediction has been improved.
Collapse
|
15
|
Vo HD, Sidje RB. An adaptive solution to the chemical master equation using tensors. J Chem Phys 2018; 147:044102. [PMID: 28764339 DOI: 10.1063/1.4994917] [Citation(s) in RCA: 13] [Impact Index Per Article: 2.2] [Reference Citation Analysis] [Abstract] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 02/07/2023] Open
Abstract
Solving the chemical master equation directly is difficult due to the curse of dimensionality. We tackle that challenge by a numerical scheme based on the quantized tensor train (QTT) format, which enables us to represent the solution in a compressed form that scales linearly with the dimension. We recast the finite state projection in this QTT framework and allow it to expand adaptively based on proven error criteria. The end result is a QTT-formatted matrix exponential that we evaluate through a combination of the inexact uniformization technique and the alternating minimal energy algorithm. Our method can detect when the equilibrium distribution is reached with an inexpensive test that exploits the structure of the tensor format. We successfully perform numerical tests on high-dimensional problems that had been out of reach for classical approaches.
Collapse
Affiliation(s)
- Huy D Vo
- Department of Mathematics, The University of Alabama, Tuscaloosa, Alabama 35487, USA
| | - Roger B Sidje
- Department of Mathematics, The University of Alabama, Tuscaloosa, Alabama 35487, USA
| |
Collapse
|
16
|
Avcu N, Pekergin N, Pekergin F, Guzelis C. Aggregation for Computing Multi-Modal Stationary Distributions in 1-D Gene Regulatory Networks. IEEE/ACM TRANSACTIONS ON COMPUTATIONAL BIOLOGY AND BIOINFORMATICS 2018; 15:813-827. [PMID: 28463205 DOI: 10.1109/tcbb.2017.2699177] [Citation(s) in RCA: 1] [Impact Index Per Article: 0.2] [Reference Citation Analysis] [Abstract] [MESH Headings] [Track Full Text] [Subscribe] [Scholar Register] [Indexed: 06/07/2023]
Abstract
This paper proposes aggregation-based, three-stage algorithms to overcome the numerical problems encountered in computing stationary distributions and mean first passage times for multi-modal birth-death processes of large state space sizes. The considered birth-death processes which are defined by Chemical Master Equations are used in modeling stochastic behavior of gene regulatory networks. Computing stationary probabilities for a multi-modal distribution from Chemical Master Equations is subject to have numerical problems due to the probability values running out of the representation range of the standard programming languages with the increasing size of the state space. The aggregation is shown to provide a solution to this problem by analyzing first reduced size subsystems in isolation and then considering the transitions between these subsystems. The proposed algorithms are applied to study the bimodal behavior of the lac operon of E. coli described with a one-dimensional birth-death model. Thus, the determination of the entire parameter range of bimodality for the stochastic model of lac operon is achieved.
Collapse
|
17
|
Dinh KN, Sidje RB. An application of the Krylov-FSP-SSA method to parameter fitting with maximum likelihood. Phys Biol 2017; 14:065001. [PMID: 29098989 DOI: 10.1088/1478-3975/aa868a] [Citation(s) in RCA: 7] [Impact Index Per Article: 1.0] [Reference Citation Analysis] [Abstract] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 11/11/2022]
Abstract
Monte Carlo methods such as the stochastic simulation algorithm (SSA) have traditionally been employed in gene regulation problems. However, there has been increasing interest to directly obtain the probability distribution of the molecules involved by solving the chemical master equation (CME). This requires addressing the curse of dimensionality that is inherent in most gene regulation problems. The finite state projection (FSP) seeks to address the challenge and there have been variants that further reduce the size of the projection or that accelerate the resulting matrix exponential. The Krylov-FSP-SSA variant has proved numerically efficient by combining, on one hand, the SSA to adaptively drive the FSP, and on the other hand, adaptive Krylov techniques to evaluate the matrix exponential. Here we apply this Krylov-FSP-SSA to a mutual inhibitory gene network synthetically engineered in Saccharomyces cerevisiae, in which bimodality arises. We show numerically that the approach can efficiently approximate the transient probability distribution, and this has important implications for parameter fitting, where the CME has to be solved for many different parameter sets. The fitting scheme amounts to an optimization problem of finding the parameter set so that the transient probability distributions fit the observations with maximum likelihood. We compare five optimization schemes for this difficult problem, thereby providing further insights into this approach of parameter estimation that is often applied to models in systems biology where there is a need to calibrate free parameters.
Collapse
Affiliation(s)
- Khanh N Dinh
- Department of Mathematics, University of Alabama, Tuscaloosa, AL 35487, United States of America
| | | |
Collapse
|
18
|
Fox Z, Neuert G, Munsky B. Finite state projection based bounds to compare chemical master equation models using single-cell data. J Chem Phys 2017; 145:074101. [PMID: 27544081 DOI: 10.1063/1.4960505] [Citation(s) in RCA: 19] [Impact Index Per Article: 2.7] [Reference Citation Analysis] [Abstract] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 11/14/2022] Open
Abstract
Emerging techniques now allow for precise quantification of distributions of biological molecules in single cells. These rapidly advancing experimental methods have created a need for more rigorous and efficient modeling tools. Here, we derive new bounds on the likelihood that observations of single-cell, single-molecule responses come from a discrete stochastic model, posed in the form of the chemical master equation. These strict upper and lower bounds are based on a finite state projection approach, and they converge monotonically to the exact likelihood value. These bounds allow one to discriminate rigorously between models and with a minimum level of computational effort. In practice, these bounds can be incorporated into stochastic model identification and parameter inference routines, which improve the accuracy and efficiency of endeavors to analyze and predict single-cell behavior. We demonstrate the applicability of our approach using simulated data for three example models as well as for experimental measurements of a time-varying stochastic transcriptional response in yeast.
Collapse
Affiliation(s)
- Zachary Fox
- School of Biomedical Engineering, Colorado State University, Fort Collins, Colorado 80523, USA
| | - Gregor Neuert
- Department of Molecular Physiology and Biophysics, Vanderbilt University School of Medicine, Nashville, Tennessee 37232, USA
| | - Brian Munsky
- School of Biomedical Engineering, Colorado State University, Fort Collins, Colorado 80523, USA
| |
Collapse
|
19
|
Chu BK, Tse MJ, Sato RR, Read EL. Markov State Models of gene regulatory networks. BMC SYSTEMS BIOLOGY 2017; 11:14. [PMID: 28166778 PMCID: PMC5294885 DOI: 10.1186/s12918-017-0394-4] [Citation(s) in RCA: 19] [Impact Index Per Article: 2.7] [Reference Citation Analysis] [Abstract] [Key Words] [Track Full Text] [Download PDF] [Figures] [Subscribe] [Scholar Register] [Received: 09/27/2016] [Accepted: 01/13/2017] [Indexed: 11/22/2022]
Abstract
Background Gene regulatory networks with dynamics characterized by multiple stable states underlie cell fate-decisions. Quantitative models that can link molecular-level knowledge of gene regulation to a global understanding of network dynamics have the potential to guide cell-reprogramming strategies. Networks are often modeled by the stochastic Chemical Master Equation, but methods for systematic identification of key properties of the global dynamics are currently lacking. Results The method identifies the number, phenotypes, and lifetimes of long-lived states for a set of common gene regulatory network models. Application of transition path theory to the constructed Markov State Model decomposes global dynamics into a set of dominant transition paths and associated relative probabilities for stochastic state-switching. Conclusions In this proof-of-concept study, we found that the Markov State Model provides a general framework for analyzing and visualizing stochastic multistability and state-transitions in gene networks. Our results suggest that this framework—adopted from the field of atomistic Molecular Dynamics—can be a useful tool for quantitative Systems Biology at the network scale. Electronic supplementary material The online version of this article (doi:10.1186/s12918-017-0394-4) contains supplementary material, which is available to authorized users.
Collapse
Affiliation(s)
- Brian K Chu
- Department of Chemical Engineering and Materials Science, University of California Irvine, Irvine, CA, USA
| | - Margaret J Tse
- Department of Chemical Engineering and Materials Science, University of California Irvine, Irvine, CA, USA
| | - Royce R Sato
- Department of Chemical Engineering and Materials Science, University of California Irvine, Irvine, CA, USA
| | - Elizabeth L Read
- Department of Chemical Engineering and Materials Science, University of California Irvine, Irvine, CA, USA. .,Department of Molecular Biology and Biochemistry, University of California Irvine, Irvine, CA, USA.
| |
Collapse
|
20
|
Schilling C, Bogomolov S, Henzinger TA, Podelski A, Ruess J. Adaptive moment closure for parameter inference of biochemical reaction networks. Biosystems 2016; 149:15-25. [DOI: 10.1016/j.biosystems.2016.07.005] [Citation(s) in RCA: 7] [Impact Index Per Article: 0.9] [Reference Citation Analysis] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Received: 11/28/2015] [Revised: 06/30/2016] [Accepted: 07/12/2016] [Indexed: 01/27/2023]
|
21
|
Cardelli L, Kwiatkowska M, Laurenti L. Stochastic analysis of Chemical Reaction Networks using Linear Noise Approximation. Biosystems 2016; 149:26-33. [PMID: 27816736 DOI: 10.1016/j.biosystems.2016.09.004] [Citation(s) in RCA: 14] [Impact Index Per Article: 1.8] [Reference Citation Analysis] [Abstract] [Key Words] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Received: 11/27/2015] [Revised: 07/08/2016] [Accepted: 09/01/2016] [Indexed: 10/20/2022]
Abstract
Stochastic evolution of Chemical Reactions Networks (CRNs) over time is usually analyzed through solving the Chemical Master Equation (CME) or performing extensive simulations. Analysing stochasticity is often needed, particularly when some molecules occur in low numbers. Unfortunately, both approaches become infeasible if the system is complex and/or it cannot be ensured that initial populations are small. We develop a probabilistic logic for CRNs that enables stochastic analysis of the evolution of populations of molecular species. We present an approximate model checking algorithm based on the Linear Noise Approximation (LNA) of the CME, whose computational complexity is independent of the population size of each species and polynomial in the number of different species. The algorithm requires the solution of first order polynomial differential equations. We prove that our approach is valid for any CRN close enough to the thermodynamical limit. However, we show on four case studies that it can still provide good approximation even for low molecule counts. Our approach enables rigorous analysis of CRNs that are not analyzable by solving the CME, but are far from the deterministic limit. Moreover, it can be used for a fast approximate stochastic characterization of a CRN.
Collapse
Affiliation(s)
- Luca Cardelli
- Department of Computer Science, University of Oxford, United Kingdom; Microsoft Research, Cambridge, United Kingdom.
| | - Marta Kwiatkowska
- Department of Computer Science, University of Oxford, United Kingdom.
| | - Luca Laurenti
- Department of Computer Science, University of Oxford, United Kingdom.
| |
Collapse
|
22
|
Huang L, Pauleve L, Zechner C, Unger M, Hansen AS, Koeppl H. Reconstructing dynamic molecular states from single-cell time series. J R Soc Interface 2016; 13:20160533. [PMID: 27605167 PMCID: PMC5046952 DOI: 10.1098/rsif.2016.0533] [Citation(s) in RCA: 7] [Impact Index Per Article: 0.9] [Reference Citation Analysis] [Abstract] [Key Words] [MESH Headings] [Grants] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Received: 07/05/2016] [Accepted: 08/09/2016] [Indexed: 11/12/2022] Open
Abstract
The notion of state for a system is prevalent in the quantitative sciences and refers to the minimal system summary sufficient to describe the time evolution of the system in a self-consistent manner. This is a prerequisite for a principled understanding of the inner workings of a system. Owing to the complexity of intracellular processes, experimental techniques that can retrieve a sufficient summary are beyond our reach. For the case of stochastic biomolecular reaction networks, we show how to convert the partial state information accessible by experimental techniques into a full system state using mathematical analysis together with a computational model. This is intimately related to the notion of conditional Markov processes and we introduce the posterior master equation and derive novel approximations to the corresponding infinite-dimensional posterior moment dynamics. We exemplify this state reconstruction approach using both in silico data and single-cell data from two gene expression systems in Saccharomyces cerevisiae, where we reconstruct the dynamic promoter and mRNA states from noisy protein abundance measurements.
Collapse
Affiliation(s)
- Lirong Huang
- Institute of Molecular Systems Biology, D-BIOL, ETH Zurich, Zurich, Switzerland
| | - Loic Pauleve
- Laboratoire de Recherche en Informatique, Université Paris-Sud, Orsay, France
| | - Christoph Zechner
- Department of Biosystems Science and Engineering, ETH Zurich, Zurich, Switzerland
| | - Michael Unger
- Institute of Biochemistry, ETH Zurich, Zurich, Switzerland
| | - Anders S Hansen
- Department of Chemistry and Chemical Biology, Harvard University, Cambridge, MA, USA
| | - Heinz Koeppl
- Department of Electrical Engineering and Information Technology, Technische Universität Darmstadt, Darmstadt, Germany Department of Biology, Technische Universität Darmstadt, Darmstadt, Germany
| |
Collapse
|
23
|
Cao Y, Terebus A, Liang J. ACCURATE CHEMICAL MASTER EQUATION SOLUTION USING MULTI-FINITE BUFFERS. MULTISCALE MODELING & SIMULATION : A SIAM INTERDISCIPLINARY JOURNAL 2016; 14:923-963. [PMID: 27761104 PMCID: PMC5066912 DOI: 10.1137/15m1034180] [Citation(s) in RCA: 23] [Impact Index Per Article: 2.9] [Reference Citation Analysis] [Abstract] [Key Words] [Grants] [Track Full Text] [Subscribe] [Scholar Register] [Indexed: 06/06/2023]
Abstract
The discrete chemical master equation (dCME) provides a fundamental framework for studying stochasticity in mesoscopic networks. Because of the multi-scale nature of many networks where reaction rates have large disparity, directly solving dCMEs is intractable due to the exploding size of the state space. It is important to truncate the state space effectively with quantified errors, so accurate solutions can be computed. It is also important to know if all major probabilistic peaks have been computed. Here we introduce the Accurate CME (ACME) algorithm for obtaining direct solutions to dCMEs. With multi-finite buffers for reducing the state space by O(n!), exact steady-state and time-evolving network probability landscapes can be computed. We further describe a theoretical framework of aggregating microstates into a smaller number of macrostates by decomposing a network into independent aggregated birth and death processes, and give an a priori method for rapidly determining steady-state truncation errors. The maximal sizes of the finite buffers for a given error tolerance can also be pre-computed without costly trial solutions of dCMEs. We show exactly computed probability landscapes of three multi-scale networks, namely, a 6-node toggle switch, 11-node phage-lambda epigenetic circuit, and 16-node MAPK cascade network, the latter two with no known solutions. We also show how probabilities of rare events can be computed from first-passage times, another class of unsolved problems challenging for simulation-based techniques due to large separations in time scales. Overall, the ACME method enables accurate and efficient solutions of the dCME for a large class of networks.
Collapse
|
24
|
Dinh KN, Sidje RB. Understanding the finite state projection and related methods for solving the chemical master equation. Phys Biol 2016; 13:035003. [PMID: 27176781 DOI: 10.1088/1478-3975/13/3/035003] [Citation(s) in RCA: 21] [Impact Index Per Article: 2.6] [Reference Citation Analysis] [Abstract] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 11/12/2022]
Abstract
The finite state projection (FSP) method has enabled us to solve the chemical master equation of some biological models that were considered out of reach not long ago. Since the original FSP method, much effort has gone into transforming it into an adaptive time-stepping algorithm as well as studying its accuracy. Some of the improvements include the multiple time interval FSP, the sliding windows, and most notably the Krylov-FSP approach. Our goal in this tutorial is to give the reader an overview of the current methods that build on the FSP.
Collapse
Affiliation(s)
- Khanh N Dinh
- Department of Mathematics University of Alabama Tuscaloosa, Alabama 35487, USA
| | | |
Collapse
|
25
|
Abstract
A stochastic model of cellular p53 regulation was established in Leenders, and Tuszynski (2013 Front. Oncol. 3 1-16) to study the interactions of p53 with MDM2 proteins, where the stochastic analysis was done using a Monte Carlo approach. We revisit that model here using an alternative scheme, which is to directly solve the chemical master equation (CME) by an adaptive Krylov-based finite state projection method that combines the stochastic simulation algorithm with other computational strategies, namely Krylov approximation techniques to the matrix exponential, divide and conquer, and aggregation. We report numerical results that demonstrate the extend of tackling the CME with this combination of tools.
Collapse
Affiliation(s)
- Huy D Vo
- Department of Mathematics University of Alabama Tuscaloosa, AL 35487, USA
| | | |
Collapse
|
26
|
State Space Truncation with Quantified Errors for Accurate Solutions to Discrete Chemical Master Equation. Bull Math Biol 2016; 78:617-661. [PMID: 27105653 DOI: 10.1007/s11538-016-0149-1] [Citation(s) in RCA: 22] [Impact Index Per Article: 2.8] [Reference Citation Analysis] [Abstract] [Key Words] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Received: 07/01/2015] [Accepted: 02/16/2016] [Indexed: 10/21/2022]
Abstract
The discrete chemical master equation (dCME) provides a general framework for studying stochasticity in mesoscopic reaction networks. Since its direct solution rapidly becomes intractable due to the increasing size of the state space, truncation of the state space is necessary for solving most dCMEs. It is therefore important to assess the consequences of state space truncations so errors can be quantified and minimized. Here we describe a novel method for state space truncation. By partitioning a reaction network into multiple molecular equivalence groups (MEGs), we truncate the state space by limiting the total molecular copy numbers in each MEG. We further describe a theoretical framework for analysis of the truncation error in the steady-state probability landscape using reflecting boundaries. By aggregating the state space based on the usage of a MEG and constructing an aggregated Markov process, we show that the truncation error of a MEG can be asymptotically bounded by the probability of states on the reflecting boundary of the MEG. Furthermore, truncating states of an arbitrary MEG will not undermine the estimated error of truncating any other MEGs. We then provide an overall error estimate for networks with multiple MEGs. To rapidly determine the appropriate size of an arbitrary MEG, we also introduce an a priori method to estimate the upper bound of its truncation error. This a priori estimate can be rapidly computed from reaction rates of the network, without the need of costly trial solutions of the dCME. As examples, we show results of applying our methods to the four stochastic networks of (1) the birth and death model, (2) the single gene expression model, (3) the genetic toggle switch model, and (4) the phage lambda bistable epigenetic switch model. We demonstrate how truncation errors and steady-state probability landscapes can be computed using different sizes of the MEG(s) and how the results validate our theories. Overall, the novel state space truncation and error analysis methods developed here can be used to ensure accurate direct solutions to the dCME for a large number of stochastic networks.
Collapse
|
27
|
Albert J. A Hybrid of the Chemical Master Equation and the Gillespie Algorithm for Efficient Stochastic Simulations of Sub-Networks. PLoS One 2016; 11:e0149909. [PMID: 26930199 PMCID: PMC4773016 DOI: 10.1371/journal.pone.0149909] [Citation(s) in RCA: 9] [Impact Index Per Article: 1.1] [Reference Citation Analysis] [Abstract] [MESH Headings] [Track Full Text] [Download PDF] [Figures] [Journal Information] [Subscribe] [Scholar Register] [Received: 11/16/2015] [Accepted: 02/05/2016] [Indexed: 11/18/2022] Open
Abstract
Modeling stochastic behavior of chemical reaction networks is an important endeavor in many aspects of chemistry and systems biology. The chemical master equation (CME) and the Gillespie algorithm (GA) are the two most fundamental approaches to such modeling; however, each of them has its own limitations: the GA may require long computing times, while the CME may demand unrealistic memory storage capacity. We propose a method that combines the CME and the GA that allows one to simulate stochastically a part of a reaction network. First, a reaction network is divided into two parts. The first part is simulated via the GA, while the solution of the CME for the second part is fed into the GA in order to update its propensities. The advantage of this method is that it avoids the need to solve the CME or stochastically simulate the entire network, which makes it highly efficient. One of its drawbacks, however, is that most of the information about the second part of the network is lost in the process. Therefore, this method is most useful when only partial information about a reaction network is needed. We tested this method against the GA on two systems of interest in biology - the gene switch and the Griffith model of a genetic oscillator—and have shown it to be highly accurate. Comparing this method to four different stochastic algorithms revealed it to be at least an order of magnitude faster than the fastest among them.
Collapse
Affiliation(s)
- Jaroslav Albert
- Applied Physics Research Group, Vrije Universiteit Brussel, Brussels, Belgium
- * E-mail:
| |
Collapse
|
28
|
Approximation of Probabilistic Reachability for Chemical Reaction Networks Using the Linear Noise Approximation. QUANTITATIVE EVALUATION OF SYSTEMS 2016. [DOI: 10.1007/978-3-319-43425-4_5] [Citation(s) in RCA: 10] [Impact Index Per Article: 1.3] [Reference Citation Analysis] [Track Full Text] [Subscribe] [Scholar Register] [Indexed: 12/12/2022]
|
29
|
Kryven I, Röblitz S, Schütte C. Solution of the chemical master equation by radial basis functions approximation with interface tracking. BMC SYSTEMS BIOLOGY 2015; 9:67. [PMID: 26449665 PMCID: PMC4599742 DOI: 10.1186/s12918-015-0210-y] [Citation(s) in RCA: 11] [Impact Index Per Article: 1.2] [Reference Citation Analysis] [Abstract] [Key Words] [MESH Headings] [Track Full Text] [Download PDF] [Figures] [Subscribe] [Scholar Register] [Received: 01/14/2015] [Accepted: 09/11/2015] [Indexed: 11/25/2022]
Abstract
BACKGROUND The chemical master equation is the fundamental equation of stochastic chemical kinetics. This differential-difference equation describes temporal evolution of the probability density function for states of a chemical system. A state of the system, usually encoded as a vector, represents the number of entities or copy numbers of interacting species, which are changing according to a list of possible reactions. It is often the case, especially when the state vector is high-dimensional, that the number of possible states the system may occupy is too large to be handled computationally. One way to get around this problem is to consider only those states that are associated with probabilities that are greater than a certain threshold level. RESULTS We introduce an algorithm that significantly reduces computational resources and is especially powerful when dealing with multi-modal distributions. The algorithm is built according to two key principles. Firstly, when performing time integration, the algorithm keeps track of the subset of states with significant probabilities (essential support). Secondly, the probability distribution that solves the equation is parametrised with a small number of coefficients using collocation on Gaussian radial basis functions. The system of basis functions is chosen in such a way that the solution is approximated only on the essential support instead of the whole state space. DISCUSSION In order to demonstrate the effectiveness of the method, we consider four application examples: a) the self-regulating gene model, b) the 2-dimensional bistable toggle switch, c) a generalisation of the bistable switch to a 3-dimensional tristable problem, and d) a 3-dimensional cell differentiation model that, depending on parameter values, may operate in bistable or tristable modes. In all multidimensional examples the manifold containing the system states with significant probabilities undergoes drastic transformations over time. This fact makes the examples especially challenging for numerical methods. CONCLUSIONS The proposed method is a new numerical approach permitting to approximately solve a wide range of problems that have been hard to tackle until now. A full representation of multi-dimensional distributions is recovered. The method is especially attractive when dealing with models that yield solutions of a complex structure, for instance, featuring multi-stability.
Collapse
Affiliation(s)
- Ivan Kryven
- University of Amsterdam, Science Park 904, Amsterdam, 1098 XH, The Netherlands.
| | - Susanna Röblitz
- Zuse Institute Berlin, Takustrasse 7, Berlin, 14195, Germany.
| | - Christof Schütte
- Freie Universität Berlin, Arnimallee 6, Berlin, 14195, Germany.
- Zuse Institute Berlin, Takustrasse 7, Berlin, 14195, Germany.
| |
Collapse
|
30
|
Solving the chemical master equation by a fast adaptive finite state projection based on the stochastic simulation algorithm. Math Biosci 2015; 269:10-6. [PMID: 26319118 DOI: 10.1016/j.mbs.2015.08.010] [Citation(s) in RCA: 23] [Impact Index Per Article: 2.6] [Reference Citation Analysis] [Abstract] [Key Words] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Received: 06/23/2015] [Revised: 08/20/2015] [Accepted: 08/20/2015] [Indexed: 11/27/2022]
Abstract
The mathematical framework of the chemical master equation (CME) uses a Markov chain to model the biochemical reactions that are taking place within a biological cell. Computing the transient probability distribution of this Markov chain allows us to track the composition of molecules inside the cell over time, with important practical applications in a number of areas such as molecular biology or medicine. However the CME is typically difficult to solve, since the state space involved can be very large or even countably infinite. We present a novel way of using the stochastic simulation algorithm (SSA) to reduce the size of the finite state projection (FSP) method. Numerical experiments that demonstrate the effectiveness of the reduction are included.
Collapse
|
31
|
Kundu S. Co-operative intermolecular kinetics of 2-oxoglutarate dependent dioxygenases may be essential for system-level regulation of plant cell physiology. FRONTIERS IN PLANT SCIENCE 2015; 6:489. [PMID: 26236316 PMCID: PMC4502536 DOI: 10.3389/fpls.2015.00489] [Citation(s) in RCA: 3] [Impact Index Per Article: 0.3] [Reference Citation Analysis] [Abstract] [Key Words] [Track Full Text] [Subscribe] [Scholar Register] [Received: 01/22/2015] [Accepted: 06/19/2015] [Indexed: 05/24/2023]
Abstract
Can the stimulus-driven synergistic association of 2-oxoglutarate dependent dioxygenases be influenced by the kinetic parameters of binding and catalysis?In this manuscript, I posit that these indices are necessary and specific for a particular stimulus, and are key determinants of a dynamic clustering that may function to mitigate the effects of this trigger. The protein(s)/sequence(s) that comprise this group are representative of all major kingdoms of life, and catalyze a generic hydroxylation, which is, in most cases accompanied by a specialized conversion of the substrate molecule. Iron is an essential co-factor for this transformation and the response to waning levels is systemic, and mandates the simultaneous participation of molecular sensors, transporters, and signal transducers. Here, I present a proof-of-concept model, that an evolving molecular network of 2OG-dependent enzymes can maintain iron homeostasis in the cytosol of root hair cells of members of the family Gramineae by actuating a non-reductive compensatory chelation by the phytosiderophores. Regression models of empirically available kinetic data (iron and alpha-ketoglutarate) were formulated, analyzed, and compared. The results, when viewed in context of the superfamily responding as a unit, suggest that members can indeed, work together to accomplish system-level function. This is achieved by the establishment of transient metabolic conduits, wherein the flux is dictated by kinetic compatibility of the participating enzymes. The approach adopted, i.e., predictive mathematical modeling, is integral to the hypothesis-driven acquisition of experimental data points and, in association with suitable visualization aids may be utilized for exploring complex plant biochemical systems.
Collapse
Affiliation(s)
- Siddhartha Kundu
- *Correspondence: Siddhartha Kundu, School of Computational and Integrative Sciences, Jawaharlal Nehru University, New Mehrauli Road, New Delhi 110067, India ;
| |
Collapse
|
32
|
Bronstein L, Zechner C, Koeppl H. Bayesian inference of reaction kinetics from single-cell recordings across a heterogeneous cell population. Methods 2015; 85:22-35. [PMID: 25986935 DOI: 10.1016/j.ymeth.2015.05.012] [Citation(s) in RCA: 14] [Impact Index Per Article: 1.6] [Reference Citation Analysis] [Abstract] [Key Words] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Received: 02/09/2015] [Revised: 04/19/2015] [Accepted: 05/10/2015] [Indexed: 11/30/2022] Open
Abstract
Single-cell experimental techniques provide informative data to help uncover dynamical processes inside a cell. Making full use of such data requires dedicated computational methods to estimate biophysical process parameters and states in a model-based manner. In particular, the treatment of heterogeneity or cell-to-cell variability deserves special attention. The present article provides an introduction to one particular class of algorithms which employ marginalization in order to take heterogeneity into account. An overview of alternative approaches is provided for comparison. We treat two frequently encountered scenarios in single-cell experiments, namely, single-cell trajectory data and single-cell distribution data.
Collapse
Affiliation(s)
- L Bronstein
- Department of Electrical Engineering and Information Technology, Technische Universität Darmstadt, Darmstadt, Germany
| | - C Zechner
- Department of Biosystems Sciences and Engineering, ETH Zürich, Basel, Switzerland
| | - H Koeppl
- Department of Electrical Engineering and Information Technology, Technische Universität Darmstadt, Darmstadt, Germany.
| |
Collapse
|
33
|
Albert J, Rooman M. Probability distributions for multimeric systems. J Math Biol 2015; 72:157-69. [PMID: 25840518 DOI: 10.1007/s00285-015-0877-0] [Citation(s) in RCA: 6] [Impact Index Per Article: 0.7] [Reference Citation Analysis] [Abstract] [Key Words] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Received: 03/24/2014] [Revised: 03/06/2015] [Indexed: 11/24/2022]
Abstract
We propose a fast and accurate method of obtaining the equilibrium mono-modal joint probability distributions for multimeric systems. The method necessitates only two assumptions: the copy number of all species of molecule may be treated as continuous; and, the probability density functions (pdf) are well-approximated by multivariate skew normal distributions (MSND). Starting from the master equation, we convert the problem into a set of equations for the statistical moments which are then expressed in terms of the parameters intrinsic to the MSND. Using an optimization package on Mathematica, we minimize a Euclidian distance function comprising of a sum of the squared difference between the left and the right hand sides of these equations. Comparison of results obtained via our method with those rendered by the Gillespie algorithm demonstrates our method to be highly accurate as well as efficient.
Collapse
Affiliation(s)
- Jaroslav Albert
- BioModeling, BioInformatics & Bioprocesses, Université Libre de Bruxelles, Brussels, Belgium.
| | - Marianne Rooman
- BioModeling, BioInformatics & Bioprocesses, Université Libre de Bruxelles, Brussels, Belgium
| |
Collapse
|
34
|
Stochastic Analysis of Chemical Reaction Networks Using Linear Noise Approximation. COMPUTATIONAL METHODS IN SYSTEMS BIOLOGY 2015. [DOI: 10.1007/978-3-319-23401-4_7] [Citation(s) in RCA: 9] [Impact Index Per Article: 1.0] [Reference Citation Analysis] [Track Full Text] [Subscribe] [Scholar Register] [Indexed: 01/12/2023]
|
35
|
Adaptive Moment Closure for Parameter Inference of Biochemical Reaction Networks. COMPUTATIONAL METHODS IN SYSTEMS BIOLOGY 2015. [DOI: 10.1007/978-3-319-23401-4_8] [Citation(s) in RCA: 4] [Impact Index Per Article: 0.4] [Reference Citation Analysis] [Track Full Text] [Subscribe] [Scholar Register] [Indexed: 01/01/2023]
|
36
|
Liang J, Cao Y, Gürsoy G, Naveed H, Terebus A, Zhao J. Multiscale Modeling of Cellular Epigenetic States: Stochasticity in Molecular Networks, Chromatin Folding in Cell Nuclei, and Tissue Pattern Formation of Cells. Crit Rev Biomed Eng 2015; 43:323-46. [PMID: 27480462 PMCID: PMC4976639 DOI: 10.1615/critrevbiomedeng.2016016559] [Citation(s) in RCA: 3] [Impact Index Per Article: 0.3] [Reference Citation Analysis] [Abstract] [Key Words] [MESH Headings] [Grants] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 11/13/2022]
Abstract
Genome sequences provide the overall genetic blueprint of cells, but cells possessing the same genome can exhibit diverse phenotypes. There is a multitude of mechanisms controlling cellular epigenetic states and that dictate the behavior of cells. Among these, networks of interacting molecules, often under stochastic control, depending on the specific wirings of molecular components and the physiological conditions, can have a different landscape of cellular states. In addition, chromosome folding in three-dimensional space provides another important control mechanism for selective activation and repression of gene expression. Fully differentiated cells with different properties grow, divide, and interact through mechanical forces and communicate through signal transduction, resulting in the formation of complex tissue patterns. Developing quantitative models to study these multi-scale phenomena and to identify opportunities for improving human health requires development of theoretical models, algorithms, and computational tools. Here we review recent progress made in these important directions.
Collapse
Affiliation(s)
- Jie Liang
- Program in Bioinformatics, Department of Bioengineering, University of Illinois at Chicago, IL, 60612, USA
| | - Youfang Cao
- Theoretical Biology and Biophysics (T-6) and Center for Nonlinear Studies (CNLS), Los Alamos National Laboratory, Los Alamos, NM, 87545, USA
| | - Gamze Gürsoy
- Program in Bioinformatics, Department of Bioengineering, University of Illinois at Chicago, IL, 60612, USA
| | - Hammad Naveed
- Toyota Technological Institute at Chicago, 6045 S. Kenwood Ave. Chicago, Illinois 60637, USA
| | - Anna Terebus
- Program in Bioinformatics, Department of Bioengineering, University of Illinois at Chicago, IL, 60612, USA
| | - Jieling Zhao
- Program in Bioinformatics, Department of Bioengineering, University of Illinois at Chicago, IL, 60612, USA
| |
Collapse
|
37
|
Nobile MS, Cazzaniga P, Besozzi D, Pescini D, Mauri G. cuTauLeaping: a GPU-powered tau-leaping stochastic simulator for massive parallel analyses of biological systems. PLoS One 2014; 9:e91963. [PMID: 24663957 PMCID: PMC3963881 DOI: 10.1371/journal.pone.0091963] [Citation(s) in RCA: 26] [Impact Index Per Article: 2.6] [Reference Citation Analysis] [Abstract] [MESH Headings] [Download PDF] [Figures] [Journal Information] [Subscribe] [Scholar Register] [Received: 10/24/2013] [Accepted: 02/17/2014] [Indexed: 12/03/2022] Open
Abstract
Tau-leaping is a stochastic simulation algorithm that efficiently reconstructs the temporal evolution of biological systems, modeled according to the stochastic formulation of chemical kinetics. The analysis of dynamical properties of these systems in physiological and perturbed conditions usually requires the execution of a large number of simulations, leading to high computational costs. Since each simulation can be executed independently from the others, a massive parallelization of tau-leaping can bring to relevant reductions of the overall running time. The emerging field of General Purpose Graphic Processing Units (GPGPU) provides power-efficient high-performance computing at a relatively low cost. In this work we introduce cuTauLeaping, a stochastic simulator of biological systems that makes use of GPGPU computing to execute multiple parallel tau-leaping simulations, by fully exploiting the Nvidia's Fermi GPU architecture. We show how a considerable computational speedup is achieved on GPU by partitioning the execution of tau-leaping into multiple separated phases, and we describe how to avoid some implementation pitfalls related to the scarcity of memory resources on the GPU streaming multiprocessors. Our results show that cuTauLeaping largely outperforms the CPU-based tau-leaping implementation when the number of parallel simulations increases, with a break-even directly depending on the size of the biological system and on the complexity of its emergent dynamics. In particular, cuTauLeaping is exploited to investigate the probability distribution of bistable states in the Schlögl model, and to carry out a bidimensional parameter sweep analysis to study the oscillatory regimes in the Ras/cAMP/PKA pathway in S. cerevisiae.
Collapse
Affiliation(s)
- Marco S. Nobile
- Dipartimento di Informatica, Sistemistica e Comunicazione, Università degli Studi di Milano-Bicocca, Milano, Italy
- SYSBIO Centre for Systems Biology, Milano, Italy
- * E-mail: (MSN); (PC)
| | - Paolo Cazzaniga
- Dipartimento di Scienze Umane e Sociali, Università degli Studi di Bergamo, Bergamo, Italy
- Istituto di Analisi dei Sistemi ed Informatica “Antonio Ruberti”, Consiglio Nazionale delle Ricerche, Roma, Italy
- SYSBIO Centre for Systems Biology, Milano, Italy
- * E-mail: (MSN); (PC)
| | - Daniela Besozzi
- Dipartimento di Informatica, Università degli Studi di Milano, Milano, Italy
- Istituto di Analisi dei Sistemi ed Informatica “Antonio Ruberti”, Consiglio Nazionale delle Ricerche, Roma, Italy
- SYSBIO Centre for Systems Biology, Milano, Italy
| | - Dario Pescini
- Dipartimento di Statistica e Metodi Quantitativi, Università degli Studi di Milano-Bicocca, Milano, Italy
- SYSBIO Centre for Systems Biology, Milano, Italy
| | - Giancarlo Mauri
- Dipartimento di Informatica, Sistemistica e Comunicazione, Università degli Studi di Milano-Bicocca, Milano, Italy
- SYSBIO Centre for Systems Biology, Milano, Italy
| |
Collapse
|
38
|
Wang D, Zhang L, Nie Q. Array-representation Integration Factor Method for High-dimensional Systems. JOURNAL OF COMPUTATIONAL PHYSICS 2014; 258:10.1016/j.jcp.2013.11.002. [PMID: 24415797 PMCID: PMC3886925 DOI: 10.1016/j.jcp.2013.11.002] [Citation(s) in RCA: 2] [Impact Index Per Article: 0.2] [Reference Citation Analysis] [Abstract] [Key Words] [Grants] [Track Full Text] [Subscribe] [Scholar Register] [Indexed: 06/03/2023]
Abstract
High order spatial derivatives and stiff reactions often introduce severe temporal stability constraints on the time step in numerical methods. Implicit integration method (IIF) method, which treats diffusion exactly and reaction implicitly, provides excellent stability properties with good efficiency by decoupling the treatment of reactions and diffusions. One major challenge for IIF is storage and calculation of the potential dense exponential matrices of the sparse discretization matrices resulted from the linear differential operators. Motivated by a compact representation for IIF (cIIF) for Laplacian operators in two and three dimensions, we introduce an array-representation technique for efficient handling of exponential matrices from a general linear differential operator that may include cross-derivatives and non-constant diffusion coefficients. In this approach, exponentials are only needed for matrices of small size that depend only on the order of derivatives and number of discretization points, independent of the size of spatial dimensions. This method is particularly advantageous for high dimensional systems, and it can be easily incorporated with IIF to preserve the excellent stability of IIF. Implementation and direct simulations of the array-representation compact IIF (AcIIF) on systems, such as Fokker-Planck equations in three and four dimensions and chemical master equations, in addition to reaction-diffusion equations, show efficiency, accuracy, and robustness of the new method. Such array-presentation based on methods may have broad applications for simulating other complex systems involving high-dimensional data.
Collapse
Affiliation(s)
- Dongyong Wang
- Department of Mathematics, University of California, Irvine, CA 92697, USA
| | - Lei Zhang
- Beijing International Center for Mathematical Research, Peking University, Beijing 100871, China
| | - Qing Nie
- Department of Mathematics, University of California, Irvine, CA 92697, USA
| |
Collapse
|
39
|
Moment-based inference predicts bimodality in transient gene expression. Proc Natl Acad Sci U S A 2012; 109:8340-5. [PMID: 22566653 DOI: 10.1073/pnas.1200161109] [Citation(s) in RCA: 173] [Impact Index Per Article: 14.4] [Reference Citation Analysis] [Abstract] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 11/18/2022] Open
Abstract
Recent computational studies indicate that the molecular noise of a cellular process may be a rich source of information about process dynamics and parameters. However, accessing this source requires stochastic models that are usually difficult to analyze. Therefore, parameter estimation for stochastic systems using distribution measurements, as provided for instance by flow cytometry, currently remains limited to very small and simple systems. Here we propose a new method that makes use of low-order moments of the measured distribution and thereby keeps the essential parts of the provided information, while still staying applicable to systems of realistic size. We demonstrate how cell-to-cell variability can be incorporated into the analysis obviating the need for the ubiquitous assumption that the measurements stem from a homogeneous cell population. We demonstrate the method for a simple example of gene expression using synthetic data generated by stochastic simulation. Subsequently, we use time-lapsed flow cytometry data for the osmo-stress induced transcriptional response in budding yeast to calibrate a stochastic model, which is then used as a basis for predictions. Our results show that measurements of the mean and the variance can be enough to determine the model parameters, even if the measured distributions are not well-characterized by low-order moments only--e.g., if they are bimodal.
Collapse
|
40
|
Lakin MR, Parker D, Cardelli L, Kwiatkowska M, Phillips A. Design and analysis of DNA strand displacement devices using probabilistic model checking. J R Soc Interface 2012; 9:1470-85. [PMID: 22219398 PMCID: PMC3367817 DOI: 10.1098/rsif.2011.0800] [Citation(s) in RCA: 61] [Impact Index Per Article: 5.1] [Reference Citation Analysis] [Abstract] [Track Full Text] [Download PDF] [Figures] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 11/17/2022] Open
Abstract
Designing correct, robust DNA devices is difficult because of the many possibilities for unwanted interference between molecules in the system. DNA strand displacement has been proposed as a design paradigm for DNA devices, and the DNA strand displacement (DSD) programming language has been developed as a means of formally programming and analysing these devices to check for unwanted interference. We demonstrate, for the first time, the use of probabilistic verification techniques to analyse the correctness, reliability and performance of DNA devices during the design phase. We use the probabilistic model checker prism, in combination with the DSD language, to design and debug DNA strand displacement components and to investigate their kinetics. We show how our techniques can be used to identify design flaws and to evaluate the merits of contrasting design decisions, even on devices comprising relatively few inputs. We then demonstrate the use of these components to construct a DNA strand displacement device for approximate majority voting. Finally, we discuss some of the challenges and possible directions for applying these methods to more complex designs.
Collapse
Affiliation(s)
- Matthew R Lakin
- Microsoft Research, 7 JJ Thomson Avenue, Cambridge CB3 0FB, UK
| | | | | | | | | |
Collapse
|
41
|
Ruess J, Milias-Argeitis A, Summers S, Lygeros J. Moment estimation for chemically reacting systems by extended Kalman filtering. J Chem Phys 2011; 135:165102. [DOI: 10.1063/1.3654135] [Citation(s) in RCA: 27] [Impact Index Per Article: 2.1] [Reference Citation Analysis] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 11/15/2022] Open
|
42
|
Giampieri E, Remondini D, de Oliveira L, Castellani G, Lió P. Stochastic analysis of a miRNA–protein toggle switch. MOLECULAR BIOSYSTEMS 2011; 7:2796-803. [DOI: 10.1039/c1mb05086a] [Citation(s) in RCA: 16] [Impact Index Per Article: 1.2] [Reference Citation Analysis] [Track Full Text] [Subscribe] [Scholar Register] [Indexed: 12/30/2022]
|