Attractor separation and signed cycles in asynchronous Boolean networks
From MaRDI portal
Publication:2682936
DOI10.1016/j.tcs.2023.113706OpenAlexW4311697149MaRDI QIDQ2682936
Publication date: 1 February 2023
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2206.11651
Related Items (2)
Condition for periodic attractor in 4-dimensional repressilators ⋮ Attractor identification in asynchronous Boolean dynamics with network reduction
Uses Software
Cites Work
- Memoryless computation: new results, constructions, and extensions
- Relations between gene regulatory networks and cell dynamics in Boolean models
- Maximum number of fixed points in regulatory Boolean networks
- Negative circuits and sustained oscillations in asynchronous automata networks
- Fixed points and connections between positive and negative cycles in Boolean networks
- Discrete dynamical systems
- Computing maximal and minimal trap spaces of Boolean networks
- Modeling the pancreatic cancer microenvironment in search of control targets
- Control strategy identification via trap spaces in Boolean networks
- Minimal trap spaces of logical models are maximal siphons of their Petri net encoding
- Fixed points in conjunctive networks and maximal independent sets in graph contractions
- Necessary conditions for multistationarity in discrete dynamical systems
- On the notion of balance of a signed graph
- Multistationarity, the basis of cell differentiation and memory. II. Logical analysis of regulatory networks in terms of feedback circuits
- Asynchronous Dynamics of Boolean Automata Double-Cycles
- Reduction and Fixed Points of Boolean Networks and Linear Network Coding Solvability
- Network information flow
- Computing in permutation groups without memory
- Graph-Theoretical Constructions for Graph Entropy and Network Coding Based Communications
- Number of Fixed Points and Disjoint Cycles in Monotone Boolean Networks
- Neural networks and physical systems with emergent collective computational abilities.
- Minimal intervention strategies in logical signaling networks with ASP
- A logical calculus of the ideas immanent in nervous activity
- Unnamed Item
- Unnamed Item
This page was built for publication: Attractor separation and signed cycles in asynchronous Boolean networks
