Research

# Properties of Boolean networks and methods for their tests

Johannes Georg Klotz1*, Ronny Feuer2, Oliver Sawodny2, Martin Bossert1, Michael Ederer2 and Steffen Schober1

Author Affiliations

1 Institute of Communications Engineering, Ulm University, Albert-Einstein-Allee 43, 89081 Ulm, Germany

2 Institute for System Dynamics, University of Stuttgart, 70569 Stuttgart, Germany

For all author emails, please log on.

EURASIP Journal on Bioinformatics and Systems Biology 2013, 2013:1  doi:10.1186/1687-4153-2013-1

 Received: 6 January 2012 Accepted: 26 November 2012 Published: 11 January 2013

This is an Open Access article distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/2.0), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

### Abstract

Transcriptional regulation networks are often modeled as Boolean networks. We discuss certain properties of Boolean functions (BFs), which are considered as important in such networks, namely, membership to the classes of unate or canalizing functions. Of further interest is the average sensitivity (AS) of functions. In this article, we discuss several algorithms to test the properties of interest. To test canalizing properties of functions, we apply spectral techniques, which can also be used to characterize the AS of functions as well as the influences of variables in unate BFs. Further, we provide and review upper and lower bounds on the AS of unate BFs based on the spectral representation. Finally, we apply these methods to a transcriptional regulation network of Escherichia coli, which controls central parts of the E. coli metabolism. We find that all functions are unate. Also the analysis of the AS of the network reveals an exceptional robustness against transient fluctuations of the binary variables.a

##### Keywords:
Regulatory Boolean networks; Boolean networks; Linear threshold functions; Unate functions; Canalizing function; Sensitivity; Average sensitivity; Restricted functions; Escherichia coli

### Introduction

Boolean modeling is often used to describe signal transduction and regulatory networks [1-3]. Over the last years random Boolean models received much attention to find some generic properties that characterize regulatory networks. In addition to the study of topological features (e.g., [4]), the choice of Boolean functions in such networks is an important question to consider. Many results indicate the importance of functions with a low average sensitivity. For example, it is well known that a low expected average sensitivity is a prerequisite for non-chaotic behavior of random Boolean networks, e.g., [5,6]. Further, so called canalizing functions have been conjectured to be characteristic for biological networks [7]. These functions have a stabilizing effect on the network dynamics [1] and many functions occurring in (non-random) regulative networks are canalizing [7].

In this work we follow a non-random approach to find properties characterizing regulatory networks. Namely, we focus on the properties of Boolean functions in a large scale Boolean regulatory network model. Our goal is also to provide efficient algorithms to test these properties.

First, we consider the membership of the regulatory functions to certain classes of functions. We first consider unate functions, which are monotone in each of their variables and were shown to be implied by a biochemical model [2].

Next, we present a test using Fourier analysis to test canalizing properties of functions. Canalizing functions are used in signal processing for certain classes of filters [8] and play an important role in random and regulatory Boolean networks, as already mentioned. Interestingly, it has been shown in [9] that a subclass of canalizing functions, namely the nested canalizing functions, is identical to the class of unate-cascade functions, a subclass of the unate functions. The test presented in this work is inspired by [10], where the so-called forcing transform was introduced to test the membership of a function to the class of canalizing functions. Here, we generalize this approach to the Fourier transform, which is a more intuitive and natural approach and furthermore some spectral properties of canalizing functions have already been investigated in [11].

It is well known that the average sensitivity can be directly obtained from the Fourier spectral coefficients. Further, the Fourier transform turns out to be useful to prove bounds on the average sensitivity. We derive an upper bound for unate functions similar to known results for monotone functions and recall a well-known lower bound on the average sensitivity.

Finally, we apply our tests to a large-scale Boolean model of the transcriptional network of Escherichia coli. We extended the network model of the transcriptional network of E. coli (Covert et al. [3]) by mapping genes to their corresponding fluxes in the flux-balance model presented by [12]. The network has a layered feed-forward structure and shows characteristic topological features, such as a long-tail like out-degree distribution.

Throughout this article we use Fourier analysis to investigate the mentioned properties. In particular we use the concept of restricted functions. Therefore we derived both-way relations between the Fourier coefficients of a Boolean function and its restriction. A very general one-way approach of this relation can be found in [13].

The remainder of this article is organized as follows: In Section 2. we give a short introduction to Boolean functions and networks, discuss some fundamentals of Fourier analysis and investigate the spectra of restricted functions. In Section 3. we discuss certain classes and properties of Boolean functions and show efficient ways to check these properties. We also introduce the average sensitivity and prove an upper bound on it for unate functions. In Section 4. we finally introduce Boolean networks and apply our methods and tests to the regulatory network of E.coli. Some final remarks are given in Section 5.

### BFs

A BF f:{−1,1}n→{−1,1} maps n-ary binary input tuples to a binary output. In general, not all variables of a function f are relevant. A variable i is called relevant, if there exits at least one argument x∈{−1,1}n such that f(x)≠f(xei), where the argument xei is obtained from xby changing its i-th entry. In the following, we denote the number of relevant variables by k.

For the sake of simplicity we assume throughout this article, that k=n, i.e., all variables are relevant, but note that the expositions in Section 2.1 are valid in general. The assignment of + 1 and −1 chosen to represent the binary in and outputs is somewhat arbitrary. One can interpret the value −1 as “ON” or “TRUE” and + 1 as “OFF” or “FALSE”.

#### Fourier analysis

Here we will give a short introduction to the concepts of Fourier analysis so far used in this article. Let us consider x=(x1,x2,…,xN) as an instance of a product distributed random vector X=(X1,X2,…,XN) with probability density function

P X ( x ) = i P X i ( x i ) .

Furthermore, let μi be the expected value of Xi, i.e., μ i = E [ X i ] and let σ i = 1 μ i 2 be the standard deviation of Xi. It can easily be seen that

P X i ( a i ) = 1 + a i · μ i 2 . (1)

It is well known that any BF f can be expressed by the following sum, called Fourier-expansion [14,15],

f ( x ) = U [ n ] f ̂ ( U ) · Φ U ( x ) , (2)

where n={1,2,…,n} and

Φ U ( x ) = i U x i μ i σ i . (3)

For U= we define Φ(x)=1. The Fourier coefficients f ̂ ( U ) can be recovered by

f ̂ ( U ) = x P X ( x ) · f ( x ) · Φ U ( x ) . (4)

Further, let AUand A ̄ = U A , then

Φ U ( x ) = Φ A ( x ) · Φ A ̄ ( x ) , (5)

which directly follows from the definition of ΦU(Equation 3).

If the input variables Xi are uniformly distributed, i.e., μi=0 and σi=1, Equation (3) reduces to

Φ U ( x ) = i U x i ,

and consequently, as PX(x)=2n for all x, Equation (4), reduces to

f ̂ ( U ) = 2 n x f ( x ) · i U x i .

#### Restricted functions

A function is called restricted, if some of the input variables are set to constants, i.e., variables iK are set to a constant xi=ai. Hence, the number of relevant variables is reduced by |K| . First, we consider the case that only one variable is restricted (K={i}). The function obtained in this way is denoted as

f | x i = a i : { 1 , 1 } n 1 { 1 , 1 } . (6)

The following lemma gives a relation between the Fourier coefficients of the original function and its restriction.

Proposition 1. Let the function f(x) be a function in n variables. Consider the restricted function obtained by setting xi=ai, further, let f | ̂ x i = a i be denoted as f ̂ a i then

f ̂ a i ( U ) = f ̂ ( U ) + Φ { i } ( a i ) · f ̂ ( U { i } ) (7)

where U⊆[n]∖{i} and Φ { i } ( a i ) = a i μ i σ i .

Proof. Using Equation (4) we can rewrite (7) as

f ̂ a i ( U ) = x P X ( x ) f ( x ) · Φ U ( x ) + Φ { i } ( a i ) · x P X ( x ) f ( x ) · Φ U { i } ( x ) . (8)

By applying (5) and (3) we get

Φ U { i } ( x ) = Φ U ( x ) · Φ { i } ( x ) = Φ U ( x ) · x i μ i σ i .

Hence, we can combine the two sums in (8) and obtain:

f ̂ a i ( U ) = x P X ( x ) f ( x ) · Φ U ( x ) · Ξ i , (9)

where

Ξ i = 1 + x i μ i a i + μ i = a i + x i a i + μ i ,

due to Φ { i } ( a i ) = a i μ i σ i = σ i a i + μ i .

Further, with a i = 1 a i and Equation (1) we get

Ξ i = 2 1 + a i · μ i = 1 P X i ( a i ) , if x i = a i 0 , if x i = a i .

Thus, the sum in Equation (9) can be simplified to

f ̂ a i ( U ) = x | x i = a i P X ( x ) P X i ( a i ) · f ( x ) · Φ U ( x )

and finally

f ̂ a i ( U ) = x | x i = a i P X | x i ( x | a i ) · f ( x ) · Φ U ( x ) ,

which is the definition of the Fourier coefficients from Equation (4) and concludes the proof. □

A closely related property is given by the following proposition. Please note that this result for uniform distributed input variables can also be retrieved using ([13], Lemma 2.17).

Proposition 2. Let i∈[n] be fixed and denote f | x i = a with fa. For any n-ary BF f,

f ̂ ( U ) = 1 + μ i 2 Φ { i } ( + 1 ) | U { i } | f ̂ + 1 ( U { i } ) + 1 μ i 2 Φ { i } ( 1 ) | U { i } | f ̂ 1 ( U { i } ) .

Proof. Starting from the definition we obtain

f ̂ ( U ) = E f ( X ) Φ U ( X ) = P X i ( + 1 ) E f ( X ) Φ U ( X ) | X i = + 1 ] + P X i ( 1 ) E f ( X ) Φ U ( X ) | X i = 1 = P X i ( + 1 ) Φ { i } ( + 1 ) E f + 1 ( X ) Φ U { i } ( X ) + P X i ( 1 ) Φ { i } ( 1 ) E f 1 ( X ) Φ U { i } ( X ) .

Note that for a= + 1 or a=−1

E f a ( X ) Φ U { i } ( X ) = f ̂ a ( U { i } )

by definition, hence, the proposition follows from Equation (1). □

For the general case, that a BF is restricted to more than one input, the following Corollary to Proposition 1 applies:

Corollary 1. Let f(x) be a BF and f ̂ ( U ) its Fourier coefficients. Furthermore, let K be a set containing the indices i of the input variables xi, which are fixed to certain values ai. The Fourier coefficients of the restricted function are then given as

f | ̂ K ( U ) = T K Φ T ( a ) · f ̂ ( U T ) ,

where U contains the indices for the Fourier coefficients of the restricted functions, i.e., U⊆[n]∖K and a is a vector containing all ai,iK.

### Classes and properties of functions

In this section, we will present and discuss some classes of BFs, namely unate and canalizing functions. Further, we will discuss properties of functions characterizing their robustness, like for example the AS.

#### Unate functions

A BF is unate if it is monotone (either increasing or decreasing) in each of its variables, a precise definition will be given below. The class of unate functions is a simple extension of the class of monotone functions defined as follows

Definition 1. A BF f:{−1,1}n→{−1,1} is called monotone, if for each i∈{1,…,n} it holds that f(x1,…,xi=−1,…,xn)≤f(x1,…,xi=1,…,xn).

Now unate functions can be defined as follows.

Definition 2. A BF f is unate, if there exists a vector a∈{−1,1}nsuch that the function f(a1·x1,…,an·xn) is monotone.

The class of unate functions is closed with respect to restriction, since every restriction of a locally monotone function yields again in a locally monotone function.

To test whether a function is unate or not it is sufficient to use the definition, however, a necessary condition for a function to be unate is given by the following proposition:

Proposition 3 (for example [16]). If f is a unate function, then for each relevant variable i

f ̂ ( { i } ) 0 .

#### Canalizing functions

A BF is called canalizing, if there exists a canalizing variable xi and a Boolean value ai∈{−1,1} such that the function

f | x i = a i ( x ) = b i , (10)

for all x1,…xi−1,xi + 1xn, where bi∈{0,1} is a constant. If the restricted function, which is obtained by setting xi=1−ai, is again canalizing and so on, the function is called nested canalizing.

The following propositions give a relation between the Fourier coefficients and the canalizing property.

Proposition 4. A BF f is canalizing in variable i, if for any constants ai,bi∈{−1,1} the Fourier coefficients f ̂ ( U ) fulfill the following condition.

f ̂ ( ) + Φ { i } ( a i ) · f ̂ ( { i } ) = b i , (11)

where μi is the expected value of xiand σi the corresponding standard derivation.

Proof. Obviously, if a function is canalizing, E [ f | x i = a i ( x ) ] = b i holds. Since the expected value of a BF can be expressed as E [ f ( x ) ] = f ̂ ( ) we obtain

E [ f | x i = a i ( x ) ] = f | ̂ x i = a i ( ) .

Using Proposition 1, we get

E [ f | x i = a i ( x ) ] = f ̂ ( ) + Φ { i } ( a i ) · f ̂ ( { i } ) ,

and the proposition follows from Equation (11). □

A similar result namely the calculation of the Fourier coefficients of a canalizing BF from the coefficients of the restricted functions f ̂ | x i = a i ( U ) is addressed in [11]. These results can also be achieved using Proposition 2.

Proposition 4 can easily be extended for nested canalizing functions:

Proposition 5. Assume f(x) is canalizing for variables xi=−ai,iK, then f(x) is canalizing for xj=aj,jK, i.e., E [ f K { j } ( x ) ] = b j , if

T K { j } i T Φ { i } ( a i ) · f ̂ ( T ) = b j .

Proof. The proof follows from Corollary 1 and Proposition 4. □

From Proposition 4 it is clear that the canalizing property can be tested by considering all Fourier coefficients of order one. Using the Fast Walsh Transform [17] this test is as fast as the one presented in [10], however, once we have retrieved the spectra of a function, we can easily compute other properties, such as the AS (see next section).

#### AS of functions

The AS [18] gives the influence of random disturbance at the input on the output of a BF. This can be interpreted as an indicator for the robustness of this BF and finally for the whole Boolean network.

To define the as we first have to look at the sensitivity sx(f) of an input argument x∈{0,1}n. It is defined as the number of single bit-flips in x so that the output of the function will change, i.e., sx(f) is number of variables i for which f(x)≠f(xei). The AS as(f) is the expected value over all arguments x:

as ( f ) = E x [ s x ( f ) ] . (12)

It is worth noting that the as depends on the distribution of the input vector. For example, a function having a low AS for the uniform distribution may have a large AS for other distributions. In general, the AS can be as large as the number of relevant variables k, i.e.,

0 as ( f ) k.

Figure 1 explains the concepts defined above at an example.

Figure 1. Sensitivities and AS of an exemplary BF. Each node represents an argument of a BF with n=3 variables, where + stands for + 1 and − represents a −1. A blank node indicates that the corresponding output of the function is 1 while a shaded node represents a −1. The sensitivity of a node is then the number of neighbor-nodes with a different shading. The expected value of these sensitivities is the AS.

Alternatively, the AS can be defined using the notion of influence. The influence Ii(f) of a single input variable i on the functions f is defined as

I i ( f ) = Prob [ f ( X ) f ( X e i ) ] . (13)

The AS can then be defined as the sum of all influences [19]

as ( f ) = E x [ s x ( f ) ] = i I i ( f ) . (14)

The influence Ii(f) for a unate function f is directly related to the corresponding Fourier coefficient:

I i ( f ) = | f ̂ ( { i } ) | σ i , (15)

as it was shown for monotone functions in ([16], Lemma 4.5) and can easily be extended to unate functions. Note that Equation (15) directly gives a proof for Proposition 3. Hence, for unate functions we can write

as ( f ) = i = 1 n | f ̂ ( { i } ) | σ i = i = 1 n | f ̂ ( { i } ) | σ i 2 , (16)

and from the Cauchy-Schwarz inequality it follows that

as ( f ) i = 1 n | f ̂ ( { i } ) | 2 i = 1 n 1 σ i 2 1 f ̂ ( ) 2 i = 1 n 1 σ i 2 . (17)

Together with a lower bound as presented in [19,20] and since 1 f ̂ ( ) 2 = 1 E [ f ] 2 = Var ( f ) we obtain the following proposition.

Proposition 6. Let f be an unate BF with in-degree n, further let σi be the standard derivation of the i-th input, then the AS of f(as(f)) is bounded by

Var ( f ) as ( f ) Var ( f ) i = 1 n 1 σ i 2 , (18)

where Var(f) denotes the variance off.

It can be shown that some functions get close to the upper bound. Assuming uniform distribution the upper bound in Equation (18) is smaller than n . But it is well known that the AS of the majority function behaves like O ( n ) (see for example [21]).

### Application to a regulatory network of E.coli

In the previous sections, we only considered BFs. Now we will focus on BNs. A synchronous BN of N nodes can be described by a graph G=G(V,E) with nodes V⊆[N], |V|=N, and edges EV×V, and a set of ordered BFs F=(f1,f2,…,fN), where we also allow a dummy function (see below). Each fihas ni=ki=in-deg(i) relevant variables where in-deg(i) is the in-degree of node i, i.e., the number of edges (j,i) with jV. In this case a node j is called a controlling node of i. If a node i has in-degree zero, the dummy function is attached and we call it an in-node. Consequently, the number of edges emerging from i is called the out-degree of node i. Usually to each node a binary state variable is assigned, i.e., for node i we assign xi(t)∈{−1, + 1}. For in-nodes the state can be set by some external process at some time t0. The state of all other nodes at time t depend on its BF and the states of all controlling nodes at time instant t−1.

In this article, we are only considering feed-forward networks, i.e., networks without feedback loops. In such feed-forward BNs, the set of nodes is partitioned in layers L1,L2,…,Ll. If a node i is an element of layer Lh all controlling nodes are element of layers Lm with m<h. The first (highest) layer L1 consists of the input nodes (in-nodes), while the lowest layer Llconsists of the output nodes (out-nodes). In Figure 2 a sample network is depicted.

Figure 2. Example of a layered feed-forward Boolean network. The picture shows an example network. The upper layer (in red) consists of the inputs. These are fed forward through the middle layers (representing the regulation of the genes, in green) to the lowest layer. This layer is the output of the network (in blue). In our case it represents the fluxes of the metabolism.

#### Structural properties

We applied the tests described in the previous sections to the regulatory network of E. coli[3]. The model provides Boolean formulas that describe how environmental conditions act on gene expression via a transcriptional regulatory network. We extended this network by the mapping of the genes to their corresponding fluxes in the flux-balance model [12]. The network as described in the literature contains functions with irrelevant variables, respectively, redundant edges, which are removed. A list of the affected nodes and the removed edges can be found in the Additional file 1.

Additional file 1. This.xls file contains 3 sheets with listings of:

This file can be viewed with: Microsoft Excel Viewer

The resulting network has a total of N=3915 nodes and |E|=4874 edges, where 1,386 of these nodes are in layer L1, i.e., are inputs, hence, 2,529 nodes have a non-dummy function attached. The in-degree and out-degree distributions can be found in Figures 3 and 4. The average in-degree is 1.92724. The out-degree distribution shows a typical long tail behavior [4].

Figure 3. In-degree distribution of the investigated network ([[3]] extended by [[12]]).

Figure 4. Out-degree distribution of the investigated network ([[3]] extended by [[12]]).

We found that all functions attached to the nodes are unate. Furthermore 2499 functions (98.8%) are canalizing An overview of the functions, which are not canalizing, can be found in the Additional file 1.

#### Robustness

To evaluate the robustness of the network we assume in general that the state of nodes can be described by binary random variables. In a first step we assumed that each random variable of each nodes is uniformly distributed. This implies that we consider each node independently, i.e., the topology of the network is ignored. We calculated the AS for all functions in the network. In Figure 5, the resulting AS is plotted versus the bias, which is the probability that the output of the function equals one (a similar analysis appears in [22]). Each color represents a BF with a certain in-degree n. We also included the lower bond and two exemplary upper bounds for n=5 and n=8 (Equation (18)). For increasing n the upper bounds will grow, i.e., the bound will move further to the right.

Figure 5. AS of functions plotted versus bias of functions (equally distributed inputs).

Obviously, functions with a strong bias, i.e., with a high probability to be either −1 or 1, have a low AS. Further it can be seen that the average sensitivities of all functions are very close to the lower bound. The mean value of the AS is 0.918874. Hence, it can be stated that the AS of this network is rather low. Similar results can be obtained considering the network without the extension as originally defined by Covert et al. [3] and Samal and Jain [23].

In a second step we want to take the topology of the network into account. Therefore, we now assume that only the in-nodes of the network are equally distributed. However, the output of these functions will most certainly not be uniform, i.e., the functions have a bias unequal zero. Since the outputs of these functions serve as inputs of the functions of the next layer, we assume that their input distributions follow the output distribution of the first-layer functions. The output distributions of the second-layer functions serve then as input distributions of the third layer and so on. Obviously this has an impact on the as of the functions.

The results are shown in Figure 6. We did not include any upper bounds in this figure since these now depend on each input distribution (see Proposition 6). It can be seen that the AS is still very close to the lower bound. However, a few functions have a rather large AS, e.g., it can be seen in Figure 6 that two types of functions with in-degree K=2 are very close to their upper bound (which is in this case at as(f)=2). These functions have an argument with a sensitivity of 2. Due to the input distribution of these functions this argument has a very large probability (>98%) which leads to a very high AS close to 2. Such high AS are normally observed for XOR and related functions. The average value of the AS is 0.908445, hence the AS of the network further decreases when applying product distributions at the inputs of the functions.

Figure 6. AS of functions plotted versus bias of functions (product distributed inputs).

#### Comparison with random ensembles

The network appears to be more robust against transient errors as for example certain randomly constructed networks. The in-degree distributions of all controlled nodes (in-degree larger zero) is shown in Figure 3. For all nodes with in-degree k we choose a random function out of the set of functions with k relevant variables. For k=1 this results in E [ as ( f ) ] = 1 , for k>1 we can at least state that E [ as ( f ) ] > k 2 , as it is well known that if we choose randomly from functions, we expect an AS of k 2 . Taking the in-degree distribution into account this implies that the expectation of the AS of all BFs chosen in this way is larger than 1.25.

It is well known that random function ensembles with lower expected AS can be constructed, if functions with a higher bias have higher probability to be chosen [24]. To test if the observed robustness can be explained due to the bias of the functions, we proceeded as follows. Again, a random function is chosen for each node with in-degree k. We determine the frequency distribution for the bias b=Pf=1] for all functions of the original network model with a certain in-degree k. The random network is generated by replacing the original functions of the network with functions drawn from an ensemble of functions with the same distribution. For example, if k=2, roughly 32% of all functions have b=0.25, while all others have b=0.75. Hence, with probability 32% we choose a function with b=0.25, and b=0.75 otherwise. The data can be found in the Additional file 1. As shown in [25,26], the expectation of the AS is then given by

E ( as ( f ) ) = 2 kb ( 1 b ) 2 k 2 k 1 . (19)

The results obtained are shown in Table 1 sorted according to the in-degree k. For k=1 and k=2 the observed mean of as(f) and the expectation of the random function coincides as only identity functions, respectively, AND or OR functions are chosen. For larger k, the observed mean is always smaller as the expectation of the random function. For some values of k, for example k=9, both values are close to each other. This is due to the fact that the corresponding functions are highly biased, which means that there are three existing functions with the values for b being 0.00195312, 0.0917969 and 0.994141. In contrast, for k=11 the mean of the observed values and the expectation are far from each other. Indeed out of three functions, there is one function with b=0.354004 for which, according to Equation (19), the expectation of the AS is 5.03353147.

Table 1. Fraction of functions with in-degreek, the mean of the AS of all functions with in-degreek, and the expectation of an accordingly chosen random function with same in-degree and same bias distribution (see text and Equation19)

It should be noted that in random BNs the expectation of the AS is an order parameter[5,6]. That is, if the expectation is less or equal to one many random networks show the so-called ordered behavior. Namely, single transient errors introduced in network nodes (by flipping their state) do not spread through the network with high probability. This ordered behavior is in sharp contrast to the so-called disordered behavior of random networks which is characterized by an expectation of the AS larger one. Indeed, it has been conjectured that biological relevant networks should be ordered (or critical) but not disordered [27]. A further investigation on how canalizing and nested canalizing functions influence the average sensitivity can be found in [7,11].

#### Impact of mutations on the metabolism

When investigating a regulatory network, the impact of the network on the metabolism is of major interest. Hence, only the stability of nodes in the bottom layer, i.e., the output of the network, is relevant. In regulatory networks, mutations are a source for errors. We consider two possible types of mutations. First we assume that a part of promoter region of a gene is mutated or deleted. In terms of our network this means that a edge is removed and the corresponding input is set to false (+ 1). The gene may still be transcribed, hence, the node itself remains functional. The second type of mutation is the deletion of a gene or a mutation which leads to disfunctional gene. In this case, the node is constantly set to false. In both cases, the value of one node may change (error). This error is now fed through the out-going edges of this node to other nodes. However, due to the low sensitivity of all functions in the network, the error has no impact on many nodes and, therefore, will in most cases not reach the bottom layer, which is, as mentioned above, the only part of the network, whose stability is crucial. From that point of view it can be stated that these permanent errors behave similar to the transient errors described above and that networks with a low mean AS are robust against such errors.

### Summary

It is an important problem to characterize BFs that appear in Boolean models of regulatory networks. This will help to understand the constraints underlying such networks, but can, for example, also help to improve network inference algorithms (see for examples [28,29] for algorithms that utilize the membership to the class of unate functions). In this study, we focused on several properties that have been shown to be of interest in the context of Boolean regulatory networks. Namely, we discussed different classes of BFs such as unate and canalizing functions. Further, sensitivity measures of BFs, like the influence of variables, or the AS are considered. We devised simple algorithms to test these properties. To test canalizing properties of BFs we applied the Fourier representation of BFs where functions are represented as multivariate, multilinear real polynomials. To this end, we introduced two spectral relationships between the so-called restricted BFs and their unrestricted counter part. The Fourier representation is further useful as many interesting properties such as the influence of unate functions or the AS of BFs can easily be characterized in the spectral domain. For example, we show how to obtain theoretical upper bounds on the AS for unate functions using spectral techniques.

As an application of our results, we analyzed an extended [30] regulatory Boolean network model of the central metabolism of E. coli. It turned out that most functions are within the classes of unate functions. Further, the AS of most functions is close to a theoretical lower bound and far from the new upper bound. Especially, functions with large in-degree have low AS even if their so-called bias is close to 0.5 (see Figure 5). We compared our findings to random BNs with similar parameters and find that the investigated networks has an even lower AS. From that we conclude that the whole network is stable, and robust to small changes, e.g., mutations.

### Endnote

aPreliminary results of this study have been presented at the 8th International Workshop on Computational Systems Biology (WCSB 2011) and the 3rd International Conference on Bioinformatics and Computational Biology (BICoB 2011).

### Competing interests

The authors declare that they have no competing interests.

### Acknowledgements

The authors would like to thank Georg Sprenger and Katrin Gottlieb from the Institute for Microbiology at the University of Stuttgart for fruitful collaboration and discussions. Further we thank Reinhard Heckel for creating large parts of the software. This study was supported by the German Research Foundation “Deutsche Forschungsgemeinschaft” (DFG) under Grants Bo 867/25-1 and Sa 847/11-1.

### References

1. S Kauffman, C Peterson, B Samuelsson, C Troein, Genetic networks with canalyzing Boolean rules are always stable. Proc. Natl Acad. Sci. USA 101(49), 17102–17107 (2004). PubMed Abstract | Publisher Full Text | PubMed Central Full Text

2. J Grefenstette, S Kim, S Kauffman, An analysis of the class of gene regulatory functions implied by a biochemical model. Biosystems 84(2), 81–90 (http://www, 2006), . sciencedirect.com/science/article/B6T2K-4HWXP4R-3/2/61a3092f98470e99a2c33786416697d0 webcite PubMed Abstract | Publisher Full Text

3. MW Covert, EM Knight, JL Reed, MJ Herrgard, BO Palsson, Integrating high-throughput and computational data elucidates bacterial networks. Nature 429(6987), 92–96 (http://dx, 2004), . doi.org/10.1038/nature02456 webcite PubMed Abstract | Publisher Full Text

4. M Aldana, Boolean dynamics of networks with scale-free topology. Physica D 185, 45–66 (2003). Publisher Full Text

5. I Shmulevich, SA Kauffman, Activities and sensitivities in Boolean network models. Phys. Rev. Lett 93(4), 048701 (2004). PubMed Abstract | Publisher Full Text | PubMed Central Full Text

6. Mahdavi byK, Culshaw R, Boucher J (eds.), Dynamics of random Boolean networks (World Scientific Publishing Co, Singapore, 2007)

7. SE Harris, BK Sawhill, A Wuensche, S Kauffman, A model of transcriptional regulatory networks based on biases in the observed regulation rules. Complexity 7(4), 23–40 (2002). Publisher Full Text

8. M Gabbouj, PT Yu, EJ Coyle, Convergence behavior and root signal sets of stack filters. Circuits Syst. Signal Process 11, 171–193 (1992). Publisher Full Text

9. AS Jarrah, B Raposa, R Laubenbacher, Nested Canalyzing, Unate Cascade, and Polynomial Functions. Physica D 233(2), 167–174 (2007). PubMed Abstract | Publisher Full Text | PubMed Central Full Text

10. I Shmulevich, H Lahdesmaki, K Egiazarian, Spectral methods for testing membership in certain post classes and the class of forcing functions. Signal Process. Lett. IEEE 11(2), 289–292 (2004)

11. J Kesseli, P Rämö, O Yli-Harja, Analyzing dynamics of Boolean networks with canalyzing functions using spectral methods. Proceedings of the 2005 International TICSP Workshop on Spectral Methods and Multirate Signal Processing (SMMSP 2005) ((Riga, Latvia, 20-22 June 2005)), pp. 151–158

12. AM Feist, CS Henry, JL Reed, M Krummenacker, AR Joyce, PD Karp, LJ Broadbelt, VBO Hatzimanikatis, V Palsson, A genome-scale metabolic reconstruction for Escherichia coli K-12 MG1655 that accounts for 1260 ORFs and thermodynamic information. Mol. Syst. Biol 3, 121 (10, 2007), . 1038/msb4100155 PubMed Abstract | Publisher Full Text | PubMed Central Full Text

13. A Bernasconi, in Mathematical techniques for the analysis of Boolean functions, ed. by . PhD thesis (University of Pisa, Italy, 1998)

14. RR Bahadur, A representation of the joint distribution of responses to n dichotomous items. in Studies on Item Analysis and Prediction, no, ed. by Solomon byH. 6 in Stanford Mathematical Studies in the Social Sciences (Stanford University Press, Stanford, CA, 1961), pp. 158–176

15. ML Furst, JC Jackson, SW Smith, Improved learning of AC0 functions. Proceedings of the Fourth Annual Workshop on Computational Learning Theory (Morgan Kaufmann Publishers Inc., Santa Cruz, 1991), pp. 317–325

16. NH Bshouty, C Tamon, On the Fourier spectrum of monotone functions. J. ACM 43(4), 747–770 (1996). Publisher Full Text

17. J Shanks, Computation of the fast Walsh-Fourier transform. IEEE Trans. Comput C-18(5), 457–459 (1969)

18. I Benjamini, G Kalai, O Schramm, Noise sensitivity of Boolean functions and applications to percolation. Publications mathematiques de l’IHES 90, 5–43 (1999)

19. J Kahn, G Kalai, N Linial, The influence of variables on Boolean functions. Proceedings of the 29th Annual Symposium on Foundations of Computer Science (White Plains, (New York, USA, 24-26 Oct 1988)), pp. 68–80

20. E Friedgut, Boolean functions with low average sensitivity depend on few coordinates. Combinatorica 18, 27–35 (10, 1998), . 1007/PL00009809 Publisher Full Text

21. R O’Donnell, Some topics in analysis of boolean functions. Proceedings of the 40th annual ACM symposium on Theory of computing ((ACM, Victoria, 2008), pp. 569–578 (http://portal, 2008), . acm.org/citation.cfm?id=1374458 webcite

22. R Heckel, S Schober, M Bossert, Harmonic analysis of Boolean networks: determinative power and perturbations (arXiv:1109, 2011), . 0807

23. A Samal, S Jain, The regulatory network of E. coli metabolism as a Boolean dynamical system exhibits both homeostasis and flexibility of response. BMC Syst. Biol 2, 21 (http://dx, 2008), . doi.org/10.1186/1752-0509-2-21 webcite PubMed Abstract | BioMed Central Full Text | PubMed Central Full Text

24. B Derrida, Y Pomeau, Random networks of automata—a simple annealed approximation. Europhys. Lett 2, 45–49 (1986). Publisher Full Text

25. S Schober, Analysis and identifiation of Boolean networks using harmonic analysis (Dissertation, Ulm University, Ulm, Germany, 2011)

26. S Schober, M Bossert, Analysis of random Boolean networks using the average sensitivity (arXiv:nl, 2007), . cg/0704.0197

27. SA Kauffman, Metabolic stability and epigenesis in randomly constructed nets. J. Theor. Biol 22, 437–467 (1969). PubMed Abstract | Publisher Full Text

28. S Schober, D Kracht, M Heckel, R Bossert, Detecting controlling nodes of Boolean regulatory networks. EURASIP J. Bioinf. Syst. Biol 27(11), 1529–1536 (2011) (http://www, 2011), . ncbi.nlm.nih.gov/pubmed/21989141 webcite

29. M Maucher, B Kracher, M Kühl, HA Kestler, Inferring Boolean network structure via correlation. Bioinformatics (2011) (http://bioinformatics, 2011), . oxfordjournals.org/content/early/2011/04/05/bioinformatics.btr166.abstract webcite

30. R Feuer, K Gottlieb, JG Klotz, S Schober, M Bossert, O Sawodny, G Sprenger, M Ederer, Model-based analysis of adaptive evolution. Proceedings of the 8th International Workshop on Computational Systems Biology (WCSB) ((Zuerich, Switzerland, 2011), pp. 108–111