Evolution in asynchronous cellular automata
ICAL 2003 Proceedings of the eighth international conference on Artificial life
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
CEC'09 Proceedings of the Eleventh conference on Congress on Evolutionary Computation
The holland broadcast language and the modeling of biochemical networks
EuroGP'07 Proceedings of the 10th European conference on Genetic programming
A sequence-to-function map for ribozyme-catalyzed metabolisms
ECAL'09 Proceedings of the 10th European conference on Advances in artificial life: Darwin meets von Neumann - Volume Part II
Hi-index | 0.00 |
Boolean models of genetic regulatory networks (GRNs) have been shown to exhibit many of the characteristic dynamics of real GRNs, with gene expression patterns settling to point attractors or limit cycles, or displaying chaotic behaviour, depending upon the connectivity of the network and the relative proportions of excitatory and inhibitory interactions. This range of behaviours is only apparent, however, when the nodes of the GRN are updated synchronously, a biologically implausible state of affairs. In this paper we demonstrate that evolution can produce GRNs with interesting dynamics under an asynchronous update scheme. We use an Artificial Genome to generate networks which exhibit limit cycle dynamics when updated synchronously, but collapse to a point attractor when updated asynchronously. Using a hill climbing algorithm the networks are then evolved using a fitness function which rewards patterns of gene expression which revisit as many previously seen states as possible. The final networks exhibit "fuzzy limit cycle" dynamics when updated asynchronously.