Computational core and fixed-point organisation in Boolean networks
摘要
In this paper, we analyse large random Boolean networks in terms of a constraint satisfaction problem. We first develop an algorithmic scheme which allows to prune simple logical cascades and under-determined variables, returning thereby the computational core of the network. Second we apply the cavity method to analyse number and organisation of fixed points. We find in particular a phase transition between an easy and a complex regulatory phase, the latter one being characterised by the existence of an exponential number of macroscopically separated fixed-point clusters. The different techniques developed are reinterpreted as algorithms for the analysis of single Boolean networks, and they are applied to analysis and in silico experiments on the gene-regulatory networks of baker's yeast (saccaromices cerevisiae) and the segment-polarity genes of the fruit-fly drosophila melanogaster.
引用
@article{arxiv.cond-mat/0512089,
title = {Computational core and fixed-point organisation in Boolean networks},
author = {L. Correale and M. Leone and A. Pagnani and M. Weigt and R. Zecchina},
journal= {arXiv preprint arXiv:cond-mat/0512089},
year = {2009}
}
备注
29 pages, 18 figures, version accepted for publication in JSTAT