Distributed Computation with Continual Population Growth

Computing with synthetically engineered bacteria is a vibrant and active field with numerous applications in bio-production, bio-sensing, and medicine. Motivated by the lack of robustness and by resource limitation inside single cells, distributed approaches with communication among bacteria have recently gained in interest. In this paper, we focus on the problem of population growth happening concurrently, and possibly interfering, with the desired bio-computation. Specifically, we present a fast protocol in systems with continuous population growth for the majority consensus problem and prove that it correctly identifies the initial majority among two inputs with high probability if the initial difference is $\Omega(\sqrt{n\log n})$ where $n$ is the total initial population. We also present a fast protocol that correctly computes the NAND of two inputs with high probability. We demonstrate that combining the NAND gate protocol with the continuous-growth majority consensus protocol, using the latter as an amplifier, it is possible to implement circuits computing arbitrary Boolean functions.

[1]  A. Gómez-Corral,et al.  Extinction times and size of the surviving species in a two-species competition process , 2012, Journal of mathematical biology.

[2]  L. Billard.  Competition between two species , 1974 .

[3]  David Eisenstat,et al.  A simple population protocol for fast robust approximate majority , 2007, Distributed Computing.

[4]  Christopher A. Voigt,et al.  Environmentally controlled invasion of cancer cells by engineered bacteria. , 2006, Journal of molecular biology.

[5]  Kiyoshi Oguri,et al.  Asynchronous Circuit Design , 2001 .

[6]  Samuel Karlin,et al.  A First Course on Stochastic Processes , 1968 .

[7]  Monir Hajiaghayi,et al.  Approximate majority analyses using tri-molecular chemical reaction networks , 2019, Natural Computing.

[8]  Christopher A. Voigt,et al.  A Synthetic Genetic Edge Detection Program , 2009, Cell.

[9]  R. R. P. Jackson,et al.  Elements of Queueing Theory with Applications , 1962 .

[10]  Jeffrey J. Tabor,et al.  Rewiring bacterial two-component systems by modular DNA-binding domain swapping , 2019, Nature Chemical Biology.

[11]  Nancy A. Lynch,et al.  Distributed Algorithms , 1992, Lecture Notes in Computer Science.

[12]  JERZY NEYMAN,et al.  COMPETITION PROCESSES , 2005 .

[13]  Vito Volterra,et al.  Leçons sur la théorie mathématique de la lutte pour la vie , 1931 .

[14]  M. Travisano,et al.  Experimental evolution of multicellularity , 2012, Proceedings of the National Academy of Sciences.

[15]  David Eisenstat,et al.  Fast computation by population protocols with a leader , 2006, Distributed Computing.

[16]  John Odentrantz,et al.  Markov Chains: Gibbs Fields, Monte Carlo Simulation, and Queues , 2000, Technometrics.

[17]  D. Kendall.  Branching Processes Since 1873 , 1966 .

[18]  Hosam M. Mahmoud,et al.  Polya Urn Models , 2008 .

[19]  Mudita Singhal,et al.  COPASI - a COmplex PAthway SImulator , 2006, Bioinform..

[20]  François Taddei,et al.  Genetic information transfer promotes cooperation in bacteria , 2014, Proceedings of the National Academy of Sciences.

[21]  Eric Libby,et al.  Ratcheting the evolution of multicellularity , 2014, Science.

[22]  Christopher A. Voigt,et al.  Robust multicellular computing using genetically encoded NOR gates and chemical ‘wires’ , 2011, Nature.

[23]  W. Hoeffding.  Probability Inequalities for sums of Bounded Random Variables , 1963 .

[24]  J. Collins,et al.  Synthetic biology devices for in vitro and in vivo diagnostics , 2015, Proceedings of the National Academy of Sciences.

[25]  Javier Macía,et al.  Distributed biological computation with multicellular engineered networks , 2011, Nature.

[26]  William Feller.  Die Grundlagen der Volterraschen Theorie des Kampfes ums Dasein in wahrscheinlichkeitstheoretischer Behandlung , 1939 .

[27]  Christopher A. Voigt,et al.  Genetic programs constructed from layered logic gates in single cells , 2012, Nature.

[28]  Rahul Sarpeshkar,et al.  Synthetic analog computation in living cells , 2013, Nature.

[29]  Jens Sparsø,et al.  Principles of Asynchronous Circuit Design , 2001 .

[30]  D. Gillespie.  Approximate accelerated stochastic simulation of chemically reacting systems , 2001 .

[31]  J. Keasling,et al.  High-level semi-synthetic production of the potent antimalarial artemisinin , 2013, Nature.

[32]  J. Pelikán,et al.  Discrete Mathematics: Elementary and Beyond , 2003 .

[33]  Richard M. Murray,et al.  Addressable, “Packet-Based” Intercellular Communication through Plasmid Conjugation , 2019, bioRxiv.

[34]  Peter Q Nguyen,et al.  A Synthetic Circuit for Mercury Bioremediation Using Self-Assembling Functional Amyloids. , 2017, ACS synthetic biology.

[35]  Eugene V. Koonin,et al.  Biological applications of the theory of birth-and-death processes , 2005, Briefings Bioinform..

[36]  Drew Endy,et al.  Engineered cell-cell communication via DNA messaging , 2012, Journal of biological engineering.