A remark on "Scalar equations for synchronous Boolean networks with biological Applications" by C. Farrow, J. Heidel, J. Maloney, and J. Rogers

Authors:
Qianchuan Zhao
Affiliations:
Dept. of Autom., Tsinghua Univ., Beijing, China
Venue:
IEEE Transactions on Neural Networks
Year:
2005

Citing 0
Cited 4

Brief paper: Controllability of Boolean control networks with time delays in states

Automatica (Journal of IFAC)
Observability of Boolean networks: A graph-theoretic approach

Automatica (Journal of IFAC)
Symbolic dynamics of Boolean control networks

Automatica (Journal of IFAC)
Construction of a Boolean model of gene and protein regulatory network with memory

Neural Networks

Quantified Score

Hi-index	0.01

Visualization

Abstract

The problem of finding all cycles in the exponentially growing state space of synchronous Boolean networks was studied in the paper by C. Farrow, J. Heidel, J. Maloney, and J. R. Scalar, "Equations for synchronous Boolean networks with biological applications," IEEE Trans. Neural Networks, vol. 15, no. 2, pp. 348-354 Mar. 2004. No efficient algorithm was given to solve the problem. We show that even the determination of the number of fixed points (cycles of length 1) for monotone Boolean networks and the determination of the existence of fixed points for general Boolean networks are both strong NP-complete.