Relating bisimulations with attractors in Boolean network models

DOI10.1007/978-3-319-38827-4_2MaRDI QIDQ2823013zbMATH OpenOpenAlexFDO

Authors Daniel R. Figueiredo

Publication date 6 October 2016

Published in Algorithms for Computational Biology (Search for Journal in Brave)

Copyright license Creative Commons Attribution-NonCommercial 4.0 International

Full work available at URL https://doi.org/10.1007/978-3-319-38827-4_2

zbMATH Keywords

biological regulatory networksbisimulationminimization of models

Mathematics Subject Classification ID

Applications of graph theory (05C90) Systems biology, networks (92C42)

Recommendations

• Attractors in Boolean networks: a tutorial
• Reduction and analysis of Boolean control networks by bisimulation
• A reduction method for Boolean network models proven to conserve attractors
• Steady state analysis of Boolean models: a dimension reduction approach
• P\(_-\)UNSAT approach of attractor calculation for Boolean gene regulatory networks

Cites work

• Hierarchy of models: From qualitative to quantitative analysis of circadian rhythms in cyanobacteria
• Interconnection of asynchronous Boolean networks, asymptotic and transient dynamics
• Logical analysis of hybrid systems. Proving theorems for complex dynamics.
• Modal logic
• Multistationarity, the basis of cell differentiation and memory. II: Logical analysis of regulatory networks in terms of feedback circuits

Cited in

(4)

• Reducing Boolean networks with backward Boolean equivalence
• Optimising attractor computation in Boolean automata networks
• Applying differential dynamic logic to reconfigurable biological networks
• Attractor Equivalence: An Observational Semantics for Reaction Networks

This page was built for publication: Relating bisimulations with attractors in Boolean network models

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2823013)