BACK TO INDEX

Publications of Eduardo D. Sontag jointly with C.A. Voigt
Articles in journal or book chapters
  1. J.P. Padmakumar, J. Sun 2, W. Cho 3, Y. Zhou, D. Densmore, E. D. Sontag, and C.A. Voigt. Partitioning of a 2-bit hash function across 65 communicating cells. 2024. Note: Submitted.
    Abstract:
    Powerful distributed computing can be achieved by communicating cells that individually perform simple operations. We have developed design software to divide a large genetic circuit across cells as well as the genetic parts to implement the subcircuits in their genomes. These tools were demonstrated by re-coding a 2-bit version of the MD5 hashing algorithm, an early predecessor to the cryptographic functions underlying cryptocurrency. Implementation required 110 logic gates, which were partitioned across 65 strains of Escherichia coli, requiring the introduction of a total of 0.66 Mb of recombinant DNA into their genomes. The strains are experimentally verified to integrate their assigned input signals, process this information correctly, and propagate the result to the cell in the next layer. This work demonstrates the potential computational capacity cell populations, whether it is to obtain programmable control of biological processes or to implement highly parallelized solutions to computational problems.


  2. T. Chen, M. A. Al-Radhawi, C.A. Voigt, and E.D. Sontag. A synthetic distributed genetic multi-bit counter. iScience, 24:103526, 2021. [PDF] Keyword(s): counters, synthetic biology, transcriptional networks, gene networks, boolean circuits, boolean gates, systems biology.
    Abstract:
    A design for genetically-encoded counters is proposed via repressor-based circuits. An N-bit counter reads sequences of input pulses and displays the total number of pulses, modulo $2^N$. The design is based on distributed computation, with specialized cell types allocated to specific tasks. This allows scalability and bypasses constraints on the maximal number of circuit genes per cell due to toxicity or failures due to resource limitations. The design starts with a single-bit counter. The N-bit counter is then obtained by interconnecting (using diffusible chemicals) a set of N single-bit counters and connector modules. An optimization framework is used to determine appropriate gate parameters and to compute bounds on admissible pulse widths and relaxation (inter-pulse) times, as well as to guide the construction of novel gates. This work can be viewed as a step toward obtaining circuits that are capable of finite-automaton computation, in analogy to digital central processing units.


  3. M.A. Al-Radhawi, A.P. Tran, E. Ernst, T. Chen, C.A. Voigt, and E.D. Sontag. Distributed implementation of Boolean functions by transcriptional synthetic circuits. ACS Synthetic Biology, 9:2172-2187, 2020. [PDF] [doi:10.1021/acssynbio.0c00228] Keyword(s): synthetic biology, transcriptional networks, gene networks, boolean circuits, boolean gates, systems biology.
    Abstract:
    Starting in the early 2000s, sophisticated technologies have been developed for the rational construction of synthetic genetic networks that implement specified logical functionalities. Despite impressive progress, however, the scaling necessary in order to achieve greater computational power has been hampered by many constraints, including repressor toxicity and the lack of large sets of mutually-orthogonal repressors. As a consequence, a typical circuit contains no more than roughly seven repressor-based gates per cell. A possible way around this scalability problem is to distribute the computation among multiple cell types, which communicate among themselves using diffusible small molecules (DSMs) and each of which implements a small sub-circuit. Examples of DSMs are those employed by quorum sensing systems in bacteria. This paper focuses on systematic ways to implement this distributed approach, in the context of the evaluation of arbitrary Boolean functions. The unique characteristics of genetic circuits and the properties of DSMs require the development of new Boolean synthesis methods, distinct from those classically used in electronic circuit design. In this work, we propose a fast algorithm to synthesize distributed realizations for any Boolean function, under constraints on the number of gates per cell and the number of orthogonal DSMs. The method is based on an exact synthesis algorithm to find the minimal circuit per cell, which in turn allows us to build an extensive database of Boolean functions up to a given number of inputs. For concreteness, we will specifically focus on circuits of up to 4 inputs, which might represent, for example, two chemical inducers and two light inputs at different frequencies. Our method shows that, with a constraint of no more than seven gates per cell, the use of a single DSM increases the total number of realizable circuits by at least 7.58-fold compared to centralized computation. Moreover, when allowing two DSM's, one can realize 99.995\% of all possible 4-input Boolean functions, still with at most 7 gates per cell. The methodology introduced here can be readily adapted to complement recent genetic circuit design automation software.


  4. T.H. Segall-Shapiro, E. D. Sontag, and C. A. Voigt. Engineered promoters enable constant gene expression at any copy number in bacteria. Nature Biotechnology, 36:352-358, 2018. [PDF] Keyword(s): synthetic biology, systems biology, genetic circuits, gene copy number, incoherent feedforward loop, feedforward, IFFL.
    Abstract:
    This paper deals with the design of promoters that maintain constant levels of expression, whether they are carried at single copy in the genome or on high-copy plasmids. The design is based on an incoherent feedforward loop (iFFL) with a perfectly non-cooperative repression. The circuits are implemented in E. coli using Transcription Activator Like Effectors (TALEs). The resulting stabilized promoters generate near identical expression across different genome locations and plasmid backbones (pSC101, p15a, ColE1, pUC), and also provide robustness to strain mutations and growth media. Further, their strength is tunable and can be used to maintain constant ratios between proteins.


  5. T.H. Segall-Shapiro, A.J. Meyer, A.D. Ellington, E.D. Sontag, and C.A. Voigt. A `resource allocator' for transcription based on a highly fragmented T7 RNA polymerase. Molecular Systems Biology, 10:742-, 2014. [WWW] [PDF] Keyword(s): systems biology, synthetic biology, gene expression.
    Abstract:
    A transcriptional system is built based on a 'resource allocator' that sets a core RNAP concentration, which is then shared by multiple sigma fragments, which provide specificity. Adjusting the concentration of the core sets the maximum transcriptional capacity available to a synthetic system.



BACK TO INDEX




Disclaimer:

This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders.




Last modified: Mon Mar 18 14:40:24 2024
Author: sontag.


This document was translated from BibTEX by bibtex2html