title: The cell cycle switch computes approximate majority.
abstract: Both computational and biological systems have to make decisions about switching from one state to another. The 'Approximate Majority' computational algorithm provides the asymptotically fastest way to reach a common decision by all members of a population between two possible outcomes, where the decision approximately matches the initial relative majority. The network that regulates the mitotic entry of the cell-cycle in eukaryotes also makes a decision before it induces early mitotic processes. Here we show that the switch from inactive to active forms of the mitosis promoting Cyclin Dependent Kinases is driven by a system that is related to both the structure and the dynamics of the Approximate Majority computation. We investigate the behavior of these two switches by deterministic, stochastic and probabilistic methods and show that the steady states and temporal dynamics of the two systems are similar and they are exchangeable as components of oscillatory networks.
authors.affiliation: Microsoft Research, 7 J J Thomson Ave, Cambridge CB3 0FB, UK. luca@microsoft.com
authors.forename: Luca
authors.initials: L
authors.lastname: Cardelli
authors.forename: Attila
authors.initials: A
authors.lastname: Csikász-Nagy
mesh_terms: D000818:Animals; D059447:Cell Cycle Checkpoints; D003198:Computer Simulation; D006801:Humans; D008390:Markov Chains; D008938:Mitosis; D008954:Models, Biological; D015233:Models, Statistical; D015398:Signal Transduction; D013269:Stochastic Processes