title: Detecting controlling nodes of boolean regulatory networks.
abstract: Boolean models of regulatory networks are assumed to be tolerant to perturbations. That qualitatively implies that each function can only depend on a few nodes. Biologically motivated constraints further show that functions found in Boolean regulatory networks belong to certain classes of functions, for example, the unate functions. It turns out that these classes have specific properties in the Fourier domain. That motivates us to study the problem of detecting controlling nodes in classes of Boolean networks using spectral techniques. We consider networks with unbalanced functions and functions of an average sensitivity less than 23k, where k is the number of controlling variables for a function. Further, we consider the class of 1-low networks which include unate networks, linear threshold networks, and networks with nested canalyzing functions. We show that the application of spectral learning algorithms leads to both better time and sample complexity for the detection of controlling nodes compared with algorithms based on exhaustive search. For a particular algorithm, we state analytical upper bounds on the number of samples needed to find the controlling nodes of the Boolean functions. Further, improved algorithms for detecting controlling nodes in large-scale unate networks are given and numerically studied.
authors: Institute of Telecommunications and Applied Information Theory, Ulm University, Ulm, Germany. steffen.schober@uni-ulm.de.
authors: Steffen
authors: S
authors: Schober
authors: David
authors: D
authors: Kracht
authors: Reinhard
authors: R
authors: Heckel
authors: Martin
authors: M
authors: Bossert