Analysis and characterization of asynchronous state transition graphs using extremal states
From MaRDI portal
Recommendations
- Dynamical modeling and analysis of large cellular regulatory networks
- Local Structure and Behavior of Boolean Bioregulatory Networks
- Computational Methods in Systems Biology
- Dynamically consistent reduction of logical regulatory graphs
- Relating Attractors and Singular Steady States in the Logical Analysis of Bioregulatory Networks
Cites work
- scientific article; zbMATH DE number 50840 (Why is no real title available?)
- Analysis of discrete bioregulatory networks using symbolic steady states
- Behaviour Preservation of a Biological Regulatory Network when Embedded into a Larger Network
- Dynamically consistent reduction of logical regulatory graphs
- Embedding of biological regulatory networks and property preservation
- From structure to dynamics: frequency tuning in the p53-Mdm2 network. I: Logical approach
- Graphic requirements for multistability and attractive cycles in a Boolean dynamical framework
- Mapping multivalued onto Boolean dynamics
- Maximum number of fixed points in regulatory Boolean networks
- Multistationarity, the basis of cell differentiation and memory. II: Logical analysis of regulatory networks in terms of feedback circuits
- Reduction of Boolean network models
- Uncovering operational interactions in genetic networks using asynchronous Boolean dynamics
Cited in
(3)
This page was built for publication: Analysis and characterization of asynchronous state transition graphs using extremal states
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q371981)