Pages that link to "Item:Q1786541"
From MaRDI portal
The following pages link to Reduction of Boolean network models (Q1786541):
Displaying 39 items.
- Models and algorithms for network reduction (Q320811) (← links)
- Analysis and characterization of asynchronous state transition graphs using extremal states (Q371981) (← links)
- An abstraction theory for qualitative models of biological systems (Q418848) (← links)
- Logical reduction of biological networks to their most determinative components (Q517994) (← links)
- Dynamically consistent reduction of logical regulatory graphs (Q533364) (← links)
- An efficient approach of attractor calculation for large-scale Boolean gene regulatory networks (Q727138) (← links)
- Uncovering operational interactions in genetic networks using asynchronous Boolean dynamics (Q1625862) (← links)
- P\(_-\)UNSAT approach of attractor calculation for Boolean gene regulatory networks (Q1642530) (← links)
- Attractor analysis of asynchronous Boolean models of signal transduction networks (Q1726130) (← links)
- Reduction mappings between probabilistic Boolean networks (Q1773704) (← links)
- Reduction techniques for network validation in systems biology (Q1790877) (← links)
- \(l_{1}\)-gain analysis and model reduction problem for Boolean control networks (Q1991835) (← links)
- Modeling the pancreatic cancer microenvironment in search of control targets (Q2051435) (← links)
- An extension of ERODE to reduce Boolean networks by backward Boolean equivalence (Q2112170) (← links)
- Bilevel integer programming on a Boolean network for discovering critical genetic alterations in cancer development and therapy (Q2116889) (← links)
- Reducing Boolean networks with backward Boolean equivalence (Q2142096) (← links)
- Piecewise linear and Boolean models of chemical reaction networks (Q2254670) (← links)
- Design of fixed points in Boolean networks using feedback vertex sets and model reduction (Q2325214) (← links)
- The number of fixed points of AND-OR networks with chain topology (Q2326861) (← links)
- Boolean network analysis through the joint use of linear algebra and algebraic geometry (Q2415824) (← links)
- Dimension reduction of large sparse AND-NOT network models (Q2520671) (← links)
- An effective network reduction approach to find the dynamical repertoire of discrete dynamic networks (Q2787871) (← links)
- Steady state analysis of Boolean models: a dimension reduction approach (Q2811732) (← links)
- AND-NOT logic framework for steady state analysis of Boolean network models (Q2842909) (← links)
- A reduction method for Boolean network models proven to conserve attractors (Q2871385) (← links)
- SIMPLIFYING BOOLEAN NETWORKS (Q3373074) (← links)
- Attractor controllability of Boolean networks by flipping a subset of their nodes (Q4565983) (← links)
- Algebraic Models and Their Use in Systems Biology (Q4979491) (← links)
- Algebraic method of simplifying Boolean networks using semi‐tensor product of Matrices (Q5131092) (← links)
- Model Reductions for Inference: Generality of Pairwise, Binary, and Planar Factor Graphs (Q5378213) (← links)
- Reduction and Analysis of Boolean Control Networks by Bisimulation (Q5858102) (← links)
- بررسی موردی حساسیت و توپولوژی گرههای شبکههای بولی کاهشیافته (Q5868326) (← links)
- Phenotype control techniques for Boolean gene regulatory networks (Q6053028) (← links)
- A Unified Approach to Reverse Engineering and Data Selection for Unique Network Identification (Q6151663) (← links)
- The maximal coordination principle in regulatory Boolean networks (Q6152183) (← links)
- A polynomial-time criterion for stability of large-scale switched conjunctive Boolean networks (Q6537294) (← links)
- Stability analysis of large-scale Boolean networks via compositional method (Q6537353) (← links)
- Reduction for asynchronous Boolean networks: elimination of negatively autoregulated components (Q6599812) (← links)
- Set reachability of Markovian jump Boolean networks and its applications (Q6609061) (← links)
