Exploring attractor bifurcations in Boolean networks
Jazyk angličtina Země Anglie, Velká Británie Médium electronic
Typ dokumentu časopisecké články
Grantová podpora
MUNI/G/1771/2020.
Masarykova Univerzita
Odkazy
PubMed
35546394
PubMed Central
PMC9092939
DOI
10.1186/s12859-022-04708-9
PII: 10.1186/s12859-022-04708-9
Knihovny.cz E-zdroje
- Klíčová slova
- Attractor bifurcation, Boolean networks, Software tool, Symbolic computation, type-1 interferons,
- MeSH
- algoritmy MeSH
- aniliny MeSH
- benzamidy MeSH
- COVID-19 * MeSH
- genové regulační sítě * MeSH
- lidé MeSH
- modely genetické MeSH
- naftaleny MeSH
- SARS-CoV-2 MeSH
- Check Tag
- lidé MeSH
- Publikační typ
- časopisecké články MeSH
- Názvy látek
- 5-amino-2-methyl-N-((R)-1-(1-naphthyl)ethyl)benzamide MeSH Prohlížeč
- aniliny MeSH
- benzamidy MeSH
- naftaleny MeSH
BACKGROUND: Boolean networks (BNs) provide an effective modelling formalism for various complex biochemical phenomena. Their long term behaviour is represented by attractors-subsets of the state space towards which the BN eventually converges. These are then typically linked to different biological phenotypes. Depending on various logical parameters, the structure and quality of attractors can undergo a significant change, known as a bifurcation. We present a methodology for analysing bifurcations in asynchronous parametrised Boolean networks. RESULTS: In this paper, we propose a computational framework employing advanced symbolic graph algorithms that enable the analysis of large networks with hundreds of Boolean variables. To visualise the results of this analysis, we developed a novel interactive presentation technique based on decision trees, allowing us to quickly uncover parameters crucial to the changes in the attractor landscape. As a whole, the methodology is implemented in our tool AEON. We evaluate the method's applicability on a complex human cell signalling network describing the activity of type-1 interferons and related molecules interacting with SARS-COV-2 virion. In particular, the analysis focuses on explaining the potential suppressive role of the recently proposed drug molecule GRL0617 on replication of the virus. CONCLUSIONS: The proposed method creates a working analogy to the concept of bifurcation analysis widely used in kinetic modelling to reveal the impact of parameters on the system's stability. The important feature of our tool is its unique capability to work fast with large-scale networks with a relatively large extent of unknown information. The results obtained in the case study are in agreement with the recent biological findings.
Chatain T et al. Boolean networks: beyond generalized asynchronicity. In: International workshop on cellular automata and discrete complex systems, 29–42. Springer, Cham, 2018. 10.1007/978-3-319-92675-9_3.
Fisher J et al. Synthesising executable gene regulatory networks from single-cell gene expression data. In: Computer Aided Verification, 544–560. Springer, Cham, 2015. 10.1007/978-3-319-21690-4_38.
Su C et al. Controlling large Boolean networks with temporary and permanent perturbations. In: Formal Methods, 707–724. Springer, Cham, 2019. 10.1007/978-3-030-30942-8_41.
Beneš N et al. Formal analysis of qualitative long-term behaviour in parametrised Boolean networks. In: International conference on formal engineering methods, 353–369. Springer, Cham, 2019. 10.1007/978-3-030-32409-4_22
Tamura T, Akutsu T. Detecting a singleton attractor in a Boolean network utilizing SAT algorithms. IEICE Trans Fund Electron Commun Comput Sci. 2009;E92.A(2):493–501. 10.1587/transfun.E92.A.493
Akutsu T et al. Integer programming-based methods for attractor detection and control of Boolean networks. In: IEEE Conference on Decision and Control, 2009:5610–5617. 10.1109/CDC.2009.5400017
Qu H et al. Improving BDD-based attractor detection for synchronous Boolean networks. In: Proceedings of the 7th Asia-Pacific Symposium on Internetware. Internetware ’15, 212–220. Association for Computing Machinery, New York, NY, USA, 2015. 10.1145/2875913.2875925.
Naldi A et al. Decision diagrams for the representation and analysis of logical models of genetic networks. In: Computational Methods in Systems Biology. Springer, Cham, 2007:233–247. 10.1007/978-3-540-75140-3_16.
Klarner H, et al. Computing maximal and minimal trap spaces of Boolean networks. Nat Comput. 2015;14(4):535–544. doi: 10.1007/s11047-015-9520-7. DOI
Harvey I, Bossomaier T. Time out of joint: attractors in asynchronous random Boolean networks. In: Proceedings of the fourth european conference on artificial life. MIT Press, Cambridge, 1997:67–75
Mushthofa M et al. Computing attractors of multi-valued gene regulatory networks using fuzzy answer set programming. In: IEEE international conference on fuzzy systems, 2016:1955–1962 . 10.1109/FUZZ-IEEE.2016.7737931
Chatain T et al. Characterization of reachable attractors using Petri net unfoldings. In: Computational Methods in Systems Biology. Springer, Cham, 2014:129–142. 10.1007/978-3-319-12982-2_10
Cheng D et al. Analysis and Control of Boolean Networks: a Semi-tensor Product Approach. Springer, London, 2010. 10.1007/978-0-85729-097-7
Liu X, et al. Gapore: Boolean network inference using a genetic algorithm with novel polynomial representation and encoding scheme. Knowl-Based Syst. 2021;228:107277. doi: 10.1016/j.knosys.2021.107277. DOI
Zhong J, et al. Pinning control for stabilization of boolean networks under knock-out perturbation. IEEE Trans Autom Control. 2021 doi: 10.1109/TAC.2021.3070307. DOI
Acernese A, et al. Reinforcement learning approach to feedback stabilization problem of probabilistic boolean control networks. IEEE Control Syst Lett. 2020;5(1):337–342. doi: 10.1109/LCSYS.2020.3001993. DOI
Cheng X, et al. Discrimination of attractors with noisy nodes in boolean networks. Automatica. 2021;130:109630. doi: 10.1016/j.automatica.2021.109630. DOI
Benque D et al. BMA: visual tool for modeling and analysis of biological networks. In: Computer Aided Verification. Springer, Cham, 2012:686–692. 10.1007/978-3-642-31424-7_50
Streck A et al. Comparative statistical analysis of qualitative parametrization sets. In: Hybrid Systems Biology. Springer, Cham, 2015:20–34. 10.1007/978-3-319-26916-0_2
Beneš N et al. AEON: attractor bifurcation analysis of parametrised Boolean networks. In: Computer Aided Verification. Springer, Cham, 2020:569–581. 10.1007/978-3-030-53288-8_28
Benes N et al. AEON 2021: bifurcation decision trees in Boolean networks. In: Computational Methods in Systems Biology. Springer, Cham, 2021:230–237. 10.1007/978-3-030-85633-5_14
Barnat J et al. Detecting attractors in biological models with uncertain parameters. In: Computational Methods in Systems Biology. Springer, Cham, 2017: 40–56. 10.1007/978-3-319-67471-1_3
Beneš N et al. A model checking approach to discrete bifurcation analysis. In: Formal Methods. Springer, Cham, 2016:85–101. 10.1007/978-3-319-48989-6_6
Beneš N et al. Parallel parameter synthesis algorithm for hybrid CTL. Sci Comput Program. 2020;185. 10.1016/j.scico.2019.102321
Beneš N et al. Computing bottom SCCs symbolically using transition guided reduction. In: International conference on computer aided verification. Springer, Cham, 2021:505–528. 10.1007/978-3-030-81685-8_24
Kuznetsov YA. Elements of Applied Bifurcation Theory. Springer, New York, 1998. 10.1007/978-1-4757-3978-7
Bryant RE. Graph-based algorithms for Boolean function manipulation. IEEE Trans Comput. 1986;35(8):677–691. doi: 10.1109/TC.1986.1676819. DOI
Safavian SR, Landgrebe D. A survey of decision tree classifier methodology. IEEE Trans Syst Man Cybern. 1991;21(3):660–674. doi: 10.1109/21.97458. DOI
Kent JT. Information gain and a general measure of correlation. Biometrika. 1983;70(1):163–173. doi: 10.2307/2335954. DOI
Wang K et al. Stability and bifurcation of genetic regulatory networks with delays. Neurocomputing. 2010;73(16):2882–92. 10.1109/ChiCC.2014.6896981. 10th Brazilian Symposium on Neural Networks (SBRN2008).