A Monte Carlo approach to measure the robustness of Boolean networks

Authors:
Vitor H. P. Louzada;Fabrício M. Lopes;Ronaldo F. Hashimoto
Affiliations:
Computational Physics, IfB, ETH-Honggerberg, Switzerland;Federal University of Technology - Paraná, Brazil;University of São Paulo, São Paulo, Brazil
Venue:
Proceedings of the ACM Conference on Bioinformatics, Computational Biology and Biomedicine
Year:
2012

Citing 4
Cited 0

Steady-state probabilities for attractors in probabilistic boolean networks

Signal Processing
AGN Simulation and Validation Model

BSB '08 Proceedings of the 3rd Brazilian symposium on Bioinformatics: Advances in Bioinformatics and Computational Biology
On the threshold of chaos in random boolean cellular automata

Random Structures & Algorithms
Analysis of gene interactions using restricted boolean networks and time-series data

ISBRA'10 Proceedings of the 6th international conference on Bioinformatics Research and Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

Emergence of robustness in biological networks is a paramount feature of evolving organisms, but a study of this property in vivo, for any level of representation such as Genetic, Metabolic, or Neuronal Networks, is a very hard challenge. In the case of Genetic Networks, mathematical models have been used in this context to provide insights on their robustness, but even in relatively simple formulations, such as Boolean Networks (BN), it might not be feasible to compute some measures for large system sizes. We describe in this work a Monte Carlo approach to calculate the size of the largest basin of attraction of a BN, which is intrinsically associated with its robustness, that can be used regardless the network size. We show the stability of our method through finite-size analysis and validate it with a full search on small networks.