On the number of different dynamics in Boolean networks with deterministic update schedules
From MaRDI portal
Publication:1950225
DOI10.1016/j.mbs.2013.01.007zbMath1402.92195OpenAlexW1975054980WikidataQ43791137 ScholiaQ43791137MaRDI QIDQ1950225
Julio Aracena, E. Fanchon, Jacques Demongeot, Marco Montalva
Publication date: 10 May 2013
Published in: Mathematical Biosciences (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/10533/130702
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (5)
Complexity of limit-cycle problems in Boolean networks ⋮ Deconstruction and dynamical robustness of regulatory networks: application to the yeast cell cycle networks ⋮ About block-parallel Boolean networks: a position paper ⋮ Sequentialization and procedural complexity in automata networks ⋮ \#P-completeness of counting update digraphs, cacti, and series-parallel decomposition method
This page was built for publication: On the number of different dynamics in Boolean networks with deterministic update schedules
