×

zbMATH — the first resource for mathematics

Local negative circuits and cyclic attractors in Boolean networks with at most five components. (English) Zbl 07045562
MSC:
94C99 Circuits, networks
92B05 General biology and biomathematics
06E30 Boolean functions
PDF BibTeX XML Cite
Full Text: DOI
References:
[1] A. Biere, Splatz, Lingeling, Plingeling, Treengeling, YalSAT entering the SAT competition 2016, Proceedings of SAT Competition, 2016, pp. 44–45.
[2] E. Dubrova and M. Teslenko, A SAT-based algorithm for finding attractors in synchronous Boolean networks, IEEE/ACM Trans. Comput. Biol. Bioinform., 8 (2011), pp. 1393–1399.
[3] A. Fauré and S. Kaji, A circuit-preserving mapping from multilevel to Boolean dynamics, J. Theoret. Biol., 440 (2018), pp. 71–79. · Zbl 1400.92208
[4] P. Lammich, The GRAT tool chain: Efficient (UN)SAT certificate checking with formal correctness guarantees, in Theory and Applications of Satisfiability Testing–SAT 2017, Lecture Notes in Comput. Sci. 10491, Springer, Cham, 2017, pp. 457–463. · Zbl 06807243
[5] É. Remy, P. Ruet, and D. Thieffry, Graphic requirements for multistability and attractive cycles in a Boolean dynamical framework, Adv. in Appl. Math., 41 (2008), pp. 335–350. · Zbl 1169.05333
[6] A. Richard, An extension of a combinatorial fixed point theorem of Shih and Dong, Adv. in Appl. Math., 41 (2008), pp. 620–627. · Zbl 1185.05027
[7] A. Richard, Negative circuits and sustained oscillations in asynchronous automata networks, Adv. in Appl. Math., 44 (2010), pp. 378–392. · Zbl 1201.37117
[8] A. Richard, Local negative circuits and fixed points in non-expansive Boolean networks, Discrete Appl. Math., 159 (2011), pp. 1085–1093. · Zbl 1253.94082
[9] A. Richard and J.-P. Comet, Necessary conditions for multistationarity in discrete dynamical systems, Discrete Appl. Math., 155 (2007), pp. 2403–2413. · Zbl 1125.37062
[10] A. Richard and P. Ruet, From kernels in directed graphs to fixed points and negative cycles in Boolean networks, Discrete Appl. Math., 161 (2013), pp. 1106–1117. · Zbl 1315.05068
[11] P. Ruet, Local cycles and dynamical properties of Boolean networks, Math. Structures Comput. Sci., 26 (2016), pp. 702–718. · Zbl 1373.37035
[12] P. Ruet, Negative local feedbacks in Boolean networks, Discrete Appl. Math., 221 (2017), pp. 1–17. · Zbl 1357.05141
[13] M.-H. Shih and J.-L. Dong, A combinatorial analogue of the Jacobian problem in automata networks, Adv. in Appl. Math., 34 (2005), pp. 30–46. · Zbl 1060.05505
[14] D. Slepian, On the number of symmetry types of Boolean functions of n variables, Canad. J. Math, 5 (1953), pp. 185–193. · Zbl 0051.24802
[15] T. Tamura and T. Akutsu, Detecting a singleton attractor in a Boolean network utilizing SAT algorithms, IEICE Trans. Fundamentals of Electronics, Communications and Computer Sciences, E92-A (2009), pp. 493–501.
[16] R. Thomas, On the relation between the logical structure of systems and their ability to generate multiple steady states or sustained oscillations, in Numerical Methods in the Study of Critical Phenomena, Springer, Berlin, New York, 1981, pp. 180–193.
[17] E. Tonello, On the Conversion of Multivalued to Boolean Dynamics, preprint, , 2017. · Zbl 1411.92123
[18] P. L. Varela, I. Lynce, V. Manquinho, C. Chaouiya, and P. T. Monteiro, Stable states of Boolean regulatory networks composed over hexagonal grids, Electron. Notes Theor. Comput. Sci., 335 (2018), pp. 113–130.
[19] N. Wetzler, M. J. H. Heule, and W. A. Hunt, Drat-trim: Efficient checking and trimming using expressive clausal proofs, in Theory and Applications of Satisfiability Testing–SAT 2014. Lecture Notes in Comput. Sci., vol. 8561, Springer, Cham, 2014, pp. 422–429. · Zbl 1423.68475
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.