A SAT-based algorithm for finding attractors in synchronous Boolean networks.
about
Logical Modeling and Dynamical Analysis of Cellular NetworksComputational Modeling, Formal Analysis, and Tools for Systems BiologyUsing synchronous Boolean networks to model several phenomena of collective behaviorCombining network modeling and gene expression microarray analysis to explore the dynamics of Th1 and Th2 cell regulation.Formal reasoning about systems biology using theorem proving.ADAM: analysis of discrete models of biological systems using computer algebra.Application of Max-SAT-based ATPG to optimal cancer therapy design.Controllability of time-delayed Boolean multiplex control networks under asynchronous stochastic update.Dynamics of random Boolean networks under fully asynchronous stochastic update based on linear representation.Model checking to assess T-helper cell plasticity.A parallel attractor-finding algorithm based on Boolean satisfiability for genetic regulatory networks.Steady state analysis of Boolean molecular network models via model reduction and computational algebra.An Efficient Steady-State Analysis Method for Large Boolean Networks with High Maximum Node Connectivity.Boolean modeling: a logic-based dynamic approach for understanding signaling and regulatory networks and for making useful predictions.ASP-based method for the enumeration of attractors in non-deterministic synchronous and asynchronous multi-valued networks.Boolean modeling techniques for protein co-expression networks in systems medicine.The TOL network of Pseudomonas putida mt-2 processes multiple environmental inputs into a narrow response space.Approximating Attractors of Boolean Networks by Iterative CTL Model Checking.ASP-G: an ASP-based method for finding attractors in genetic regulatory networks.Formal methods for Hopfield-like networks.A Network Model to Explore the Effect of the Micro-environment on Endothelial Cell Behavior during Angiogenesis.Stability of Signaling Pathways during Aging-A Boolean Network Approach.Boolean network modeling in systems pharmacology.Composition and abstraction of logical regulatory modules: application to multicellular systems.Cooperative development of logical modelling standards and tools with CoLoMoTo.Controllability of Boolean networks via input controls under Harvey's update scheme.Griffin: A Tool for Symbolic Inference of Synchronous Boolean Molecular Networks.Automatic Screening for Perturbations in Boolean Networks.Simulating heterogeneous populations using Boolean models.CANA: A Python Package for Quantifying Control and Canalization in Boolean Networks
P2860
Q26745955-4ECBBA51-8806-430A-B5B2-0E7AFD3A07DBQ26770169-59A01F38-9FAF-428B-9FC7-B15775974134Q27320472-AD69A1E8-66D7-48FC-B5CE-E417B9B2C027Q33780986-F304CF9A-501C-44EE-AE60-039F772A9933Q33865794-CF28783F-1E49-4433-B6C5-2E04453C83D7Q33966533-C5CC399E-8301-4C0A-AD43-1F654CBC210AQ34470391-BCB1BE64-5A1D-47B6-BDD5-8A44D48FC7CBQ34719783-1D8BC5FF-99B7-4DCE-B02F-7AAB92B1632BQ34778927-66CD9B34-38B5-43F5-AD80-506E5043085FQ35022296-A65635F0-0C7B-473A-BA90-B827198B4847Q35144313-4B34D04D-A61D-4298-ADBA-F344DBB7FE71Q35194958-5B6A050F-95F6-47D4-93FB-0F04B7322640Q35881573-FC5D4672-7389-426B-84E9-FD50CEDAADECQ38255571-C4F3D72A-BD26-496E-87B2-110ED4D593C0Q38372098-35DA02E5-F543-4A84-B595-630E160B0EB9Q39830074-589726B7-2E93-463B-8D13-F349A54E51A0Q40076031-90E36A18-D710-4BAB-A30D-AC272E1B8758Q40460338-2636A6E8-5637-44F4-9235-2C6AD3569301Q42025268-3056E737-FA9B-4E80-9611-CAD888E39B40Q43664110-804F052D-E12C-49B2-A38B-9E0D253139F3Q47121826-7615D6AE-B410-4FFB-AC63-182CE1EEDC83Q47142471-E83AC60E-5317-44C8-A825-A33256FB979EQ47226889-0D99BD32-4AF0-4594-AF79-D43EE5922D45Q47922476-B6D6E5FE-E596-4455-A212-7F911806A754Q48621887-4BA4AF5D-7B4C-4370-8D6E-BA8D511F5E58Q50701371-11FA6CD8-0E8C-405E-9FEE-80EB67605F63Q52645925-615912A9-11EB-4BA6-B50F-99A5C3F92D71Q55379459-9A543642-93C2-4EDF-9510-859DAAFC2EB0Q55421549-3EB893B4-CE39-4681-837C-7AC13681147BQ58781188-0527B425-6404-49EA-8F88-00F118005B79
P2860
A SAT-based algorithm for finding attractors in synchronous Boolean networks.
description
2011 nî lūn-bûn
@nan
2011年の論文
@ja
2011年学术文章
@wuu
2011年学术文章
@zh
2011年学术文章
@zh-cn
2011年学术文章
@zh-hans
2011年学术文章
@zh-my
2011年学术文章
@zh-sg
2011年學術文章
@yue
2011年學術文章
@zh-hant
name
A SAT-based algorithm for finding attractors in synchronous Boolean networks.
@en
A SAT-based algorithm for finding attractors in synchronous Boolean networks.
@nl
type
label
A SAT-based algorithm for finding attractors in synchronous Boolean networks.
@en
A SAT-based algorithm for finding attractors in synchronous Boolean networks.
@nl
prefLabel
A SAT-based algorithm for finding attractors in synchronous Boolean networks.
@en
A SAT-based algorithm for finding attractors in synchronous Boolean networks.
@nl
P356
P1476
A SAT-based algorithm for finding attractors in synchronous Boolean networks.
@en
P2093
Elena Dubrova
Maxim Teslenko
P304
P356
10.1109/TCBB.2010.20
P577
2011-09-01T00:00:00Z