Abstract
Boolean network is a discrete mathematical model of gene regulatory networks. In this short article, we briefly review algorithmic results on finding attractors in Boolean networks. Since it is known that the problem of finding a singleton attractor is NP-hard and the problem can be trivially solved in \(O^{*}(2^n)\) time (under a reasonable assumption), we focus on special cases in which the problem can be solved in \(O((2-\delta )^n)\) time for some constant \(\delta >0\). We also briefly review algorithmic results on control of Boolean networks.
Partially supported by JSPS, Japan: Grant-in-Aid 26240034.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Notes
- 1.
\(O^{*}(f(n))\) denotes O(f(n)poly(n)).
References
Akutsu, T.: Algorithms for Analysis, Inference, and Control of Boolean Networks. World Scientific, Singapore (2018)
Cheng, D., Qi, H., Li, Z.: Analysis and Control of Boolean Networks: A Semi-tensor Product Approach. Springer, London (2011). https://doi.org/10.1007/978-0-85729-097-7
Kauffman, S.A.: Homeostasis and differentiation in random genetic control networks. Nature 224, 177–178 (1969)
Lu, J., Li, H., Liu, Y., Li, F.: Survey on semi-tensor product method with its applications in logical networks and other finite-valued systems. IET Control Theory Appl. 11, 2040–2047 (2017)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2018 Springer International Publishing AG, part of Springer Nature
About this paper
Cite this paper
Akutsu, T. (2018). Algorithms for Analysis and Control of Boolean Networks. In: Jansson, J., MartÃn-Vide, C., Vega-RodrÃguez, M. (eds) Algorithms for Computational Biology. AlCoB 2018. Lecture Notes in Computer Science(), vol 10849. Springer, Cham. https://doi.org/10.1007/978-3-319-91938-6_1
Download citation
DOI: https://doi.org/10.1007/978-3-319-91938-6_1
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-91937-9
Online ISBN: 978-3-319-91938-6
eBook Packages: Computer ScienceComputer Science (R0)