2014
DOI: 10.1007/978-3-319-11520-7_59
|View full text |Cite
|
Sign up to set email alerts
|

Computing Symbolic Steady States of Boolean Networks

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

1
38
0

Year Published

2014
2014
2024
2024

Publication Types

Select...
4
3
1

Relationship

0
8

Authors

Journals

citations
Cited by 27 publications
(39 citation statements)
references
References 9 publications
1
38
0
Order By: Relevance
“…The efficient identification of cyclical attractors and complex attractors remain a challenging problem, especially as these attractors can depend on the updating mode. Stable patterns have recently been proposed as an approximation of complex attractors, which can be identified efficiently and does not depend on the updating mode [17,40]. Here, a pattern is a partially-defined state where some components have a fixed activity level, while others are undefined.…”
Section: Identification Of Attractorsmentioning
confidence: 99%
See 1 more Smart Citation
“…The efficient identification of cyclical attractors and complex attractors remain a challenging problem, especially as these attractors can depend on the updating mode. Stable patterns have recently been proposed as an approximation of complex attractors, which can be identified efficiently and does not depend on the updating mode [17,40]. Here, a pattern is a partially-defined state where some components have a fixed activity level, while others are undefined.…”
Section: Identification Of Attractorsmentioning
confidence: 99%
“…BioLQM proposes an adapted version of the method implemented in PyBoolNet [17,18] using the clingo ASP solver [13], and introduces a new alternative implementation based on decision diagrams.…”
Section: Identification Of Attractorsmentioning
confidence: 99%
“…Different update strategies yield different dynamics, with subtleties: steady-state attractors are the same both for synchronous and asynchronous updates of a Boolean Network [19,3]. Stable motifs [100] and trap spaces [46,47], that is, trap sets with particularly simple dynamics, are also independent of the particular updating schedule strategy.…”
Section: The Basics Of Boolean Networkmentioning
confidence: 99%
“…This expansion method is closely related to the translation from [17], although the latter heavily relies on either read-arcs or inhibitory arcs to preserve the dynamics. Similarly, the unique prime implicant graph of a Boolean Network is a B-hypergraph [46,47], and can easily be translated into a Petri Net structure or into a graph with composite nodes. It should be further investigated how this translation preserves the dynamics.…”
Section: Comparing Different Formalisms: a Perspectivementioning
confidence: 99%
“…The notion of stability has been generalised from single states to sub-spaces of states Siebert (2011) with applications in model reduction and attractor detection. Like stable states, stable subspaces are independent of the updating policy and can be computed by constraint-solving methods Klarner et al (2014).…”
Section: Logical Modellingmentioning
confidence: 99%