Cargando…

Optimal enumeration of state space of finitely buffered stochastic molecular networks and exact computation of steady state landscape probability

BACKGROUND: Stochasticity plays important roles in many molecular networks when molecular concentrations are in the range of 0.1 μM to 10nM (about 100 to 10 copies in a cell). The chemical master equation provides a fundamental framework for studying these networks, and the time-varying landscape pr...

Descripción completa

Detalles Bibliográficos
Autores principales: Cao, Youfang, Liang, Jie
Formato: Texto
Lenguaje:English
Publicado: BioMed Central 2008
Materias:
Acceso en línea:https://www.ncbi.nlm.nih.gov/pmc/articles/PMC2375859/
https://www.ncbi.nlm.nih.gov/pubmed/18373871
http://dx.doi.org/10.1186/1752-0509-2-30
_version_ 1782154660798267392
author Cao, Youfang
Liang, Jie
author_facet Cao, Youfang
Liang, Jie
author_sort Cao, Youfang
collection PubMed
description BACKGROUND: Stochasticity plays important roles in many molecular networks when molecular concentrations are in the range of 0.1 μM to 10nM (about 100 to 10 copies in a cell). The chemical master equation provides a fundamental framework for studying these networks, and the time-varying landscape probability distribution over the full microstates, i.e., the combination of copy numbers of molecular species, provide a full characterization of the network dynamics. A complete characterization of the space of the microstates is a prerequisite for obtaining the full landscape probability distribution of a network. However, there are neither closed-form solutions nor algorithms fully describing all microstates for a given molecular network. RESULTS: We have developed an algorithm that can exhaustively enumerate the microstates of a molecular network of small copy numbers under the condition that the net gain in newly synthesized molecules is smaller than a predefined limit. We also describe a simple method for computing the exact mean or steady state landscape probability distribution over microstates. We show how the full landscape probability for the gene networks of the self-regulating gene and the toggle-switch in the steady state can be fully characterized. We also give an example using the MAPK cascade network. Data and server will be available at URL: . CONCLUSION: Our algorithm works for networks of small copy numbers buffered with a finite copy number of net molecules that can be synthesized, regardless of the reaction stoichiometry, and is optimal in both storage and time complexity. The algorithm can also be used to calculate the rates of all transitions between microstates from given reactions and reaction rates. The buffer size is limited by the available memory or disk storage. Our algorithm is applicable to a class of biological networks when the copy numbers of molecules are small and the network is closed, or the network is open but the net gain in newly synthesized molecules does not exceed a predefined buffer capacity. For these networks, our method allows full stochastic characterization of the mean landscape probability distribution, and the steady state when it exists.
format Text
id pubmed-2375859
institution National Center for Biotechnology Information
language English
publishDate 2008
publisher BioMed Central
record_format MEDLINE/PubMed
spelling pubmed-23758592008-05-12 Optimal enumeration of state space of finitely buffered stochastic molecular networks and exact computation of steady state landscape probability Cao, Youfang Liang, Jie BMC Syst Biol Research Article BACKGROUND: Stochasticity plays important roles in many molecular networks when molecular concentrations are in the range of 0.1 μM to 10nM (about 100 to 10 copies in a cell). The chemical master equation provides a fundamental framework for studying these networks, and the time-varying landscape probability distribution over the full microstates, i.e., the combination of copy numbers of molecular species, provide a full characterization of the network dynamics. A complete characterization of the space of the microstates is a prerequisite for obtaining the full landscape probability distribution of a network. However, there are neither closed-form solutions nor algorithms fully describing all microstates for a given molecular network. RESULTS: We have developed an algorithm that can exhaustively enumerate the microstates of a molecular network of small copy numbers under the condition that the net gain in newly synthesized molecules is smaller than a predefined limit. We also describe a simple method for computing the exact mean or steady state landscape probability distribution over microstates. We show how the full landscape probability for the gene networks of the self-regulating gene and the toggle-switch in the steady state can be fully characterized. We also give an example using the MAPK cascade network. Data and server will be available at URL: . CONCLUSION: Our algorithm works for networks of small copy numbers buffered with a finite copy number of net molecules that can be synthesized, regardless of the reaction stoichiometry, and is optimal in both storage and time complexity. The algorithm can also be used to calculate the rates of all transitions between microstates from given reactions and reaction rates. The buffer size is limited by the available memory or disk storage. Our algorithm is applicable to a class of biological networks when the copy numbers of molecules are small and the network is closed, or the network is open but the net gain in newly synthesized molecules does not exceed a predefined buffer capacity. For these networks, our method allows full stochastic characterization of the mean landscape probability distribution, and the steady state when it exists. BioMed Central 2008-03-29 /pmc/articles/PMC2375859/ /pubmed/18373871 http://dx.doi.org/10.1186/1752-0509-2-30 Text en Copyright © 2008 Cao and Liang; licensee BioMed Central Ltd. http://creativecommons.org/licenses/by/2.0 This is an Open Access article distributed under the terms of the Creative Commons Attribution License ( (http://creativecommons.org/licenses/by/2.0) ), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
spellingShingle Research Article
Cao, Youfang
Liang, Jie
Optimal enumeration of state space of finitely buffered stochastic molecular networks and exact computation of steady state landscape probability
title Optimal enumeration of state space of finitely buffered stochastic molecular networks and exact computation of steady state landscape probability
title_full Optimal enumeration of state space of finitely buffered stochastic molecular networks and exact computation of steady state landscape probability
title_fullStr Optimal enumeration of state space of finitely buffered stochastic molecular networks and exact computation of steady state landscape probability
title_full_unstemmed Optimal enumeration of state space of finitely buffered stochastic molecular networks and exact computation of steady state landscape probability
title_short Optimal enumeration of state space of finitely buffered stochastic molecular networks and exact computation of steady state landscape probability
title_sort optimal enumeration of state space of finitely buffered stochastic molecular networks and exact computation of steady state landscape probability
topic Research Article
url https://www.ncbi.nlm.nih.gov/pmc/articles/PMC2375859/
https://www.ncbi.nlm.nih.gov/pubmed/18373871
http://dx.doi.org/10.1186/1752-0509-2-30
work_keys_str_mv AT caoyoufang optimalenumerationofstatespaceoffinitelybufferedstochasticmolecularnetworksandexactcomputationofsteadystatelandscapeprobability
AT liangjie optimalenumerationofstatespaceoffinitelybufferedstochasticmolecularnetworksandexactcomputationofsteadystatelandscapeprobability