Limit cycles and update digraphs in Boolean networks
From MaRDI portal
Recommendations
Cited in
(20)- Function perturbations in Boolean networks with its application in a \textit{D. melanogaster} gene network
- Combinatorics on update digraphs in Boolean networks
- \#P-completeness of counting update digraphs, cacti, and series-parallel decomposition method
- Complexity of limit-cycle problems in Boolean networks
- Disjunctive networks and update schedules
- Sequentialization and procedural complexity in automata networks
- On the number of different dynamics in Boolean networks with deterministic update schedules
- Sequential operator for filtering cycles in Boolean networks
- Multi-Stability, Limit Cycles, and Period-Doubling Bifurcation with Reaction Systems
- Block-sequential update schedules and Boolean automata circuits
- Cycles of periodically time-variant Boolean networks
- Existence and non existence of limit cycles in Boolean networks
- On the number of update digraphs and its relation with the feedback arc sets and tournaments
- About block-parallel Boolean networks: a position paper
- Stability structures of conjunctive Boolean networks
- Dynamically equivalent disjunctive networks
- Frustration and stability in random Boolean networks
- Complexity of limit cycles with block-sequential update schedules in conjunctive networks
- Non-deterministic updates of Boolean networks
- On Boolean automata networks (de)composition
This page was built for publication: Limit cycles and update digraphs in Boolean networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1759857)
