Abstract
Given a Boolean network \(\mathsf{BN}\) and a subset \(\mathcal {A}\) of attractors of \(\mathsf{BN}\), we study the problem of identifying a minimal subset \(\mathsf{C}_\mathsf{BN}\) of vertices of \(\mathsf{BN}\), such that the dynamics of \(\mathsf{BN}\) can reach from a state \(\mathbf{s}\) in any attractor \(A_s\in \mathcal {A}\) to any attractor \(A_t\in \mathcal {A}\) by controlling (toggling) a subset of vertices in \(\mathsf{C}_\mathsf{BN}\) in a single time step. We describe a method based on the decomposition of the network structure into strongly connected components called ‘blocks’. The control subset can be locally computed for each such block and the results then merged to derive the global control subset \(\mathsf{C}_\mathsf{BN}\). This potentially improves the efficiency for many real-life networks that are large but modular and well-structured. We are currently in the process of implementing our method in software.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsReferences
Gates, A.J., Rocha, L.M.: Control of complex networks requires both structure and dynamics. Sci. Rep. 6, 24456 (2016)
Hopkins, A.L.: Network pharmacology: the next paradigm in drug discovery. Nat. Chem. Biol. 4, 682–690 (2008)
Huang, S.: Genomics, complexity and drug discovery: insights from Boolean network models of cellular regulation. Pharmacogenomics 2(3), 203–222 (2001)
Kalman, R.E.: Mathematical description of linear dynamical systems. J. Soc. Ind. Appl. Math. 1(2), 152–192 (1963)
Kauffman, S.: Homeostasis and differentiation in random genetic control networks. Nature 224, 177–178 (1969)
Kim, J., Park, S.M., Cho, K.H.: Discovery of a kernel for controlling biomolecular regulatory networks. Sci. Rep. 3, 2223 (2013)
Liu, Y.Y., Slotine, J.J., Barabási, A.L.: Controllability of complex networks. Nature 473, 167–173 (2011)
Mizera, A., Pang, J., Qu, H., Yuan, Q.: Taming asynchrony for attractor detection in large Boolean networks. In: IEEE/ACM TCBB (2018, in press)
Paul, S., Pang, J., Su, C.: Towards the existential control of boolean networks (extended abstract). Technical report, UL (2018). http://arxiv.org/abs/1806.10927
Paul, S., Su, C., Pang, J., Mizera, A.: A decomposition-based approach towards the control of Boolean networks. In: Proceedings of ACM-BCB 2018. ACM (2018, in press)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2018 Springer Nature Switzerland AG
About this paper
Cite this paper
Paul, S., Pang, J., Su, C. (2018). Towards the Existential Control of Boolean Networks: A Preliminary Report. In: Feng, X., Müller-Olm, M., Yang, Z. (eds) Dependable Software Engineering. Theories, Tools, and Applications. SETTA 2018. Lecture Notes in Computer Science(), vol 10998. Springer, Cham. https://doi.org/10.1007/978-3-319-99933-3_10
Download citation
DOI: https://doi.org/10.1007/978-3-319-99933-3_10
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-99932-6
Online ISBN: 978-3-319-99933-3
eBook Packages: Computer ScienceComputer Science (R0)