17
views
0
recommends
+1 Recommend
0 collections
    0
    shares
      • Record: found
      • Abstract: found
      • Article: found
      Is Open Access

      State space truncation with quantified errors for accurate solutions to discrete Chemical Master Equation

      Preprint
      , ,

      Read this article at

      Bookmark
          There is no author summary for this article yet. Authors can add summaries to their articles on ScienceOpen to make them more accessible to a non-specialist audience.

          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 (MEG), 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 error estimate for networks with multiple MEGs. To rapidly determine the appropriate size of an arbitrary MEG, we introduce an a priori method to estimate the upper bound of its truncation error, which can be rapidly computed from reaction rates, without costly trial solutions of the dCME. We show results of applying our methods to four stochastic networks. 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 out 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 class of stochastic networks.

          Related collections

          Most cited references30

          • Record: found
          • Abstract: not found
          • Article: not found

          The chemical Langevin equation

            Bookmark
            • Record: found
            • Abstract: found
            • Article: not found

            The finite state projection algorithm for the solution of the chemical master equation.

            This article introduces the finite state projection (FSP) method for use in the stochastic analysis of chemically reacting systems. One can describe the chemical populations of such systems with probability density vectors that evolve according to a set of linear ordinary differential equations known as the chemical master equation (CME). Unlike Monte Carlo methods such as the stochastic simulation algorithm (SSA) or tau leaping, the FSP directly solves or approximates the solution of the CME. If the CME describes a system that has a finite number of distinct population vectors, the FSP method provides an exact analytical solution. When an infinite or extremely large number of population variations is possible, the state space can be truncated, and the FSP method provides a certificate of accuracy for how closely the truncated space approximation matches the true solution. The proposed FSP algorithm systematically increases the projection space in order to meet prespecified tolerance in the total probability density error. For any system in which a sufficiently accurate FSP exists, the FSP algorithm is shown to converge in a finite number of steps. The FSP is utilized to solve two examples taken from the field of systems biology, and comparisons are made between the FSP, the SSA, and tau leaping algorithms. In both examples, the FSP outperforms the SSA in terms of accuracy as well as computational efficiency. Furthermore, due to very small molecular counts in these particular examples, the FSP also performs far more effectively than tau leaping methods.
              Bookmark
              • Record: found
              • Abstract: found
              • Article: not found

              It's a noisy business! Genetic regulation at the nanomolar scale.

              Many molecules that control genetic regulatory circuits act at extremely low intracellular concentrations. Resultant fluctuations (noise) in reaction rates cause large random variation in rates of development, morphology and the instantaneous concentration of each molecular species in each cell. To achieve regulatory reliability in spite of this noise, cells use redundancy in genes as well as redundancy and extensive feedback in regulatory pathways. However, some regulatory mechanisms exploit this noise to randomize outcomes where variability is advantageous.
                Bookmark

                Author and article information

                Journal
                25 July 2017
                Article
                10.1007/s11538-016-0149-1
                1707.08236
                573aa933-dd1a-484e-a2bb-78d3dd748b27

                http://creativecommons.org/licenses/by/4.0/

                History
                Custom metadata
                Bulletin of Mathematical Biology. 78 (2016) 617-661
                41 pages, 6 figures
                q-bio.QM

                Comments

                Comment on this article