Singleton and 2-periodic attractors of sign-definite Boolean networks
From MaRDI portal
Publication:763485
DOI10.1016/j.ipl.2011.10.002zbMath1233.68176MaRDI QIDQ763485
Takeyuki Tamura, Tatsuya Akutsu, Avraham A. Melkman
Publication date: 9 March 2012
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2011.10.002
68R10: Graph theory (including graph drawing) in computer science
Related Items
Cites Work
- Determining a singleton attractor of an AND/OR Boolean network in \(O(n^{1.587})\) time
- Maximum number of fixed points in regulatory Boolean networks
- Sequential operator for filtering cycles in Boolean networks
- On the distribution of the number of monotone Boolean functions relative to the number of lower units