Skip to main content
Journal of the Royal Society Interface logoLink to Journal of the Royal Society Interface
. 2015 Jul 6;12(108):20150288. doi: 10.1098/rsif.2015.0288

An analytical approach to bistable biological circuit discrimination using real algebraic geometry

Dan Siegal-Gaskins 1,, Elisa Franco 3, Tiffany Zhou 1, Richard M Murray 1,2
PMCID: PMC4528596  PMID: 26109633

Abstract

Biomolecular circuits with two distinct and stable steady states have been identified as essential components in a wide range of biological networks, with a variety of mechanisms and topologies giving rise to their important bistable property. Understanding the differences between circuit implementations is an important question, particularly for the synthetic biologist faced with determining which bistable circuit design out of many is best for their specific application. In this work we explore the applicability of Sturm's theorem—a tool from nineteenth-century real algebraic geometry—to comparing ‘functionally equivalent’ bistable circuits without the need for numerical simulation. We first consider two genetic toggle variants and two different positive feedback circuits, and show how specific topological properties present in each type of circuit can serve to increase the size of the regions of parameter space in which they function as switches. We then demonstrate that a single competitive monomeric activator added to a purely monomeric (and otherwise monostable) mutual repressor circuit is sufficient for bistability. Finally, we compare our approach with the Routh–Hurwitz method and derive consistent, yet more powerful, parametric conditions. The predictive power and ease of use of Sturm's theorem demonstrated in this work suggest that algebraic geometric techniques may be underused in biomolecular circuit analysis.

Keywords: biological circuit, bistability, algebraic geometry, Sturm's theorem, biology

1. Introduction

The field of synthetic biology has rapidly matured to the point where it is now possible to produce complex synthetic networks with prescribed functions and levels of performance [1]. As in other fields of engineering, advances have been enabled by the use of small interchangeable modules that are ‘functionally equivalent’ from an input–output perspective [2]. Bistable circuits—which play a role in essential biological processes, including cell fate specification [3], cell cycle progression [4] and apoptosis [5]—make up a particularly large and diverse functionally equivalent set [6]. Effectively characterizing and comparing these biocircuits is crucial for determining which design is in some sense optimal for a particular context.

Ordinary differential equation (ODE) models can be powerful tools for identifying and contrasting biocircuits' ‘dynamic phenotypes' [7]. Numerical simulations are often used in the analysis of these models; however, analytical criteria that focus on topology can provide a more exact assessment of a circuit's properties [8,9]. (Here, we use topology to mean the particular set of interactions between regulatory parts.) A novel analytical tool that can provide topology-based insights can be found in Sturm's theorem [10], developed in 1835 as a solution to the problem of finding the number of real roots of an algebraic equation with real coefficients over a given interval. Despite its predictive power, this ‘gem of 19th century algebra and one of the greatest discoveries in the theory of polynomials' [11] remains an unexploited tool for analysis of biological circuit models.

In this work, we demonstrate an approach to bistable circuit discrimination based on Sturm's theorem that can give the boundaries of the regions of bistability as exact analytic expressions, eliminating the need for numerical simulation. We compare the regions of bistability for two variants of the classic double-negative toggle switch as well as two positive feedback circuits, one of which is based on the bacteriophage λ promoter PRM. We then show that while a purely monomeric version of the genetic toggle cannot be bistable, a single competitive activating species added to the circuit leads to bistability in a non-contiguous region of parameter space. Lastly, we use a model of an RNA aptamer-based bistable switch to compare our Sturm's theorem approach to another based on the control theoretic Routh–Hurwitz method. Overall, our results highlight a new use for Sturm's theorem for identifying potential differences between functionally equivalent bistable biocircuits, and serve as a (re-)introduction to the method as a general tool for studying the kinds of polynomial expressions that often arise when modelling biological systems.

2. Mathematical preliminaries

Sturm's theorem gives the number of distinct real roots of a univariate polynomial f(x) in a particular interval. To apply the theorem, we must first construct the Sturm sequence, a set of polynomials ℱ = {f0, f1, …, fm} defined as

2.

where rem(fi, fi+1) is the remainder of the polynomial long division of fi by fi+ 1. The sequence ends at fm, when fm− 1 divided by fm gives a remainder of zero. For a polynomial of degree n, there are mn + 1 Sturm polynomials in the sequence.

Theorem 2.1 —

(Sturm's theorem). Let f(x) be a real-valued univariate polynomial and a, b ∈ ℝ ∪ {−∞, +∞}, with a < b and f(a), f(b) ≠ 0. Then the number of zeroes of f(x) in the interval (a, b) is the difference

graphic file with name rsif20150288-e2.jpg

whereis the Sturm sequence of f(x), and the variations var(ℱ, a) and var(ℱ, b) are the number of times that consecutive non-zero elements of the Sturm sequence—evaluated at a and b, respectively—have opposite signs. (Adapted from [12].)

Our approach involves identifying regions of bistability by finding conditions that lead to three steady states, without requiring numerical determination of the exact values or stability of the equilibrium points. While it is, in general, not possible to draw conclusions on the stability properties of equilibria by simply counting their number, the circuits under consideration enjoy important properties—namely they are dissipative, their linearizations are positive and the characteristic polynomials of their Jacobians have all non-constant terms positive—that allow us to relate their degree and number of equilibria to the stability properties of each equilibrium (see the electronic supplementary material). For such circuits, when three equilibria are present, two of them must be stable and one must be unstable.

3. Overview of the method

To determine the region in parameter space in which a particular circuit exhibits bistability, we first find the polynomial f(x) that describes the equilibrium state of the system (where x represents the concentration of a circuit species of interest) and construct its Sturm sequence ℱ = {f0, f1, …, fm} as described above. Because we are interested in all possible positive concentrations, x → 0 and x → +∞ are chosen as the limits of the interval on which Sturm's theorem is applied. For each limit, we generate different sets of polynomial inequalities by independently setting each element of ℱ to be either greater than or less than zero; however, only some of these inequality sets may be combined in such a way to yield a variation difference var(ℱ, 0) − var(ℱ, +∞) = 3 and thus three steady states. (For example, with var(ℱ, 0) = 4, only those complementary sets with var(ℱ, +∞) = 1 need to be considered.) These combinations of inequalities are enumerated and then tested for logical consistency, i.e. whether all inequalities can be simultaneously satisfied. It is important to note that, because Sturm's theorem is only concerned with consecutive non-zero elements and zeroes are ignored, a particular Sturm polynomial may be equal to zero without affecting the total number of sign changes. In cases where zeroes are valid options in the sequence, strict inequalities are made non-strict (e.g. ‘>’ → ‘≥’).

Symbolic manipulation is done using Mathematica; a sample Mathematica notebook in which the method is applied is included as electronic supplementary material.

4. Results

4.1. Genetic toggle circuits

A recent study identified a set of 11 minimal bistable networks (MBNs), simple two-gene circuits with the capacity for bistability that do not also contain a smaller bistable subcircuit [13]. One of these MBNs, a double-negative toggle switch consisting of two dimeric repressors (figure 1a, top), was among the very first synthetic biocircuits built and modelled [14]. This dimer–dimer (DD) toggle design has since gone on to be used in a wide range of synthetic biological applications, including the manipulation of fluxes of the Escherichia coli metabolic network [15] and as part of a circuit involved in programmed autonomous cellular diversification [16]. A second MBN of particular interest, herein referred to as the monomer–dimer (MD) toggle, is a double-negative switch variant in which one of the repressors functions as a monomer (figure 1a, bottom). While to the best of our knowledge no MD toggle circuit has been constructed, the components necessary for its implementation exist in the form of monomeric single-chain transcriptional repressor proteins [17], as well as in transcription-activator-like effectors (TALEs) and CRISPR/Cas nucleases that have been engineered as repressors [18,19]. Other exotic toggle-like circuit topologies have also been proposed and/or built [13,18,2022]. An understanding of the differences in how these various toggles perform can be beneficial, in particular for those circuits that have yet to be built and for which a priori knowledge of their behaviour could aid in their development.

Figure 1.

Figure 1.

(a) Dimer–dimer (top) and monomer–dimer (bottom) toggle switches. (b) Bistable regions for the monomer–dimer and dimer–dimer toggles. The dimer–dimer toggle exhibits bistability over a much larger range of Inline graphic and Inline graphic

As a first demonstration of our approach, we apply Sturm's theorem to the DD and MD toggle circuits. Beginning with a chemical reaction network formulation and assuming mass-action kinetics we derive ODE models of the two toggles (electronic supplementary material, equations (S1) and (S2)). At equilibrium, the concentrations of P1 and P2 in the MD system are given by

4.1. 4.1

and in the DD system,

4.1. 4.2

where Xitot is the total concentration of gene i, βi = kbasi/kdegi is the ratio of basal production and degradation rate constants for protein i, Kxd = {Kmd, Kdd} is the Michaelis constant for P1, and K2 is the Michaelis constant for P2. (Recall that Michaelis constants represent the repressor concentrations that yield 50% of the maximum production rate of their target proteins and are determined by the protein–DNA and dimerization dissociation constants; see electronic supplementary material for details.) Systems (4.1) and (4.2) may be written in terms of P1eq alone, as

4.1. 4.3

and

4.1. 4.4

With the following scaling of the DNA and protein concentrations:

4.1. 4.5

and

4.1. 4.6

we may write equations (4.3) and (4.4) as non-dimensional polynomials in Inline graphic:

4.1. 4.7

and

4.1. 4.8

for the MD and DD toggles, respectively. Every positive root of these equilibrium polynomials also gives a positive steady-state concentration for every other circuit component.

We may now determine the regions of bistability in the plane of total (non-dimensionalized) DNA concentrations Inline graphic and Inline graphic. As outlined in §3, the first step is the construction of a Sturm sequence ℱ for each equilibrium polynomial. These sequences are given in the electronic supplementary material. It can be seen that, for the DD toggle, some of the polynomials in the sequence contain a Inline graphic term that renders them indeterminate when Inline graphic. (The same term is responsible for one of the polynomials going to zero, thus terminating the sequence prematurely.) To avoid these problems, it is necessary to generate two different sequences for the DD toggle: one for which we assume Inline graphic in equation (4.8), and another with Inline graphic. In this latter case, the DD toggle equilibrium polynomial equation (4.8) becomes

4.1. 4.9

Following construction of the toggle Sturm sequences, we evaluate each at Inline graphic and Inline graphic and find the conditions that give a variation difference of 3. The MD toggle Sturm sequence ℱmd has a maximum possible variation of 3 and only one combination of inequalities that can give rise to bistability: when var(ℱmd, 0) = 3 and var(ℱmd, +∞) = 0. In contrast, the DD toggle sequence ℱdd could in principle yield as many as five positive steady states; however, only three are admitted as there are no combinations of inequalities that have a variation difference of 5 or 4 and are logically consistent. (See §3 for details.) Inequality sets for the DD toggle are listed (in the compact form {± ± · · · ±}) in tables 1 and 2.

Table 1.

Sturm sequence inequality sets for the DD toggle when Inline graphic. The signs of the first two polynomials are fixed at Inline graphic and Inline graphic. Neither var(ℱdd, 0) = 5 nor var(ℱdd, +∞) = 0 represent logically consistent sets.

var(ℱdd, 0) sign(ℱdd, 0) logically consistent? var(ℱdd, +∞) sign(ℱdd, +∞) logically consistent?
5 {− + − + − +} N 2
4 {− + − + − −} N 1 {+ + + + + −} N
{− + − − + −} Y {+ + + + − −} N
{− + + − + −} Y {+ + + − − −} Y
{− + − + + −} Y {+ + − − − −} Y
3 0 {+ + + + + +} N

Table 2.

Sturm sequence inequality sets for the DD toggle when Inline graphic. The signs of the first two and three polynomials are fixed at Inline graphic and Inline graphic, respectively. The set with var(ℱdd, 0) = 4 is not logically consistent.

var(ℱdd, 0) sign(ℱdd, 0) logically consistent? var(ℱdd, +∞) sign(ℱdd, +∞) logically consistent?
4 {− + − + −} N 1
3 {− + − + +} N 0 {+ + + + +} Y
{− + + − +} Y
{− + − − +} N

The valid inequality sets were reduced with Mathematica to yield analytic expressions for the regions of bistability in the plane of Inline graphic and Inline graphic. For the MD toggle, this bistability region is found to be

4.1. 4.10

with Inline graphic. The DD toggle inequality sets combine to give a continuous region of bistability that is most easily written as the intersection of

4.1. 4.11

and

4.1. 4.12

It is important to note that, with the exception of the DD toggle at Inline graphic (which was treated by analysing a second Sturm sequence, as described above), none of the potential zeroes in the Sturm polynomial denominators required special treatment nor did they present any problems in determining the regions of bistability.

Our analysis shows that the DD toggle operates as a bistable switch over a substantially greater range of (non-dimensionalized) DNA concentrations than does the MD toggle (figure 1b), indicating that the DD topology is more functionally robust to variations in DNA concentrations and rate parameters. Furthermore, the DD switch can operate with significantly lower values of Inline graphic and Inline graphic: > 75% and > 50% less, respectively. Worth highlighting is the fact that, through application of our method to the non-dimensionalized versions of the original systems, we have demonstrated that the function of bistability is determined by a particular combination of the system parameters—gene concentrations, protein basal production and degradation rate constants, and Michaelis constants—and thus there is no single parameter more important than any other for achieving bistability.

4.2. Computational support

The approach presented here does not require any numerical simulation; however, some computational validation of our results may be considered of value. For both toggle circuits, and for each of the valid combinations of sign(ℱ, 0) and sign(ℱ, +∞), 1000 random values of Inline graphic and Inline graphic were selected from inside and outside of the predicted bistable regions and plugged in to the appropriate equilibrium polynomial (equations (4.7) or (4.8)) that were then solved numerically. In all cases, the number of equilibria found matched the number determined by Sturm's theorem: three equilibria were found inside the bistable regions and only one equilibrium was found outside.

We may also check the stability of the various steady states using the circuits' Jacobian J and characteristic polynomial pJ(λ) = det(λIJ). It was recently shown that if all off-diagonal components of the Jacobian are non-negative (i.e. it is a Metzler matrix), or if the Jacobian may be transformed to have such a form, then any equilibrium is unstable if and only if the constant term of pJ(λ) has a sign opposite to that of all other terms in pJ(λ) [20]. We use this condition on the constant term of pJ(λ) to confirm that each bistable solution set contains one and only one unstable steady state.

The inequalities that satisfy the pJ(λ) constant term condition are

4.2. 4.13

and

4.2. 4.14

for the MD and DD toggles, respectively. For each bistable solution set found, we substituted the values Inline graphic Inline graphic and Inline graphic into equations (4.13) and (4.14) and confirmed that only one of the three solutions satisfies the appropriate instability condition.

It is worth noting that the time required to test Inline graphic pairs scales linearly with the number of pairs, so while testing a small number can be done relatively quickly, as the number of pairs becomes appreciable the time can be significant—up to 3 h to test 600 000 random values of Inline graphic and Inline graphic.

4.3. Bistable single-gene circuits

The single gene system consisting of bacteriophage λ repressor and its promoter PRM (with its three operator sites OR1, OR2 and OR3) also exhibits bistability [23]. Using the dimensionless model given in [23], we have that the steady state concentration of protein satisfies

4.3. 4.15

where γ is the rescaled degradation rate constant, α represents the increase in protein production resulting from dimer binding to OR2, and σ1 and σ2 are the relative (to OR1) affinities for OR2 and the negatively regulating OR3, respectively. (For simplicity, we set the gene copy number equal to one.) With σ1 = 2 and σ2 = 0.08 [23], the associated Sturm sequence Inline graphic has only two inequality sets with Inline graphic and one set with Inline graphic that are logically consistent and together give bistability (table 3).

Table 3.

Sturm sequence inequality sets for the λ repressor–PRM system. The first four Sturm polynomials have fixed signs at Peq = 0 and Peq = +∞. Neither Inline graphic nor Inline graphic represent logically consistent sets.

Inline graphic signInline graphic logically consistent? Inline graphic signInline graphic logically consistent?
6 {− + + − + − + −} N 3
5 {− + + − + − + +} N 2 {+ + − − + + + +} N
{− + + − + + − +} Y {+ + − − − + + +} Y
{− + + − + − − +} N {+ + − − − − + +} N
{− + + − − + − +} Y {+ + − − − − − +} N
4 1 {+ + − − − − − −} N

We can compare the bistability region of the multi-operator PRM system with that of a simple positive feedback circuit consisting of a dimeric repressor and only one operator site (MBN kqw in [13]). Rescaled as in equation (4.15), we have

4.3. 4.16

As with the MD toggle, this polynomial also has a maximum possible variation of 3 and thus only a single combination of inequalities that give rise to bistability, in the region given by

4.3. 4.17

The bistable regions (in αγ space) for these single gene circuits are shown in figure 2a. (The one-dimensional regions of bistability shown in bifurcation diagrams in [23,24] are plotted for comparison.) It can be seen that the λ repressor circuit is bistable over a larger range and with lower values of the degradation rate constant. Interestingly, with α = 11 ([23] and references therein), the single operator circuit would just barely function as a bistable circuit, and any small fluctuation in circuit parameters would render it non-functional.

Figure 2.

Figure 2.

(a) Bistable regions for the single operator positive feedback circuit and the λ repressor–PRM system with relative affinities σ1 = 2 and σ2 = 0.08. Vertical dashed lines indicate regions of bistability shown in the single-parameter bifurcation diagrams in [23,24]. (b) Region of bistability for the λ–PRM system as a function of protein production enhancement α, protein degradation rate γ, and relative affinity for OR3 σ2.

We can also use our method to determine how the strength of the negative feedback (σ2) affects bistability. Keeping σ1 = 2, and using α = 11 and γ = 4.5 (centred in the bistable region at α = 11; figure 2a), we find that σ2 can increase 12-fold to approximately 0.96 before bistability is lost. In general, significant increases in σ2 require similar increases in α for bistability to be maintained, with the range of allowable γ narrowing as a result (figure 2b).

4.4. Purely monomeric toggle circuits

In a recent study [18], it was shown that a toggle variant consisting of two monomeric repressors derived from TALE protein DNA-binding domains cannot support bistability, but that the introduction of positive feedback in the form of two TALE-based activators that compete with the repressors for promoter access makes the system bistable. However, as we show below, it is not necessary to have two symmetric positive feedback loops for bistability; a single activator added to the monomeric toggle is sufficient.

We begin by combining components from the ‘mutual repressor’ and ‘competitive feedback’ models of Lebar et al. [18], so that the two types of promoters—one containing a single binding site for both an activator and a repressor, and a second that is only responsive to a repressor—are present in one hybrid circuit:

4.4. 4.18

In keeping with the nomenclature of [18], [TAV] represents the concentration of the activator species, and [TAK] and [TBK] are the concentrations of the two repressor species. (For simplicity, we have not included terms related to the fluorescent reporters as they have no effect on the capacity for bistability.) So that our results may be easily comparable to those in [18], we include a basal rate constant kb to account for expression from the pristinamycin- and erythromycin-inducible promoters incorporated in the original system for external control. Other parameters of the models in [18] set to either zero or one in their simulations are, for clarity of presentation, also set to those same values here.

Equation (4.18) may be combined into a single equilibrium polynomial in [TAK]:

4.4. 4.19

The maximum possible variation that the Sturm sequence associated with equation (4.19) may have is 3 and there is thus only a single combination of inequalities that can yield three steady states.

To establish the relationship between the repressor and activator expression strengths (kK and kV, respectively) and the capacity for bistability, we set kb to the uninduced steady-state value of approximately 0.04 M h−1 and the degradation rate constant kd = 0.1 h−1 (values taken from [18]). Interestingly, we find two unconnected bistable subregions: one in which the repressor promoter strength must be greater than 10 times that of the activator, and another in which the activator promoter strength must be greater than approximately 2 times that of the repressor (figure 3). Thus, while a purely monomeric toggle without positive feedback cannot be bistable—indeed, the equilibrium polynomial for such a circuit is only second order and could never have more than two real roots—the addition of a single activator with competitive feedback is all that is needed for bistability. Also noteworthy is that the values of kK and kV that give bistability in the simulation of the full ‘competitive feedback’ model of [18] (180 and 30 h−1, respectively) only give a monostable response in this hybrid circuit.

Figure 3.

Figure 3.

A monomeric toggle circuit with a single additional activator—a hybrid of the ‘mutual repressor’ and ‘competitive feedback’ models of [18]—yields two unconnected regions of bistability. The single point tested in the simulation of the full ‘competitive feedback’ model in [18] is shown for comparison.

4.5. Sturm's theorem and the Routh–Hurwitz stability criterion: a comparison of analytical methods

The Routh–Hurwitz stability criterion is commonly employed by control theorists to test if a polynomial admits positive roots. Typically applied to characteristic polynomials of linear time invariant systems to establish their stability, the method can also be used to find the parameter range in which a polynomial equilibrium condition admits a desired number of positive roots. Indeed, Sturm's theorem and the Routh–Hurwitz method are related, and the validity of the latter can be demonstrated using Sturm chains. It may be argued that building a Routh table is a simpler procedure than applying Sturm's theorem because it only requires basic arithmetic operations on the polynomial coefficients; however, its relative simplicity comes at a price: information about the real or complex nature of the positive roots is lost. In contrast, Sturm's theorem allows for an exact determination of the number of real positive roots, as well as whether or not they are physically meaningful for a biochemical system.

A recent study of a novel biomolecular circuit that uses modulation of enzyme activity by inhibitory RNA aptamers to achieve bistability [20] provides us with an opportunity to compare our approach with one based on the Routh–Hurwitz method. Interestingly, like the monomeric circuit from [18] and its asymmetric variant described above, and proposed MBN bcdh in [13], this aptamer-based circuit achieves bistability with monomeric regulation.

The equilibrium condition for the concentration of one of the enzyme species in its active form (given here by x; see electronic supplementary material) is a complicated polynomial of fourth order:

4.5.

where Etot is the total concentration of each of the two enzymes used in the circuit and Greek letters indicate reaction rates.

The inequality sets for this circuit are listed along with their allowabilities in table 4. Combining these inequalities, we find that for bistability it is necessary that

4.5. 4.21

Table 4.

Sturm sequence inequality sets for the RNA aptamer-based circuit in [20]. The sign of the first polynomial is fixed at x → 0. var(ℱ, 0) = 4 is not a logically consistent set.

var(ℱ, 0) sign(ℱ, 0) logically consistent? var(ℱ, +∞) sign(ℱ, +∞) logically consistent?
4 {− + − + −} N 1
3 {− − + − +} Y 0 {+ + + + +} Y
{− + − + +} Y
{− + + − +} Y
{− + − − +} Y

These conditions are identical to those identified in [20] by applying the Routh–Hurwitz table together with imposing conditions to guarantee real positive roots and conditions on the constant term of the characteristic polynomial to achieve bistability. Additional details are provided in the electronic supplementary material.

5. Discussion

In this work, we have for the first time applied Sturm's theorem to the study of biological circuits; specifically, biocircuits that can adopt two stable steady states. The primary results of our analyses are exact analytical expressions defining the various circuits' regions of bistability, and without the need for parameter surveys and numerical simulation. We take advantage of the fact that the bistable circuits considered here are dissipative, positive in their linearization, and have characteristic polynomials with all non-constant terms positive, properties that allow us to ascertain the stability of their equilibria without computation. It is important to emphasize that these are not unique features of these particular circuits and that many real systems share these properties. For any such system, once the number of steady-states is determined—by Sturm's theorem or by other methods—the stabilities are also known.

So following our analysis, can it be said that some topologies are in some sense ‘better’ than others? Between the two different genetic toggle variants, we see that when rate parameters are fixed, the toggle consisting of two dimeric repressor species functions as a bistable switch over a wider range of DNA concentrations than one composed of one dimeric and one monomeric repressor. This result provides a strong motivation for choosing a DD toggle over a MD toggle in any application where there is considerable uncertainty or variability in parameter values or DNA concentrations (e.g. when DNA is in the form of plasmids without strict copy-number control). In single-gene positive feedback circuits exhibiting bistability, we see benefits to having additional operator sites: without both OR1 and OR2 in the λ repressor–PRM system, the enhancement α = 11 would barely be sufficient for bistability. Interestingly, although feedback at OR3 is negative, it is not strong enough to significantly affect the circuit's ability to function as a bistable switch. Taken together, these two results suggest that the promoter architecture of the λ system may have evolved to allow for both robust bistability due to the positive feedback as well as reduced variability or other benefit of the small negative autoregulation.

Although relatively little known within the biological sciences, Sturm's theorem has found applicability in a number of other areas where polynomials play an important role, including computational mathematics [25], dynamical systems [26,27], robotics [28] and finance [29]. Additional biological applications are possible, for example, as a tool to predict a large number of new bistable topologies or rule out those that do not have the capacity for bistability (such as chemical reaction network theory, previously [13,24]).

Other methods from algebraic geometry, including the closely related Descartes' rule of signs, have also found use in biological systems analysis, with recent applications to model discrimination [30] and the study of chemical reaction networks [31,32] and multisite phosphorylation systems [33], among many others. (This latter paper is particularly relevant to our own work, as it also highlights the benefits of treating parameters symbolically rather than numerically.) For the specific task required in this work—determining the number of positive real roots of a biocircuit's equilibrium polynomial—Descartes' rule of signs may be simpler to apply than Sturm's theorem; however, it is definitively less powerful in that it can only give an upper bound on the number of real roots.

We note that not all bistable circuits of interest may be easily studied using our approach. First, it may not be possible to capture the circuit's equilibrium state with a single polynomial. When an equilibrium polynomial can be found, those of third order are the simplest to study, because there is only one combination of inequalities that can give rise to bistability. As the order increases, the number of inequality sets to test and the complexity of the Sturm sequences can also increase to the point where application of the theorem is impractical. However, this is highly dependent on the complexity of the polynomial coefficients and the number of Sturm sequences of fixed sign. Indeed, as we demonstrated with our analysis of the λ repressor–PRM system, even a seventh-order polynomial can be tractable. For particularly large circuits for which an equilibrium polynomial cannot be derived, or for which the Sturm sequence is overly complex, a decomposition of the system into smaller modules can be beneficial.

The analysis of an equilibrium polynomial with a zero root—for example, that describing a recently developed DNA-based circuit that achieves bistability through a combination of mutual inhibition and autocatalysis [34]—presents challenges, because Sturm's theorem requires that neither of the limits of the region of interest (in our case, 0 and +∞) be roots. Under these circumstances, one could choose an ε < 0 for the lower limit; however, in this case, there is no guarantee that the three roots found by Sturm's theorem will all represent physically real, positive quantities (because one or more of the roots could in theory lie between ε and 0).

5.1. Extensions to Sturm's theorem and related methods

The Sturm's theorem approach described here can be directly applied to systems whose steady state may be characterized by a univariate polynomial with integer exponents and simple roots. While such systems are common, examples of equilibrium polynomials not of this particular form can also be found. For example, exponents that are typically given integer values in simplified models and/or to reflect strong multimerization (as in this work) or other reactions with significant positive cooperativity [35] can be found to have fractional values when the models are fitted to empirical data [3638]. In limited cases, these generalized polynomials can be turned to a proper polynomial with a simple substitution that does not affect the number of zeros (e.g. u = x1/N, if all exponents of x are multiples of 1/N). There are also simple extensions to Sturm's theorem that deal with multiple roots [39] and multivariate models [12,40]. Should only an upper bound on the number of real roots of multivariate and generalized polynomial models be desired, extensions to the related Descartes' rule of signs are also available [4143].

Supplementary Material

Supporting Information
rsif20150288supp1.nb (659.6KB, nb)

Supplementary Material

Toggle circuit analysis and comparison (Mathematica notebook file)
rsif20150288supp2.pdf (115.5KB, pdf)

Acknowledgements

A large number of people contributed to this work with insights and comments. The authors particularly thank Andras Gyorgy, Yutaka Hori, Scott C. Livingston, Anne Shiu, Eduardo Sontag, Elisenda Feliu, Zvi H. Rosen, Jaap Top and Brian Ingalls.

Authors' contributions

The project was conceived by D.S.-G., E.F. and R.M.M. D.S.-G. and E.F. performed the mathematical analyses, with computational support provided by T.Z. The paper was written by D.S.-G. and E.F. and edited by all of the coauthors.

Competing interests

We declare we have no competing interests.

Funding

This research is funded in part by the National Science Foundation through grant CMMI 1266402, and the Gordon and Betty Moore Foundation through grant no. GBMF2809 to the Caltech Programmable Molecular Technology Initiative.

References

  • 1.Purnick PEM, Weiss R. 2009. The second wave of synthetic biology: from modules to systems. Nat. Rev. Mol. Cell Biol. 10, 410–422. ( 10.1038/nrm2698) [DOI] [PubMed] [Google Scholar]
  • 2.Lim WA, Lee CM, Tang C. 2013. Design principles of regulatory networks: searching for the molecular algorithms of the cell. Mol. Cell 49, 202–212. ( 10.1016/j.molcel.2012.12.020) [DOI] [PMC free article] [PubMed] [Google Scholar]
  • 3.Rouault H, Hakim V. 2012. Different cell fates from cell–cell interactions: core architectures of two-cell bistable networks. Biophys. J. 102, 417–426. ( 10.1016/j.bpj.2011.11.4022) [DOI] [PMC free article] [PubMed] [Google Scholar]
  • 4.Yao G, Tan C, West M, Nevins JR, You L. 2011. Origin of bistability underlying mammalian cell cycle entry. Mol. Syst. Biol. 7, 485 ( 10.1038/msb.2011.19) [DOI] [PMC free article] [PubMed] [Google Scholar]
  • 5.Ho KL, Harrington HA. 2010. Bistability in apoptosis by receptor clustering. PLoS Comput. Biol. 6, e1000956 ( 10.1371/journal.pcbi.1000956) [DOI] [PMC free article] [PubMed] [Google Scholar]
  • 6.Tiwari A, Ray JCJ, Narula J, Igoshin OA. 2011. Bistable responses in bacterial genetic networks: designs and dynamical consequences. Math. Biosci. 231, 76–89. ( 10.1016/j.mbs.2011.03.004) [DOI] [PMC free article] [PubMed] [Google Scholar]
  • 7.Ma W, Trusina A, El-Samad H, Lim WA, Tang C. 2009. Defining network topologies that can achieve biochemical adaptation. Cell 138, 760–773. ( 10.1016/j.cell.2009.06.013) [DOI] [PMC free article] [PubMed] [Google Scholar]
  • 8.Blanchini F, Franco E. 2011. Structurally robust biological networks. BMC Syst. Biol. 5, 74 ( 10.1186/1752-0509-5-74) [DOI] [PMC free article] [PubMed] [Google Scholar]
  • 9.Blanchini F, Franco E, Giordano G. 2014. A structural classification of candidate oscillatory and multistationary biochemical systems. Bull. Math. Biol. 76, 2542–2569. ( 10.1007/s11538-014-0023-y) [DOI] [PubMed] [Google Scholar]
  • 10.Sturm CF. 2009. Mémoire sur la résolution des équations numériques. In Collected works of Charles François Sturm, pp. 345–390. Basel, Switzerland: Birkhäuser Basel. [Google Scholar]
  • 11.Eisermann M. 2012. The fundamental theorem of algebra made effective: an elementary real-algebraic proof via Sturm chains. Am. Math. Mon. 119, 715–752. ( 10.4169/amer.math.monthly.119.09.715) [DOI] [Google Scholar]
  • 12.Sottile F. 2011. Real solutions to equations from geometry. University Lecture Series, vol. 57 Providence, RI: American Mathematical Society. [Google Scholar]
  • 13.Siegal-Gaskins D, Mejia-Guerra MK, Smith GD, Grotewold E. 2011. Emergence of switch-like behavior in a large family of simple biochemical networks. PLoS Comput. Biol. 7, e1002039 ( 10.1371/journal.pcbi.1002039) [DOI] [PMC free article] [PubMed] [Google Scholar]
  • 14.Gardner TS, Cantor CR, Collins JJ. 2000. Construction of a genetic toggle switch in Escherichia coli. Nature 403, 339–342. ( 10.1038/35002131) [DOI] [PubMed] [Google Scholar]
  • 15.Anesiadis N, Cluett WR, Mahadevan R. 2008. Dynamic metabolic engineering for increasing bioprocess productivity. Metab. Eng. 10, 255–266. ( 10.1016/j.ymben.2008.06.004) [DOI] [PubMed] [Google Scholar]
  • 16.Sekine R, et al. 2011. Tunable synthetic phenotypic diversification on Waddington's landscape through autonomous signaling. Proc. Natl Acad. Sci. USA 108, 17 969–17 973. ( 10.1073/pnas.1105901108) [DOI] [PMC free article] [PubMed] [Google Scholar]
  • 17.Krueger C, Berens C, Schmidt A, Schnappinger D, Hillen W. 2003. Single-chain Tet transregulators. Nucleic Acids Res. 31, 3050–3056. ( 10.1093/nar/gkg421) [DOI] [PMC free article] [PubMed] [Google Scholar]
  • 18.Lebar T, et al. 2014. A bistable genetic switch based on designable DNA-binding domains. Nat. Commun. 5, 5007 ( 10.1038/ncomms6007) [DOI] [PubMed] [Google Scholar]
  • 19.Nielsen AAK, Voigt CA. 2014. Multi-input CRISPR/Cas genetic circuits that interface host regulatory networks. Mol. Syst. Biol. 10, 763 ( 10.15252/msb.20145735) [DOI] [PMC free article] [PubMed] [Google Scholar]
  • 20.Mardanlou V, Tran CH, Franco E. 2014. Design of a molecular bistable system with RNA-mediated regulation. In IEEE 53rd Annual Conf. on Decision and Control (CDC), pp. 4605–4610. ( 10.1109/CDC.2014.7040108) [DOI] [Google Scholar]
  • 21.Chen S, Zhang H, Shi H, Ji W, Feng J. 2012. Automated design of genetic toggle switches with predetermined bistability. ACS Synth. Biol. 1, 284–290. ( 10.1021/sb300027y) [DOI] [PubMed] [Google Scholar]
  • 22.Lipshtat A, Loinger A, Balaban NQ, Biham O. 2006. Genetic toggle switch without cooperative binding. Phys. Rev. Lett. 96, 188101 ( 10.1103/PhysRevLett.96.188101) [DOI] [PubMed] [Google Scholar]
  • 23.Hasty J, Isaacs F, Dolnik M, McMillen D, Collins JJ. 2001. Designer gene networks: towards fundamental cellular control. Chaos 11, 207–220. ( 10.1063/1.1345702) [DOI] [PubMed] [Google Scholar]
  • 24.Siegal-Gaskins D, Grotewold E, Smith GD. 2009. The capacity for multistability in small gene regulatory networks. BMC Syst. Biol. 3, 96 ( 10.1186/1752-0509-3-96) [DOI] [PMC free article] [PubMed] [Google Scholar]
  • 25.Albrecht JT, Chan CP, Edelman A. 2008. Sturm sequences and random eigenvalue distributions. Found. Comput. Math. 9, 461–483. ( 10.1007/s10208-008-9037-x) [DOI] [Google Scholar]
  • 26.Forde J, Nelson P. 2004. Applications of Sturm sequences to bifurcation analysis of delay differential equation models. J. Math. Anal. Appl. 300, 273–284. ( 10.1016/j.jmaa.2004.02.063) [DOI] [Google Scholar]
  • 27.Ncube I. 2013. Stability switching and Hopf bifurcation in a multiple-delayed neural network with distributed delay. J. Math. Anal. Appl. 407, 141–146. ( 10.1016/j.jmaa.2013.05.021) [DOI] [Google Scholar]
  • 28.Canny JF. 1988. The complexity of robot motion planning. Cambridge, MA: MIT Press. [Google Scholar]
  • 29.Panton DB, Verdini WA. 1981. A Fortran program for applying Sturm's theorem in counting internal rates of return. J. Fin. Quant. Anal. 16, 381–388. ( 10.2307/2330245) [DOI] [Google Scholar]
  • 30.Harrington HA, Ho KL, Thorne T, Stumpf MPH. 2012. Parameter-free model discrimination criterion based on steady-state coplanarity. Proc. Natl Acad. Sci. USA 109, 15 746–15 751. ( 10.1073/pnas.1117073109) [DOI] [PMC free article] [PubMed] [Google Scholar]
  • 31.Domijan M, Kirkilionis M. 2009. Bistability and oscillations in chemical reaction networks. J. Math. Biol. 59, 467–501. ( 10.1007/s00285-008-0234-7) [DOI] [PubMed] [Google Scholar]
  • 32.Martínez-Forero I, Peláez-López A, Villoslada P. 2010. Steady state detection of chemical reaction networks using a simplified analytical method. PLoS ONE 5, e10823 ( 10.1371/journal.pone.0010823) [DOI] [PMC free article] [PubMed] [Google Scholar]
  • 33.Manrai AK, Gunawardena J. 2008. The geometry of multisite phosphorylation. Biophys. J. 95, 5533–5543. ( 10.1529/biophysj.108.140632) [DOI] [PMC free article] [PubMed] [Google Scholar]
  • 34.Padirac A, Fujii T, Rondelez Y. 2012. Bottom-up construction of in vitro switchable memories. Proc. Natl Acad. Sci. USA 109, E3212–E3220. ( 10.1073/pnas.1212069109) [DOI] [PMC free article] [PubMed] [Google Scholar]
  • 35.Weiss JN. 1997. The Hill equation revisited: uses and misuses. FASEB J. 11, 835–841. [PubMed] [Google Scholar]
  • 36.Ingalls BP. 2013. Mathematical modeling in systems biology: an introduction. Cambridge, MA: MIT Press. [Google Scholar]
  • 37.Prinz H. 2010. Hill coefficients, dose–response curves and allosteric mechanisms. J. Chem. Biol. 3, 37–44. ( 10.1007/s12154-009-0029-3) [DOI] [PMC free article] [PubMed] [Google Scholar]
  • 38.Goutelle S, et al. 2008. The Hill equation: a review of its capabilities in pharmacological modelling. Fundam. Clin. Pharmacol. 22, 633–648. ( 10.1111/j.1472-8206.2008.00633.x) [DOI] [PubMed] [Google Scholar]
  • 39.Thomas JM. 1941. Sturm's theorem for multiple roots. Nat. Math. Mag. 15, 391–394. ( 10.2307/3028551) [DOI] [Google Scholar]
  • 40.Pedersen P. 1991. Multivariate Sturm theory. In Applied algebra, algebraic algorithms and error-correcting codes, pp. 318–332. Berlin, Germany: Springer. [Google Scholar]
  • 41.Itenberg I, Roy MF. 1996. Multivariate Descartes’ rule. Beitrage Zur Algebra und Geometrie.
  • 42.Lagarias JC, Richardson TJ. 2009. Multivariate Descartes rule of signs and Sturmfels's challenge problem. Math. Intell. 19, 9–15. ( 10.1007/BF03025343) [DOI] [Google Scholar]
  • 43.Jameson GJO. 2006. Counting zeros of generalised polynomials: Descartes’ rule of signs and Laguerre's extensions. Math. Gaz. 90, 223–234. [Google Scholar]

Associated Data

This section collects any data citations, data availability statements, or supplementary materials included in this article.

Supplementary Materials

Supporting Information
rsif20150288supp1.nb (659.6KB, nb)
Toggle circuit analysis and comparison (Mathematica notebook file)
rsif20150288supp2.pdf (115.5KB, pdf)

Articles from Journal of the Royal Society Interface are provided here courtesy of The Royal Society

RESOURCES