Issue No. 01 - January/February (2012 vol. 9)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TCBB.2011.61
B. Vasic , Dept. of Electr. & Comput. Eng., Univ. of Arizona, Tucson, AZ, USA
V. Ravanmehr , Dept. of Electr. & Comput. Eng., Univ. of Arizona, Tucson, AZ, USA
A. R. Krishnan , Western Digital Corp., Irvine, CA, USA
We introduce a class of finite systems models of gene regulatory networks exhibiting behavior of the cell cycle. The network is an extension of a Boolean network model. The system spontaneously cycles through a finite set of internal states, tracking the increase of an external factor such as cell mass, and also exhibits checkpoints in which errors in gene expression levels due to cellular noise are automatically corrected. We present a 7-gene network based on Projective Geometry codes, which can correct, at every given time, one gene expression error. The topology of a network is highly symmetric and requires using only simple Boolean functions that can be synthesized using genes of various organisms. The attractor structure of the Boolean network contains a single cycle attractor. It is the smallest nontrivial network with such high robustness. The methodology allows construction of artificial gene regulatory networks with the number of phases larger than in natural cell cycle.
Gene expression, Mathematical model, Proteins, Robustness, Noise, Boolean functions, Logic gates
B. Vasic, V. Ravanmehr and A. R. Krishnan, "An Information Theoretic Approach to Constructing Robust Boolean Gene Regulatory Networks," in IEEE/ACM Transactions on Computational Biology and Bioinformatics, vol. 9, no. 1, pp. 52-65, 2011.