2019
DOI: 10.1016/j.jtbi.2018.11.028
|View full text |Cite
|
Sign up to set email alerts
|

Positive and negative cycles in Boolean networks

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
23
0

Year Published

2019
2019
2023
2023

Publication Types

Select...
4
3
1

Relationship

1
7

Authors

Journals

citations
Cited by 22 publications
(23 citation statements)
references
References 65 publications
0
23
0
Order By: Relevance
“…For example, negative influence manifests as interlayer hyperedges. Thus, it follows from theorem 19 of ( 46 ) that if a Boolean system’s interaction graph lacks negative feedback loops and has no paths of opposite sign between any two nodes, then there is a change of variables that disconnects the parity layers from one another.…”
Section: Methodsmentioning
confidence: 99%
See 1 more Smart Citation
“…For example, negative influence manifests as interlayer hyperedges. Thus, it follows from theorem 19 of ( 46 ) that if a Boolean system’s interaction graph lacks negative feedback loops and has no paths of opposite sign between any two nodes, then there is a change of variables that disconnects the parity layers from one another.…”
Section: Methodsmentioning
confidence: 99%
“…Genome-scale models can have thousands of variables, resulting in many more states (~10 300 to ~10 9000 ) than Planck volumes in the observable universe (~10 185 ). This challenge has motivated decades of research analyzing discrete dynamics without exhaustive state-space searches ( 44 ), for example, by analyzing how feedback loops in the interaction network constrain dynamics ( 45 , 46 ). While the body of research regarding how network structure constrains dynamics has proven invaluable, note that multiple Boolean systems are compatible with each interaction network.…”
Section: Introductionmentioning
confidence: 99%
“…A feedback vertex set (FVS) is a collection of nodes in a network whose removal results in a network with no cycles (no feedback loops). On a network with no feedback loops, dynamical processes described by Boolean or differential equation models have a single attractor [24,26]. FVS control thus predicts that by fixing all nodes in a given FVS, as well as all source nodes, to match a particular attractor, one can force the system from any state into that attractor [27].…”
Section: Feedback Vertex Set Controlmentioning
confidence: 99%
“…A feedback vertex set (FVS) is a collection of nodes in a network whose removal results in a network with no cycles (no feedback loops). On a network with no feedback loops, dynamical processes described by Boolean or differential equation models have a single attractor [22,24] . FVS control thus predicts that by fixing all nodes in a given FVS, as well as all source nodes, to match a particular attractor, one can force the system from any state into that attractor [25] .…”
Section: Feedback Vertex Set Controlmentioning
confidence: 99%