Discrimination of singleton and periodic attractors in Boolean networks
From MaRDI portal
(Redirected from Publication:1680922)
Recommendations
- Discrimination of attractors with noisy nodes in Boolean networks
- Attractors in Boolean networks: a tutorial
- An Improved Algorithm for Detecting a Singleton Attractor in a Boolean Network Consisting of AND/OR Nodes
- An O(1.787 n )-Time Algorithm for Detecting a Singleton Attractor in a Boolean Network Consisting of AND/OR Nodes
- Singleton and 2-periodic attractors of sign-definite Boolean networks
Cites work
- scientific article; zbMATH DE number 46700 (Why is no real title available?)
- An analytical study of the number of steady states in gene regulatory networks
- An effective network reduction approach to find the dynamical repertoire of discrete dynamic networks
- Analysis and control of Boolean networks. A semi-tensor product approach.
- Attractor analysis of asynchronous Boolean models of signal transduction networks
- Candidate keys for relations
- Controllability and observability of Boolean networks arising from biology
- Dynamics and control at feedback vertex sets. II: A faithful monitor to determine the diversity of molecular activities in regulatory networks
- Maximum number of fixed points in regulatory Boolean networks
- Observability of Boolean networks: a graph-theoretic approach
- Observability of complex systems
- Superpolynomial growth in the number of attractors in Kauffman networks
Cited in
(3)
This page was built for publication: Discrimination of singleton and periodic attractors in Boolean networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1680922)