Analysis of discrete bioregulatory networks using symbolic steady states
From MaRDI portal
Publication:542031
DOI10.1007/s11538-010-9609-1zbMath1214.92033OpenAlexW2085885352WikidataQ51623368 ScholiaQ51623368MaRDI QIDQ542031
Publication date: 8 June 2011
Published in: Bulletin of Mathematical Biology (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11538-010-9609-1
Related Items (6)
On circuit functionality in Boolean networks ⋮ Analysis and characterization of asynchronous state transition graphs using extremal states ⋮ Dynamics of gene regulatory networks with stochastic propensities ⋮ Bio-Logics: Logical Analysis of Bioregulatory Networks ⋮ Computing maximal and minimal trap spaces of Boolean networks ⋮ Algebraic methods in mathematical biology
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Deriving behavior of Boolean bioregulatory networks from subnetwork dynamics
- Graphic requirements for multistability and attractive cycles in a Boolean dynamical framework
- Positive circuits and maximal number of fixed points in discrete dynamical systems
- A survey of the theory of hypercube graphs
- The modular structure of Kauffman networks
- Nested canalyzing, unate cascade, and polynomial functions
- Necessary conditions for multistationarity in discrete dynamical systems
- Multistationarity, the basis of cell differentiation and memory. II. Logical analysis of regulatory networks in terms of feedback circuits
- USING GRAPH CONCEPTS TO UNDERSTAND THE ORGANIZATION OF COMPLEX SYSTEMS
- Relating Attractors and Singular Steady States in the Logical Analysis of Bioregulatory Networks
This page was built for publication: Analysis of discrete bioregulatory networks using symbolic steady states