Informacja

Drogi użytkowniku, aplikacja do prawidłowego działania wymaga obsługi JavaScript. Proszę włącz obsługę JavaScript w Twojej przeglądarce.

Tytuł pozycji:

Exact solving and sensitivity analysis of stochastic continuous time Boolean models.

Tytuł:
Exact solving and sensitivity analysis of stochastic continuous time Boolean models.
Autorzy:
Koltai M; Institut Curie, PSL Research University, Paris, F-75005, France. .; INSERM, U900, Paris, F-75005, France. .; CBIO-Centre for Computational Biology, MINES ParisTech, PSL Research University, Paris, F-75006, France. .
Noel V; Institut Curie, PSL Research University, Paris, F-75005, France.; INSERM, U900, Paris, F-75005, France.; CBIO-Centre for Computational Biology, MINES ParisTech, PSL Research University, Paris, F-75006, France.
Zinovyev A; Institut Curie, PSL Research University, Paris, F-75005, France.; INSERM, U900, Paris, F-75005, France.; CBIO-Centre for Computational Biology, MINES ParisTech, PSL Research University, Paris, F-75006, France.
Calzone L; Institut Curie, PSL Research University, Paris, F-75005, France.; INSERM, U900, Paris, F-75005, France.; CBIO-Centre for Computational Biology, MINES ParisTech, PSL Research University, Paris, F-75006, France.
Barillot E; Institut Curie, PSL Research University, Paris, F-75005, France.; INSERM, U900, Paris, F-75005, France.; CBIO-Centre for Computational Biology, MINES ParisTech, PSL Research University, Paris, F-75006, France.
Źródło:
BMC bioinformatics [BMC Bioinformatics] 2020 Jun 11; Vol. 21 (1), pp. 241. Date of Electronic Publication: 2020 Jun 11.
Typ publikacji:
Journal Article
Język:
English
Imprint Name(s):
Original Publication: [London] : BioMed Central, 2000-
MeSH Terms:
Models, Biological*
Monte Carlo Method*
Stochastic Processes*
References:
J Theor Biol. 1974 Mar;44(1):167-90. (PMID: 4595774)
Nat Rev Genet. 2015 Mar;16(3):146-58. (PMID: 25645874)
Integr Biol (Camb). 2012 Nov;4(11):1323-37. (PMID: 23072820)
Bioinformatics. 2017 Jul 15;33(14):2226-2228. (PMID: 28881959)
Mol Syst Biol. 2013;9:673. (PMID: 23752269)
BMC Syst Biol. 2008 Oct 14;2:86. (PMID: 18854041)
Bioinformatics. 2002 Feb;18(2):261-74. (PMID: 11847074)
Bioinformatics. 2006 Oct 15;22(20):2539-46. (PMID: 16895923)
Bioinformatics. 2016 Sep 1;32(17):i772-i780. (PMID: 27587700)
IET Syst Biol. 2011 Nov;5(6):336-6. (PMID: 22129029)
Bioinformatics. 2010 May 15;26(10):1378-80. (PMID: 20378558)
Bioinformatics. 2007 Jun 15;23(12):1511-8. (PMID: 17463027)
BMC Syst Biol. 2012 Aug 29;6:116. (PMID: 22932419)
Oncotarget. 2016 Jul 12;7(28):43220-43238. (PMID: 27281612)
Chaos. 2013 Jun;23(2):025114. (PMID: 23822512)
Biosystems. 2006 May;84(2):91-100. (PMID: 16434137)
Biochemistry. 2010 Apr 20;49(15):3216-24. (PMID: 20225868)
PLoS Comput Biol. 2015 Nov 03;11(11):e1004571. (PMID: 26528548)
Bioinformatics. 2018 Dec 1;34(23):4079-4086. (PMID: 29931053)
PLoS Comput Biol. 2009 Apr;5(4):e1000340. (PMID: 19343194)
PLoS Comput Biol. 2017 Jan 23;13(1):e1005331. (PMID: 28114351)
BMC Syst Biol. 2009 Jan 01;3:1. (PMID: 19118495)
Front Physiol. 2018 Jun 19;9:646. (PMID: 29971008)
Bull Math Biol. 2013 Nov;75(11):2118-49. (PMID: 24018536)
Nature. 1969 Oct 11;224(5215):177-8. (PMID: 5343519)
J Theor Biol. 1969 Mar;22(3):437-67. (PMID: 5803332)
Front Physiol. 2019 Jan 24;9:1965. (PMID: 30733688)
PLoS One. 2012;7(5):e36321. (PMID: 22606254)
Cancer Converg. 2017;1(1):5. (PMID: 29623959)
Int J Data Min Bioinform. 2007;1(3):217-40. (PMID: 18399072)
Cell Commun Signal. 2013 Jul 01;11:46. (PMID: 23815817)
Contributed Indexing:
Keywords: Asynchronous updating; Boolean modeling; Continuous time Markov chain; Exact method; Steady state solution; Stochastic model
Entry Date(s):
Date Created: 20200613 Date Completed: 20200715 Latest Revision: 20200715
Update Code:
20240104
PubMed Central ID:
PMC7291460
DOI:
10.1186/s12859-020-03548-9
PMID:
32527218
Czasopismo naukowe
Background: Solutions to stochastic Boolean models are usually estimated by Monte Carlo simulations, but as the state space of these models can be enormous, there is an inherent uncertainty about the accuracy of Monte Carlo estimates and whether simulations have reached all attractors. Moreover, these models have timescale parameters (transition rates) that the probability values of stationary solutions depend on in complex ways, raising the necessity of parameter sensitivity analysis. We address these two issues by an exact calculation method for this class of models.
Results: We show that the stationary probability values of the attractors of stochastic (asynchronous) continuous time Boolean models can be exactly calculated. The calculation does not require Monte Carlo simulations, instead it uses graph theoretical and matrix calculation methods previously applied in the context of chemical kinetics. In this version of the asynchronous updating framework the states of a logical model define a continuous time Markov chain and for a given initial condition the stationary solution is fully defined by the right and left nullspace of the master equation's kinetic matrix. We use topological sorting of the state transition graph and the dependencies between the nullspaces and the kinetic matrix to derive the stationary solution without simulations. We apply this calculation to several published Boolean models to analyze the under-explored question of the effect of transition rates on the stationary solutions and show they can be sensitive to parameter changes. The analysis distinguishes processes robust or, alternatively, sensitive to parameter values, providing both methodological and biological insights.
Conclusion: Up to an intermediate size (the biggest model analyzed is 23 nodes) stochastic Boolean models can be efficiently solved by an exact matrix method, without using Monte Carlo simulations. Sensitivity analysis with respect to the model's timescale parameters often reveals a small subset of all parameters that primarily determine the stationary probability of attractor states.
Zaloguj się, aby uzyskać dostęp do pełnego tekstu.

Ta witryna wykorzystuje pliki cookies do przechowywania informacji na Twoim komputerze. Pliki cookies stosujemy w celu świadczenia usług na najwyższym poziomie, w tym w sposób dostosowany do indywidualnych potrzeb. Korzystanie z witryny bez zmiany ustawień dotyczących cookies oznacza, że będą one zamieszczane w Twoim komputerze. W każdym momencie możesz dokonać zmiany ustawień dotyczących cookies