Abstract
We consider the following question on the relationship between the asymptotic behaviors of asynchronous dynamics of Boolean networks and their regulatory structures: Does the presence of a cyclic a...
Highlights
Boolean networks are used to model the dynamics resulting from the interactions between n regulatory components that can assume only two values, 0 and 1, and are naturally described as maps from {0, 1}n to itself
We describe how Question 1.1 can be translated into a Boolean satisfiability problem (SAT)
We show that the problem can be approached as a Boolean satisfiability problem, and find that all maps from
Summary
Boolean networks are used to model the dynamics resulting from the interactions between n regulatory components that can assume only two values, 0 and 1, and are naturally described as maps from {0, 1}n to itself. Regulatory graph, local negative circuits, cyclic attractors, asynchronous dynamics Does the absence of fixed points imply the existence of a local negative circuit in the regulatory graph?
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
