Anna Terebus
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Anna Terebus has a total of 3 co-authors. Here are the top co-authors by number of shared publications:
- Jie Liang
University of Illinois at Chicago
2 shared publications - Youfang Cao
Los Alamos National Laboratory
1 shared publication - Youfang Cao
Shanghai Jiao Tong University
1 shared publication
Latest Publications
- 22 April 2016
- Published by Springer Nature in Bulletin of Mathematical Biology
- Vol. 78 (4) , 617-661
State Space Truncation with Quantified Errors for Accurate Solutions to Discrete Chemical Master Equation
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.
- 22 April 2016
- Published by Springer Nature in Bulletin of Mathematical Biology
- Vol. 78 (4) , 617-661
State Space Truncation with Quantified Errors for Accurate Solutions to Discrete Chemical Master Equation
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.
- 1 August 2014
- Published by Institute of Electrical and Electronics Engineers (IEEE) in 2018 40th Annual International Conference of the IEEE Engineering in Medicine and Biology Society (EMBC)
- Vol. 2014 (1094687X) , 5228-5231
Exact computation of probability landscape of stochastic networks of Single Input and Coupled Toggle Switch Modules
Gene regulatory networks depict the interactions between genes, proteins, and other components of the cell. These interactions often are stochastic that can influence behavior of the cells. Discrete Chemical Master Equation (dCME) provides a general framework for understanding the stochastic nature of these networks. However solving dCME is challenging due to the enormous state space, one effective approach is to study the behavior of individual modules of the stochastic network. Here we used the finite buffer dCME method and directly calculated the exact steady state probability landscape for the two stochastic networks of Single Input and Coupled Toggle Switch Modules. The first example is a switch network consisting of three genes, and the second example is a double switching network consisting of four coupled genes. Our results show complex switching behavior of these networks can be quantified.
- 1 August 2014
- Published by Institute of Electrical and Electronics Engineers (IEEE) in 2018 40th Annual International Conference of the IEEE Engineering in Medicine and Biology Society (EMBC)
- Vol. 2014 (1094687X) , 5228-5231
Exact computation of probability landscape of stochastic networks of Single Input and Coupled Toggle Switch Modules
Gene regulatory networks depict the interactions between genes, proteins, and other components of the cell. These interactions often are stochastic that can influence behavior of the cells. Discrete Chemical Master Equation (dCME) provides a general framework for understanding the stochastic nature of these networks. However solving dCME is challenging due to the enormous state space, one effective approach is to study the behavior of individual modules of the stochastic network. Here we used the finite buffer dCME method and directly calculated the exact steady state probability landscape for the two stochastic networks of Single Input and Coupled Toggle Switch Modules. The first example is a switch network consisting of three genes, and the second example is a double switching network consisting of four coupled genes. Our results show complex switching behavior of these networks can be quantified.