Abstract
Boolean networks (BNs), first introduced by Kauffman as genetic regulatory network models, are the subject of notable works in complex systems biology literature. BN models lately garnered much attention because it has been shown that BNs can capture important phenomena in genetics and biology in general. In this work, we illustrate the main properties and design principles of a new efficient, flexible and extensible BN simulator, named the Boolean Network Toolkit. This simulator makes it possible to easily set up experiments and analyse the most relevant features of BN’s dynamics.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Notes
- 1.
See, e.g., the work by Benedettini et al. [2].
- 2.
“Lazy” roughly means “computed on demand”.
- 3.
A range is a stream encapsulated in a C++ object
- 4.
Of course, such experiment is feasible only for small networks.
References
Kauffman S (1993) The origins of order: self-organization and selection in evolution. Oxford University Press, London
Kauffman S (2004) A proposal for using the ensemble approach to understand genetic regulatory networks. J Theor Biol 230:581–590
Benedettini S, Roli A, Serra R, Villani M (2011) Stochastic local search to automatically design Boolean networks with maximally distant attractors. In: Di Chio C, Cagnoni S, Cotta C, Ebner M, Ekárt A, Esparcia-Alcázar A, Merelo J, Neri F, Preuss M, Richter H, Togelius J, Yannakakis G (eds) Applications of evolutionary computation. Lecture notes in computer science. Springer, Heidelberg, pp 22–31
Benedettini S The Boolean network toolkit. http://sourceforge.net/projects/booleannetwork/
Serra R, Villani M, Barbieri A, Kauffman S, Colacci A (2010) On the dynamics of random Boolean networks subject to noise: attractors, ergodic sets and cell types. J Theor Biol 265(2):185–193
Siek JG, Lee LQ, Lumsdaine A (2002) The Boost graph library: user guide and reference manual. Addison-Wesley, Reading
Brent RP (1980) An improved Monte Carlo factorization algorithm. BIT Numer Math 20:176–184
Knuth D (1998) The art of computer programming. Volume 2: Seminumerical algorithms, 3rd edn. Pearson Education, Upper Saddle River
Derrida B, Pomeau Y (1986) Random networks of automata: a simple annealed approximation. Europhys Lett 1(2):45–49
Heckel R, Schober S, Bossert M (2010) On random boolean threshold networks. In: International ITG conference on source and channel coding (SCC), pp 1–6
Kappler K, Edwards R, Glass L (2003) Dynamics in high-dimensional model gene networks. Signal Process 83:789–798
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer International Publishing Switzerland
About this paper
Cite this paper
Benedettini, S., Roli, A. (2013). An Efficient Simulator for Boolean Network Models. In: Gilbert, T., Kirkilionis, M., Nicolis, G. (eds) Proceedings of the European Conference on Complex Systems 2012. Springer Proceedings in Complexity. Springer, Cham. https://doi.org/10.1007/978-3-319-00395-5_30
Download citation
DOI: https://doi.org/10.1007/978-3-319-00395-5_30
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-00394-8
Online ISBN: 978-3-319-00395-5
eBook Packages: Physics and AstronomyPhysics and Astronomy (R0)