Reduction of Boolean network models
From MaRDI portal
Publication:1786541
DOI10.1016/J.JTBI.2011.08.042zbMATH Open1397.92265OpenAlexW2113268441WikidataQ51533103 ScholiaQ51533103MaRDI QIDQ1786541FDOQ1786541
Recommendations
- A reduction method for Boolean network models proven to conserve attractors
- Reducing Boolean networks with backward Boolean equivalence
- A case study of the sensitivity and topology of nodes of reduced Boolean networks
- Dynamically consistent reduction of logical regulatory graphs
- Steady state analysis of Boolean models: a dimension reduction approach
Cites Work
Cited In (41)
- Steady state analysis of Boolean models: a dimension reduction approach
- Design of fixed points in Boolean networks using feedback vertex sets and model reduction
- Uncovering operational interactions in genetic networks using asynchronous Boolean dynamics
- An extension of ERODE to reduce Boolean networks by backward Boolean equivalence
- Reducing Boolean networks with backward Boolean equivalence
- A Unified Approach to Reverse Engineering and Data Selection for Unique Network Identification
- The maximal coordination principle in regulatory Boolean networks
- Bilevel integer programming on a Boolean network for discovering critical genetic alterations in cancer development and therapy
- An abstraction theory for qualitative models of biological systems
- Set reachability of Markovian jump Boolean networks and its applications
- Reduction for asynchronous Boolean networks: elimination of negatively autoregulated components
- \(l_{1}\)-gain analysis and model reduction problem for Boolean control networks
- Reduction mappings between probabilistic Boolean networks
- Phenotype control techniques for Boolean gene regulatory networks
- An efficient approach of attractor calculation for large-scale Boolean gene regulatory networks
- P\(_-\)UNSAT approach of attractor calculation for Boolean gene regulatory networks
- Dimension reduction of large sparse AND-NOT network models
- Piecewise linear and Boolean models of chemical reaction networks
- SIMPLIFYING BOOLEAN NETWORKS
- A reduction method for Boolean network models proven to conserve attractors
- A case study of the sensitivity and topology of nodes of reduced Boolean networks
- Models and algorithms for network reduction
- AND-NOT logic framework for steady state analysis of Boolean network models
- Reduction and analysis of Boolean control networks by bisimulation
- Goal-oriented reduction of automata networks
- Modeling the pancreatic cancer microenvironment in search of control targets
- Attractor identification in asynchronous Boolean dynamics with network reduction
- Reduction techniques for network validation in systems biology
- Attractor analysis of asynchronous Boolean models of signal transduction networks
- Algebraic method of simplifying Boolean networks using semi-tensor product of matrices
- Analysis and characterization of asynchronous state transition graphs using extremal states
- An effective network reduction approach to find the dynamical repertoire of discrete dynamic networks
- Boolean network analysis through the joint use of linear algebra and algebraic geometry
- Dynamically consistent reduction of logical regulatory graphs
- Attractor controllability of Boolean networks by flipping a subset of their nodes
- A polynomial-time criterion for stability of large-scale switched conjunctive Boolean networks
- Stability analysis of large-scale Boolean networks via compositional method
- Logical reduction of biological networks to their most determinative components
- Model Reductions for Inference: Generality of Pairwise, Binary, and Planar Factor Graphs
- Algebraic Models and Their Use in Systems Biology
- The number of fixed points of AND-OR networks with chain topology
This page was built for publication: Reduction of Boolean network models
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1786541)
