Limit cycles and update digraphs in Boolean networks
From MaRDI portal
Publication:1759857
DOI10.1016/j.dam.2012.07.003zbMath1254.05062OpenAlexW1999736765MaRDI QIDQ1759857
Publication date: 22 November 2012
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2012.07.003
Related Items (8)
Complexity of limit-cycle problems in Boolean networks ⋮ Function perturbations in Boolean networks with its application in a \textit{D. melanogaster} gene network ⋮ About block-parallel Boolean networks: a position paper ⋮ Multi-Stability, Limit Cycles, and Period-Doubling Bifurcation with Reaction Systems ⋮ On Boolean Automata Networks (de)Composition1 ⋮ Sequentialization and procedural complexity in automata networks ⋮ Existence and non existence of limit cycles in Boolean networks ⋮ \#P-completeness of counting update digraphs, cacti, and series-parallel decomposition method
This page was built for publication: Limit cycles and update digraphs in Boolean networks
