Deconstruction and dynamical robustness of regulatory networks: application to the yeast cell cycle networks
From MaRDI portal
Publication:371984
DOI10.1007/s11538-012-9794-1zbMath1272.92017OpenAlexW2063615892WikidataQ46717435 ScholiaQ46717435MaRDI QIDQ371984
Gonzalo A. Ruz, Marco Montalva, Eric Goles Chacc
Publication date: 11 October 2013
Published in: Bulletin of Mathematical Biology (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/10533/128392
Cell biology (92C37) Computational methods for problems pertaining to biology (92-08) Systems biology, networks (92C42)
Related Items (9)
Dynamics of neural networks over undirected graphs ⋮ Attractor stability in finite asynchronous biological system models ⋮ Generation and robustness of Boolean networks to model \textit{Clostridium difficile} infection ⋮ Attractor landscapes in Boolean networks with firing memory: a theoretical study applied to genetic networks ⋮ Maximum sensitivity to update schedules of elementary cellular automata over infinite configurations ⋮ Logical reduction of biological networks to their most determinative components ⋮ Eric Goles ⋮ Analyzing Boolean networks through unsupervised learning ⋮ Existence and non existence of limit cycles in Boolean networks
Cites Work
- Disjunctive networks and update schedules
- Comparison between parallel and serial dynamics of Boolean networks
- Logical analysis of the budding yeast cell cycle
- The transition from differential equations to Boolean networks: A case study in simplifying a regulatory network model
- On the number of different dynamics in Boolean networks with deterministic update schedules
- REDUCTION OF DISCRETE DYNAMICAL SYSTEMS OVER GRAPHS
- Basic Results for the Behaviour of Discrete Iterations
This page was built for publication: Deconstruction and dynamical robustness of regulatory networks: application to the yeast cell cycle networks
