| Publications about 'toxicity' |
| Articles in journal or book chapters |
| Cancer therapies often fail when intolerable toxicity or drug-resistant cancer cells undermine otherwise effective treatment strategies. Over the past decade, adaptive therapy has emerged as a promising approach to postpone emergence of resistance by altering dose timing based on tumor burden thresholds. Despite encouraging results, these protocols often overlook the crucial role of toxicity-induced treatment breaks, which may permit tumor regrowth. Herein, we explore the following question: would toxicity feedback improve or hinder the efficacy of adaptive therapy? To address this question, we propose a mathematical framework for incorporating toxic feedback into treatment design. We find that the degree of competition between sensitive and resistant populations, along with the growth rate of resistant cells, critically modulates the impact of toxicity feedback on time to progression. Further, our model identifies circumstances where strategic treatment breaks, which may be based on either tumor size or toxicity, can mitigate overtreatment and extend time to progression, both at the baseline parameterization and across a heterogeneous virtual population. Taken together, these findings highlight the importance of integrating toxicity considerations into the design of adaptive therapy. |
| Implementing logic functions in living cells is a fundamental area of interest among synthetic biologists. The goal of designing biochemical circuits in synthetic biology is to make modular and tractable systems that perform well with predictable behaviors. Developing formalisms towards the design of such systems has proven to be difficult with the diverse retroactive effects that appear with respect to the context of the cell. Repressor-based circuits have various applications in biosynthesis, therapeutics, and bioremediation. Particularly using CRISPRi, competition for components of the system (unbound dCas9) can affect the achievable dynamic range of repression. Moreover, the toxicity of dCas9 via non-specific binding inhibits high levels of expression and limits the performance of genetic circuits. In this work, we study the computation of Boolean functions through CRISPRi based circuits built out of NOT and NOR gates. We provide algebraic expressions that allow us to evaluate the steady-state behaviors of any realized circuit. Our mathematical analysis reveals that the effective non-cooperativity of any given gate is a major bottleneck for increasing the dynamic range of the outputs. Further, we find that under the condition of competition between promoters for dCas9, certain circuit architectures perform better than others depending on factors such as circuit depth, fan-in, and fan-out. We pose optimization problems to evaluate the effects engineerable parameter values to find regimes in which a given circuit performs best. This framework provides a mathematical template and computational library for evaluating the performance of repressor-based circuits with a focus on effective cooperativity. |
| 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. |
| 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. |
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.
This document was translated from BibTEX by bibtex2html