On Computing Structural and Behavioral Complexities of Threshold Boolean Networks : Application to Biological Networks.

Various threshold Boolean networks (TBNs), a formalism used to model different types of biological networks (genes notably), can produce similar dynamics, i.e. share same behaviors. Among them, some are complex (according to Kolmogorov complexity), others not. By computing both structural and behavioral complexities, we show that most TBNs are structurally complex, even those having simple behaviors. For this purpose, we developed a new method to compute the structural complexity of a TBN based on estimates of the sizes of equivalence classes of the threshold Boolean functions composing the TBN.