Local negative circuits and cyclic attractors in Boolean networks with at most five components

We consider the following question on the relationship between the asymptotic behaviours of Boolean networks and their regulatory structures: does the presence of a cyclic attractor imply the existence of a local negative circuit in the regulatory graph? When the number of model components $n$ verifies $n \geq 6$, the answer is known to be negative. We show that the question can be translated into a Boolean satisfiability problem on $n \cdot 2^n$ variables. A Boolean formula expressing the absence of local negative circuits and a necessary condition for the existence of cyclic attractors is found unsatisfiable for $n \leq 5$. In other words, for Boolean networks with up to 5 components, the presence of a cyclic attractor requires the existence of a local negative circuit.

[1]  Adrien Richard,et al.  Negative circuits and sustained oscillations in asynchronous automata networks , 2009, Adv. Appl. Math..

[2]  Mau-Hsiang Shih,et al.  A combinatorial analogue of the Jacobian problem in automata networks , 2005, Adv. Appl. Math..

[3]  Marijn J. H. Heule,et al.  DRAT-trim: Efficient Checking and Trimming Using Expressive Clausal Proofs , 2014, SAT.

[4]  Paul Ruet,et al.  Local cycles and dynamical properties of Boolean networks , 2014, Mathematical Structures in Computer Science.

[5]  Elisa Tonello,et al.  On the conversion of multivalued gene regulatory networks to Boolean dynamics , 2017, ArXiv.

[6]  Adrien Richard,et al.  Necessary conditions for multistationarity in discrete dynamical systems , 2007, Discret. Appl. Math..

[7]  Shizuo Kaji,et al.  A circuit-preserving mapping from multilevel to Boolean dynamics. , 2017, Journal of theoretical biology.

[8]  Adrien Richard,et al.  An extension of a combinatorial fixed point theorem of Shih and Dong , 2008, Adv. Appl. Math..

[9]  Vasco M. Manquinho,et al.  Stable States of Boolean Regulatory Networks Composed Over Hexagonal Grids , 2018, SASB.

[10]  Adrien Richard,et al.  From kernels in directed graphs to fixed points and negative cycles in Boolean networks , 2013, Discret. Appl. Math..

[11]  Denis Thieffry,et al.  Graphic requirements for multistability and attractive cycles in a Boolean dynamical framework , 2008, Adv. Appl. Math..

[12]  Tatsuya Akutsu,et al.  Detecting a Singleton Attractor in a Boolean Network Utilizing SAT Algorithms , 2009, IEICE Trans. Fundam. Electron. Commun. Comput. Sci..

[13]  Armin Biere,et al.  Splatz , Lingeling , Plingeling , Treengeling , YalSAT Entering the SAT Competition 2016 , 2016 .

[14]  René Thomas.  On the Relation Between the Logical Structure of Systems and Their Ability to Generate Multiple Steady States or Sustained Oscillations , 1981 .

[15]  Maxim Teslenko,et al.  A SAT-Based Algorithm for Finding Attractors in Synchronous Boolean Networks , 2011, IEEE/ACM Transactions on Computational Biology and Bioinformatics.

[16]  Peter Lammich,et al.  The GRAT Tool Chain - Efficient (UN)SAT Certificate Checking with Formal Correctness Guarantees , 2017, SAT.

[17]  D. Slepian.  On The Number of Symmetry Types of Boolean Functions of n Variables , 1953, Canadian Journal of Mathematics.

[18]  Paul Ruet,et al.  Negative local feedbacks in Boolean networks , 2015, Discret. Appl. Math..

[19]  Adrien Richard.  Local negative circuits and fixed points in non-expansive Boolean networks , 2011, Discret. Appl. Math..