SIMPLIFYING BOOLEAN NETWORKS
From MaRDI portal
Publication:3373074
Recommendations
- Reduction of Boolean network models
- Reducing Boolean networks with backward Boolean equivalence
- scientific article; zbMATH DE number 42045
- scientific article; zbMATH DE number 769371
- On Negations in Boolean Networks
- Simplification of graph structure with the aid of boolean matrices
- Algebraic method of simplifying Boolean networks using semi-tensor product of matrices
- scientific article; zbMATH DE number 1630006
- Reduction mappings between probabilistic Boolean networks
- On the Complexity of Negation-Limited Boolean Networks
Cites work
- scientific article; zbMATH DE number 42045 (Why is no real title available?)
- scientific article; zbMATH DE number 107541 (Why is no real title available?)
- Attraction basins in discretized maps
- Closing probabilities in the Kauffman model: An annealed computation
- Relevant elements, magnetization and dynamical properties in Kauffman networks: A numerical study
- The modular structure of Kauffman networks
Cited in
(7)- Attractor analysis of asynchronous Boolean models of signal transduction networks
- Entropy analysis of Boolean network reduction according to the determinative power of nodes
- \(l_{1}\)-gain analysis and model reduction problem for Boolean control networks
- scientific article; zbMATH DE number 176876 (Why is no real title available?)
- A case study of the sensitivity and topology of nodes of reduced Boolean networks
- Reducing Boolean networks with backward Boolean equivalence
- Finding attractors in asynchronous Boolean dynamics
This page was built for publication: SIMPLIFYING BOOLEAN NETWORKS
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3373074)
