On circuit functionality in Boolean networks
From MaRDI portal
Recommendations
- Graphic requirements for multistability and attractive cycles in a Boolean dynamical framework
- Graphic requirements for multiple attractive cycles in Boolean dynamical systems
- Positive and negative circuits in dynamical systems
- Necessary conditions for multistationarity in discrete dynamical systems
- Local negative circuits and cyclic attractors in Boolean networks with at most five components
Cites work
- scientific article; zbMATH DE number 2144779 (Why is no real title available?)
- A combinatorial analogue of the Jacobian problem in automata networks
- Analysis of discrete bioregulatory networks using symbolic steady states
- Combinatorics of Boolean automata circuits dynamics
- Deriving behavior of Boolean bioregulatory networks from subnetwork dynamics
- Dynamical behaviour of biological regulatory networks. I: Biological role of feedback loops and practical use of the concept of the loop- characteristic state
- Fixed points and maximal independent sets in AND-OR networks
- Graphic requirements for multistability and attractive cycles in a Boolean dynamical framework
- Local negative circuits and fixed points in non-expansive Boolean networks
- Logical identification of all steady states: The concept of feedback loop characteristic states
- 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
- Necessary conditions for multistationarity and stable periodicity
- Necessary conditions for multistationarity in discrete dynamical systems
- Negative circuits and sustained oscillations in asynchronous automata networks
- Positive and negative circuits in dynamical systems
- Positive or negative regulatory circuit inference from multilevel dynamics
Cited in
(22)- Dynamics of circuits and intersecting circuits
- Local negative circuits and cyclic attractors in Boolean networks with at most five components
- Attractor separation and signed cycles in asynchronous Boolean networks
- Graphic requirements for multiple attractive cycles in Boolean dynamical systems
- scientific article; zbMATH DE number 176876 (Why is no real title available?)
- Design of a network with state stability
- Necessary conditions for multistationarity in discrete dynamical systems
- scientific article; zbMATH DE number 4035618 (Why is no real title available?)
- scientific article; zbMATH DE number 4204280 (Why is no real title available?)
- scientific article; zbMATH DE number 4045650 (Why is no real title available?)
- Dynamics of transcription-translation networks
- Cycles of functioning for discrete models of a regulatory circuit of a gene network with threshold functions
- Reduction for asynchronous Boolean networks: elimination of negatively autoregulated components
- Hyperchaos \& labyrinth chaos: revisiting Thomas-Rössler systems
- A general model of binary opinions updating
- A circuit-preserving mapping from multilevel to Boolean dynamics
- Frustration and stability in random Boolean networks
- Using Flexibility in P-Circuits by Boolean Relations
- On logical bifurcation diagrams
- On the influence of the interaction graph on a finite dynamical system
- On the conversion of multivalued to Boolean dynamics
- Graphic requirements for multistability and attractive cycles in a Boolean dynamical framework
This page was built for publication: On circuit functionality in Boolean networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q371977)
