Exact enumeration of fixed points of AND-OR-NAND-NOR Boolean networks
Open Access
- 13 March 2025
- journal article
- Published by Elsevier in Chaos, Solitons & Fractals
- Vol. 195
Abstract
No abstract availableFunding Information
- Junta de Comunidades de Castilla-La Mancha (SBPLY/21/180501/000174)
- European Regional Development Fund
- University of Castilla-La Mancha (2022-GRIN-34473, 2022-GRIN-34437)
This publication has 29 references indexed in Scilit:
- Attractor detection and enumeration algorithms for Boolean networksComputational and Structural Biotechnology Journal, 2022
- Existence, coexistence and uniqueness of fixed points in parallel and sequential dynamical systems over directed graphsCommunications in Nonlinear Science and Numerical Simulation, 2021
- Graphical dynamical systems and their applications to bio-social systemsInternational Journal of Advances in Engineering Sciences and Applied Mathematics, 2018
- Maximum number of fixed points in AND–OR–NOT networksJournal of Computer and System Sciences, 2014
- Parallel discrete dynamical systems on independent local functionsJournal of Computational and Applied Mathematics, 2013
- Reduction of Boolean network modelsJournal of Theoretical Biology, 2011
- On the robustness of update schedules in Boolean networksBioSystems, 2009
- Discrete dynamical systems on graphs and Boolean functionsMathematics and Computers in Simulation, 2004
- Signed graphsDiscrete Applied Mathematics, 1982
- Boolean formalization of genetic control circuitsJournal of Theoretical Biology, 1973