Skip to main content
Taylor & Francis Open Select logoLink to Taylor & Francis Open Select
. 2014 Apr 8;8(1):79–98. doi: 10.1080/17513758.2014.904526

Cell cycle dynamics in a response/signalling feedback system with a gap

Xue Gong a,*, Richard Buckalew a,2, Todd Young a,3, Erik Boczko b,4
PMCID: PMC4241679  PMID: 24963979

Abstract

We consider a dynamical model of cell cycles of n cells in a culture in which cells in one specific phase (S for signalling) of the cell cycle produce chemical agents that influence the growth/cell cycle progression of cells in another phase (R for responsive). In the case that the feedback is negative, it is known that subpopulations of cells tend to become clustered in the cell cycle; while for a positive feedback, all the cells tend to become synchronized. In this paper, we suppose that there is a gap between the two phases. The gap can be thought of as modelling the physical reality of a time delay in the production and action of the signalling agents. We completely analyse the dynamics of this system when the cells are arranged into two cell cycle clusters. We also consider the stability of certain important periodic solutions in which clusters of cells have a cyclic arrangement and there are just enough clusters to allow interactions between them. We find that the inclusion of a small gap does not greatly alter the global dynamics of the system; there are still large open sets of parameters for which clustered solutions are stable. Thus, we add to the evidence that clustering can be a robust phenomenon in biological systems. However, the gap does effect the system by enhancing the stability of the stable clustered solutions. We explain this phenomenon in terms of contraction rates (Floquet exponents) in various invariant subspaces of the system. We conclude that in systems for which these models are reasonable, a delay in signalling is advantageous to the emergence of clustering.

Keywords: yeast metabolic oscillations, nonlinear feedback

1. Introduction

1.1. Background

We consider a generalization of a dynamical model of the mitotic cell division cycle (CDC) with response–signalling feedback that was introduced by authors in [2,30]. The dynamics of the model are governed by

1.1.

where c i is the position of the cell within the cycle and Inline graphic denotes the state of all the cells in the culture. Here Inline graphic, so the phase space we consider is the n-torus. The term Inline graphic allows for cells in one part of the cell cycle S (signalling) to effect the growth/progression of cells in another part R (responsive), i.e. feedback. Specifically, we will consider the situations where cells in S produce chemical agents that retard the cell cycle progress of cells that are in R. Positive feedback from S to R could also be considered. In previous studies [2,30], we assumed that R immediately proceeds S, that is, they intersect at a boundary, such as the boundary between the G1 and S phases in yeast. In this manuscript, we explore the modelling assumption that there is a gap between the two regions. A gap is biologically justified by the inevitable delay between the onset of production of a potential signalling agent and its effectiveness.

We are motivated by yeast metabolic oscillations (YMOs), a phenomenon that has been observed in experiments for at least 60 years [10,16,18] and remains a topic of intense interest [5–8,12,19–24,27–29,31]. A link between YMO and the cell division cycle (CDC) was noticed as early as in [16,18], but this connection seems to have been largely ignored. However, in [15,27] a connection between YMO and CDC was again noted in genetic expression time series.

Bockzo et al. [2], based on data in [23], proposed cell cycle clustering as a possible explanation of the interaction between YMO and the CDC. By clustering we mean groups of cells traversing the CDC in near temporal synchrony, not spatial clustering (cultures that exhibit YMO occur in well-mixed bioreactors). In [2,30], we studied both simple and general forms of (1) with the hypothesis that cells in one part of the CDC may influence the growth or CDC progression of cells in other parts of the CDC through diffusible metabolites. We showed analytically and numerically that CDC feedback such as this can robustly cause CDC clustering in the models. For example, a significant subpopulation of cells in the critical S-phase might affect metabolism production and the metabolites may in turn inhibit or promote cell growth in the later part of the G1 phase, thus setting up a feedback mechanism in which YMO and CDC clustering are inextricably intertwined. In [4], a model with an explicit term to represent the signaling agent is studied.

Guided by these mathematical results, we verified the existence of clusters in two types of oscillating yeast cultures using both bud index and cell density data [2,26]. Experimental evidence in [24] also supports the existence of clusters in some YMO experiments. Since Saccharomyces cerevisiae is a model organism, it is important to understand the interconnectedness of the CDC and metabolism [1,6,15,24,27,29]. Also, yeast are used in many bio-engineering processes and understanding their metabolism and cell cycle is of interest in some applications [14,25,31].

In the rest of the paper, we will use Inline graphic to denote the signalling region, R=[r, 1) to denote the response region, and ε to denote the width of the gap, [0, ε], between S and R. The gap is intended to mimic a delay of the chemical signalling agents responsible for the feedback.

For these modelling assumptions to be quantitatively realistic, there need to be some estimate of the size of the gap. One of the metabolites that is known to have effects on cell cycle progression and is thought to be the primary signalling agent in glycolytic oscillations is acetaldehyde [8]. The diffusion rate of acetaldehyde across a yeast cell membrane is estimated to be d=300 s−1 [8], so this rate is very fast. The diffusion/convection in the well-mixed bioreactor is even faster. The decay rate for acetaldehyde in the same yeast bioreactor study was estimated to be Inline graphic [8]. In this experiment, the yeast were performing fast glycolytic oscillations so the production rate of acetaldehyde would need to be on the same order of magnitude. This implies that time scale of a delay is on the order of Inline graphic in the normalized coordinates. The glycolytic oscillation in that experiment had a period of 37 s. Using this as an upper bound of the time scale of acetaldehyde production and diffusion would give us an upper bound on the gap of 0.0025. It is not known with certainty that acetaldehyde is the only or even the dominant signalling agent in the oscillations where clustering has been observed. Thus at this point these estimates are only speculative. Fortunately, as we shall see, we are able to analytically treat a broader range of gaps.

1.2. The feedback model

The following is an RS-feedback with a gap system (compare [30]):

Definition 1.1

Consider n cells whose coordinates are given by c i∈[0, 1], 1 identified with 0. When a cell reaches 1 it continues at 0. We call such a system an RS-feedback system with ε gap if:

  • (H1) R is an interval that precedes another interval S with a small ε length gap, i.e. the distance between the last endpoint of R and the first endpoint of S is ε;

  • (H2) Inline graphic vanishes except when c iR and there are some c j in S;

  • (H3) Inline graphic for all c i and Inline graphic;

  • (H4) Feedback is monotone – adding a cell to S will increase the value Inline graphic for all c iR; and

  • (H5) Inline graphic is a smooth function for c i in the interior or R and each c j in the interior of S, ji and the one-sided derivatives exist at the boundaries of R and S.

A positive feedback will mean that a is positive for c iR when at least one c j is in S. We define a negative feedback analogously.

Hypothesis (H1) specifies the signalling, the response, and the delay in signalling. The meaning of Hypothesis (H2) is that cells will not experience any feedback, unless it is caused by cells in the signalling region. Hypothesis (H3) assumes that feedback is bounded, i.e. there are upper and lower limits on the rate of progression of a cell in the cycle. Note that we are not allowing cell cycle arrest, a common biological state. Hypothesis (H4) supposes that feedback must increase as the number of signalling cells increases. We note that hypotheses (H3) and (H5) (a technical assumption) are sufficient to imply existence and uniqueness of solutions of (1) [30].

Recall that we specify the coordinates throughout the paper as follows:

1.2.

The final endpoint of R is 1, which corresponds to 0, the initial endpoint of the ε gap [0, ε).

In this paper, we will mainly study the following RS system with a gap:

1.2.

where

1.2.

i.e. I is the fraction of cells in the signalling region. The ‘response function’ f(I) in Equation (2) must satisfy f(0)=0 and be monotone (H4), but can be non-linear. These assumptions correspond to the suppositions that no cell in S implies no feedback is exerted and that more cells in S must result in more feedback on cells in R.

It is known in cell cycle models without feedback that the inclusion of small dispersive or diffusive forces leads to asynchronous population profiles in which a ‘steady-state’ profile is asymptotically stable [9,11]. Our previous work shows that this is not the case when feedback is included, but rather populations tend to form temporal clusters. There are other recent discoveries of clustering behaviour due to a negative feedback, especially in phase oscillator models of networks of neurons [13,17].

2. Dynamics of clusters via return maps

In the remainder of this manuscript, we consider the existence and stability of periodic ‘clustered’ solutions. Because the cells are assumed to be identical and obey (1), cells that initially share the same coordinate will remain synchronized as time evolves. By a cluster, we formally mean a group of cells that have identical coordinates in the CDC.

Because clustered solutions will remain clustered, one may consider such solutions using the coordinates of the clusters rather than those of individual cells. In doing so, one may greatly decrease the dimensions of the system. In a yeast bioreactor culture, n can be in the order of 1010, while we may study clustered solutions with a small number of clusters.

For example, if the full system satisfies Equation (2), then the equation of progression for k clusters consisting of an equal number of cells is

2.

where I is the fraction of clusters in the signalling region: Inline graphic.

The extreme case of clustering is if all cells have identical coordinates; then we have a single cluster and Equations (4) will become a single equation. It will be trivial since there will never be a feedback acting on the clusters. The only solution is a periodic solution that runs at velocity 1 around the circle (i.e. Inline graphic for all t>0). We refer to this special clustered solution as synchronized.

We note in [2] that a synchronized solution is locally asymptotically stable for a positive feedback and unstable for a negative feedback in the general model (1). This is because when a group of cells that are nearly synchronized leaves R and enters S the first cells in the group exert feedback on the trailing cells. For a positive feedback, the trailing cells in R will speed up. The cells will eventually approach synchronization. For a negative feedback, cells in R will slow down instead, thus moving further from the synchronized state.

In contrast, with a gap between the responsive region R and the signalling region S, the above situation will not happen. If a solution consists of all cells within ε of each other, then when this group of cells crosses from R to S, all of the cells will be out of R before the first one enters S. Hence, no cells in the solution experience feedback and the following proposition is obtained.

Proposition 2.1

For the most general RS feedback with a gap (1) and Definition 1.1 with either a positive or a negative feedback, the synchronized periodic solution is (locally) neutrally stable.

It is natural to ask whether or not the inclusion of a gap also changes the global dynamics of the system. As discussed in [30], we can assume that all coordinates x j(0) of the k clusters are initially well-ordered as

2.

This ordering is preserved under the dynamics (in a sense that can be made precise) and the first coordinate x 1 must eventually reach 1, i.e. there exists t R such that Inline graphic. Thus, the set x 1=0 defines a Poincaré section for the dynamics and the mapping

2.

defines the corresponding return map.

Starting from t=0, we compute the time t 1 that x k needs to reach 1 and the location of the remaining clusters at this time. As in [30] we define a map F by

2.

Note that Inline graphic by the assumptions. If the clusters are identical to each other, then the map F is a root of the Poincaré map, i.e. F k=P and it can be regarded as a continuous, piecewise smooth map of the (k−1)-dimensional simplex

2.

into itself. See Figure 1.

Fig. 1.

Fig. 1.

An illustration of the map F with k=3; F(x 2, x 3)=(x2, x3).

We concentrate on studying periodic clustered solutions that satisfy:

2.

We will refer to such solutions as k-cyclic clustered solutions. If k is a divisor of n, then a k-cyclic solution exists consisting of n/k cells in each cluster. This fact can be proved using the Brouwer fixed point theorem applied to F [30]. As pointed out in [3], clustered solutions become less and less important as k grows larger.

In the remainder of this manuscript, we will use k to denote the number of clusters and will suppose that each cluster consists of n/k cells.

3. Analysis of k=2 cluster systems

In this section, we will compute and analyse the map F for two equal clusters in the model (4). If we start x 1 at 0 and integrate until x 2 reaches 1, then calculating F reduces to solving:

3.

where Inline graphic or ½, because there can be only one cluster in the signalling region S when another cluster is in the response region R. Let Inline graphic.

We will see that the problem can be analysed by dividing it into the following two cases:

3.

3.1. Case 1: (1+α)(s−ε)<1−r

There are five situations depending on the location of x 2:

  • (a) Inline graphic. In this case, x 1 leaves S before x 2 enters R, thus x 2 is not submitted to any feedback and Inline graphic for all t in [0, 1−x 2]. Hence, Inline graphic

  • Inline graphic. Because x 2 enters the responsive region [r, 1) after x 1 gets into [0, ε) and before x 1 leaves Inline graphic, x 2 is influenced by x 1 for some part of the time when it is in the responsive region. We can obtain the following piecewise-defined function for the position of x 2 depending on time:
    graphic file with name tjbd-8-079-u008.jpg
    where x 2(t 1)=1, so we find Inline graphic. Hence, Inline graphic.
  • Inline graphic. In this case, x 2 is influenced by x 1 for the entire time when x 1 is in the signalling region. This is because x 1 arrives at S after x 2 reaches r and x 1 gets out of S before x 2 reaches 1. We may obtain:
    graphic file with name tjbd-8-079-u009.jpg
    Then Inline graphic.
  • Inline graphic. In this case, x 2 reaches r before x 1 gets into S, and when x 2 reaches 1, x 1 is still in S. We can find the position of x 2:
    graphic file with name tjbd-8-079-u010.jpg
    We can find that Inline graphic by x 2(t 1)=1. Thus, Inline graphic.
  • Inline graphic. In this case, x 1 does not affect x 2 because x 2 reaches 1 before x 1 enters S. So, Inline graphic for all Inline graphic, then Inline graphic.

Combining these five sub-domains, we can obtain the map F for Case I:

3.1.

3.2. Case II: (1+α)(s−ε)≥1−r

Similar to the computation above, we consider five subcases:

  • (a) Inline graphic. Same as Case 1(a), we have Inline graphic.

  • Inline graphic. In this case, x 1 reaches ε first, then x 2 enters R, and x 1 reaches s before x 2 reaches 1. So x 2 is partially influenced by x 1. This yields the position of x 2 expressed by the function:
    graphic file with name tjbd-8-079-u011.jpg
    Hence, we can derive Inline graphic by solving x 2(t 1)=1.
  • Inline graphic. Note that Inline graphic is implied by this case. Here x 2 is influenced by x 1 for the entire time when it is in the responsive region because x 2 enters R after x 1 gets into S and when x 2 reaches 1, x 1 is still in S. We obtain the following piecewise-defined function for the position of x 2:
    graphic file with name tjbd-8-079-u012.jpg
    where Inline graphic. Hence, Inline graphic.
  • Inline graphic. For this case x 2 enters R before x 1 reaches ε, and so it is influenced by x 1 for some part of the time when it is in the responsive region until it reaches 1.
    graphic file with name tjbd-8-079-u013.jpg
    Thus, Inline graphic.
  • Inline graphic. This is the same as Case 1(e) that x 1 does not affect x 2. We obtain: Inline graphic for all t∈[0, 1−x 2]. Thus, Inline graphic.

We combine the five subcases and arrive at the map F for Case II:

3.2.

Analysis of the dynamics

The graph of F coincides with the anti-diagonal y=1−x 2 for Inline graphic and Inline graphic (Figures 2–5). For a positive feedback Inline graphic, it is strictly less than 1−x 2 when Inline graphic (Figures 2 and 4); while for a negative feedback α<0, it is strictly greater than 1−x 2 if Inline graphic (Figures 3 and 5). In the following discussion, we consider the restriction that Inline graphic is relatively small.

Fig. 2.

Fig. 2.

Return map F for Case I when α=0.5, s=0.2, r=0.6, and ε=0.05.

Fig. 3.

Fig. 3.

Return map F for Case I when α=−0.5, s=0.2, r=0.6, and ε=0.05.

Fig. 4.

Fig. 4.

Return map F for Case II when α=0.5, s=0.4, r=0.6, and ε=0.05.

Fig. 5.

Fig. 5.

Return map F for Case II when α=−0.3, s=0.4, r=0.8, and ε=0.05.

For Case I (Inline graphic), it is seen that

graphic file with name tjbd-8-079-u014.jpg

Therefore, the graph of F cannot intersect Inline graphic at the line segments IV and V or the points C and D. This is illustrated in Figures 2 and 3.

Similarly, for Case II (Inline graphic), we can find that the graph of F and the diagonal cannot intersect at C, IV, D or V (see Figures 4 and 5), because

graphic file with name tjbd-8-079-u015.jpg

Considering the above situations, we conclude the following:

  • (1) If Inline graphic, the intersection of the graph of F and the diagonal y=x 2 lies in the first line segment (0<x 2<rs), denoted as I. Each point of the interval [1−r+s, rs] is part of a 2-periodic orbit Inline graphic, except for the point Inline graphic which is fixed. Hence, the return map F 2 has an interval of neutrally stable fixed points centered around Inline graphic.

  • If Inline graphic, the intersection, denoted as A is at Inline graphic. It is a unique fixed point that is stable for negative α and unstable for positive α.

  • If Inline graphic, then Inline graphic, thus Inline graphic. There are three possibilities depending on where the diagonal line y=x 2 intersects the graph of F. Also here, we need to consider Case I and Case II separately.
    • (a) If the diagonal intersects the second line segment (II), the intersection lies in the interval Inline graphic for Case I or Inline graphic for Case II. Hence, there is a unique fixed point. It is stable if α<0 and unstable if α>0.
    • If the diagonal hits the boundary between segments II and III of F (point B as in the figures), there is a unique fixed point at Inline graphic for Case I or at Inline graphic for Case II, which is stable for negative α and unstable for positive α.
    • If the diagonal intersects the third segment (III) of the graph of F, since the slope is −1, there is an interval of neutral period 2 points containing in Inline graphic for Case I or Inline graphic for Case II. The edge of the interval is stable for negative α and unstable for positive α.

Note that in all cases, the 2-cyclic solution corresponds to the unique fixed point of F. According to the above results, we find four distinct types of dynamics; two for positive feedback and two for negative feedback.

  • Positive feedback:
    • (a) The 2-cyclic solution is unstable when the intersection is at II, A or B.
    • The 2-cyclic solution belongs to an interval of fixed points of period-2 solutions when the intersection is at I or III. This interval is repelling.
  • Negative Feedback:
    • (a) The 2-cyclic solution is stable when the intersection is at II, A or B.
    • The 2-cyclic solution belongs to an interval of fixed points of period-2 solutions when the intersection is at I or III. This interval is attracting.

These behaviours are exactly the same as for the model with no gaps [30].

Furthermore, we note that in the parameter regions where the fixed point of the map is either stable or unstable, the slopes of F are exactly the same as for the model without gaps (see [30]).

4. Cyclic k=M+1 cluster solutions

4.1. Isolated solutions

Denote |S| as the length of the interval Inline graphic, which is s−ε and |R|=1−r denotes the length of the interval R=[r, 1). We say that a cluster of cells is isolated if there are gaps between the cluster and any other cells on either side of length at least Inline graphic and strictly isolated if the widths of gaps are more than Inline graphic. Strictly isolated clusters cannot exert feedback on cells outside the cluster, or have feedback exerted upon them from outside.

We consider the case only when ε is small, i.e. Inline graphic, as in the former section. The following definition will play a large role in the analysis of the model.

Definition 4.1

Define

Definition 4.1

i.e. M is the maximum number of isolated clusters that can simultaneously exist.

We will consider the cyclic solutions consisting of k=M+1 clusters. For k=M+1, it can be shown that the cyclic k-cluster solution has initial conditions: Inline graphic. During each time interval d, each cluster will move to the position of the cluster ahead of it.

For k=M+1 and for all solutions in a neighbourhood of the cyclic solution above, at most one cluster can be in the signalling region S at a time. Thus, the feedback experienced by any cluster in R is either 0 or f(1/k). Hereafter, when studying systems with k=M+1 clusters, we will use the abbreviation:

4.1.

4.2. Order of events for the cyclic solution

The evolution of a solution can be described in terms of the order of events of the solution. Clusters of cells progress through the cell cycle at rates specified by Equation (2). These rates remain constant until a cluster reaches ε, s, r, or 1. Given the next such event and the index j of the cluster for which it occurs, we can calculate the time elapsed until the event occurs by finding out the initial position of cluster j and its corresponding rate during that time. We will use Inline graphic to denote the event that cluster j reaches the milestone μ. Then for the order of events, for example, as in Case I below the notation Inline graphic means that first x 1 reaches point ε, then x k reaches r, etc.

We discuss in the following cases the possibilities of the orders of events for the cyclic solution.

Case I: x 2=d>s and Inline graphic.

By calculating the position of x k in each step, we have

4.2.

Here, x k(t 1)=1. So, Inline graphic (Inline graphic). At time t 1, x 1 reaches x 2=d (since it is moving with speed 1). Thus,

4.2.

One can solve for d:

4.2.

This case can only happen when d>s and Inline graphic. Using Equation (9) in these two inequalities gives conditions on r and s required by this order of events:

4.2.

Case II: x 2=d>s and Inline graphic.

Similar to Case I, we may calculate:

4.2.

The above d also needs to satisfy d>s and Inline graphic, so we obtain:

4.2.

Case III: x 2=d>s and Inline graphic.

This order of events can happen only when x k>r. We can find that d is the same as in Equation (11), Inline graphic, and the order of events in this case implies the inequalities:

4.2.

Case IV: x 2=d<s and Inline graphic.

After some calculation of the final position of x 1, we find that

4.2.

This case occurs under the conditions that Inline graphic and x k<r. Using Equation (14) with the order of events gives that

4.2.

Case V: Inline graphic and Inline graphic.

After a similar calculation, we find the same d as in Equation (14) that is Inline graphic. Applying this result to Inline graphic and Inline graphic, we obtain the following conditions for Case V to occur:

4.2.

Case VI: Inline graphic.

This case occurs if and only if d<s and Inline graphic. Solving for d, we find that

4.2.

We substitute Equation (17) into the above inequalities to obtain:

4.2.

The regions described by the inequalities in Equations (10)–(18) are illustrated in Figure 6. We can observe that cases I–VI exhaust the parameter set in (r, s) and there is never more than one cluster in the signalling region when R is non-empty. Thus the dynamics of the system are determined by the feedback Inline graphic.

Fig. 6.

Fig. 6.

Regions of parameter space for the k cyclic solutions with k=M+1. Here the feedback is negative with β=−.2 and the gap is ε=0.03. The widest diagonal band contains the parameters for k=2 and is partitioned into six cases. Note that case VI disobeys the constraint ε<rs. The rest of the diagonal bands contain parameters for k=3, 4, … and each of them is partitioned into five cases.

4.3. Stability of the cyclic solution

Now we will calculate the return map F. We note that F is affine in a neighbourhood of the cyclic solution provided that the parameters are in the interior of one of the cases. Thus, Inline graphic where Inline graphic where A is a matrix. To find the stability of the fixed point, the linear part of the system, i.e. A needs to be analysed.

In Case I, we can calculate the time for x k reaching at 1, that is Inline graphic. Since each of the clusters moves for time t 1, we can find Inline graphic for Inline graphic. Given that x 1=0 and x k(t 1)=1, we have Inline graphic and F(x k)=1. Thus we can obtain the matrix A by taking the partial derivatives of the return map Inline graphic:

4.3.

In [30], it was proved that all the eigenvalues of A defined by Equation (19) lie outside of the unit disc for β>0 and lie on the interior of the unit disc for β<0. Thus, the fixed point of the return map F in Case I is stable for a negative feedback and unstable for a positive feedback, so is the k-cyclic solution.

In Cases II and III, following the same procedures as above, we can calculate that Inline graphic. Thus, Inline graphic for Inline graphic, Inline graphic, and x k(t 1)=1. Therefore, the linear part of the map at the fixed point is represented by the matrix:

4.3.

In Cases IV and V, we can find that Inline graphic. Here the coefficient for the x k term is still −1, so the linear part of the map is the same as the matrix A given by Equation (20) in cases II and III. It is well known that the eigenvalues of this matrix A all have (complex) modulus 1. Thus, the k-cyclic solution is neutrally stable in all the cases from II to V.

For Case VI, the time for x k to arrive at 1 is Inline graphic. Note that this case only occurs for M=1 or k=2 and Inline graphic. For M>1 and Inline graphic, this region is outside the band k=M+1. The matrix A can be derived as follows:

4.3.

We can use a change of variable to study the stability of this return map compared in the result for Equation (19). We conclude that the fixed point is stable for a positive feedback and unstable for a negative feedback in this case.

The dynamics for the k=M+1 cyclic solutions can be summarized as follows:

  • (1) When Inline graphic and Inline graphic, the k-cyclic solution is stable for a negative feedback and unstable for a positive feedback.

  • For k=2 and Inline graphic, when Inline graphic and Inline graphic, the k-cyclic solution is stable for a positive feedback and unstable for negative feedback.

  • Otherwise, the k=M+1-cyclic solution is neutrally stable.

The behaviour in Equation (2) occurs only on a small part of parameter space with Inline graphic, i.e. Case VI in Figure 6.

The behaviour in Equations (1) and (3) is entirely consistent with those for the model without a gap [30]. Further, as noted above, the matrix DF in the stable and unstable cases are exactly the same as for the model without a gap. Thus, the gap does not even alter the strength of the stability or instability; the linearization of the return maps is exactly the same.

We note that the region in parameter space for which the k=M+1 cyclic solution is stable is exactly the same as for the model without a gap, except the strip of width ε representing Case II is removed.

5. Numerical simulations

5.1. Observed clusters

We simulated n=420 cells for the model with and without a gap of Inline graphic. It was studied that clusters form under negative feedback and the exact form of the feedback function does not matter for the general RS feedback system in [30]; thus, in all the simulations we set the feedback function to be f(I)=−I for simplicity. We used a first-order Euler integration with an adaptive step size so that the step matched intervals on which the vector field is constant. By doing this there is no truncation error and all calculations are locally accurate to machine precision.

In Figure 7, we show the number of clusters that appear in simulations of the model with and without a gap. For each pair of parameter values (s, r), we started with a equi-distributed initial condition and integrated for 100 cell cycles. The number of clusters were counted using a variation of a standard clustering algorithm DBSCAN. One can see that the main features of the plot are unchanged by the addition of a small gap. Note that in both plots, for all but a narrow set of (s, r) values around the perimeter, clusters always emerge. We visually inspected a large selection of simulations and observed that in all instances where the algorithm indicated clustering, the solutions were in fact unambiguously clustered. Figure 8 gives some simulation results showing how clusters emerge.

Fig. 7.

Fig. 7.

The number of clusters realized in a cell cycle simulation (a) with no gap and (b) with a gap of ε=0.05 when s≥0.01 and ε=0.5 s when s<0.1. In both plots, the feedback is linear and negative with f(I)=−I. Note the strong agreement between the two plots.

Fig. 8.

Fig. 8.

Clustering of n=120 equi-distributed cells.(a) For s=0.2, r=0.6 and ε=0.03, the cells converge to two clusters. (b) For s=0.2, r=0.8 and ε=0.01, the cells converge to three clusters. For all simulations the feedback was taken to be f(I)=−I. Note in (a) that they first appear to form four clusters, but merge into two clusters.

As predicted in Sections 3 and 4, the global dynamics with and without a gap are qualitatively the same.

5.2. Speed of convergence

In completing the experiments for Figure 7, we noticed that despite the prediction that the global dynamics be the same, the simulations with a gap tended to converge to the periodic orbits more quickly than without a gap. In Figure 9, we study the speed of convergence to clustered solutions in simulations with a negative feedback. Again we started with evenly distributed initial condition. In order to study the convergence, we used the vector of gaps:

5.2.

where d(x, y) is the distance from x to y on the circle in the direction of the orientation. The Euclidean norm squared, Inline graphic is a measure of how clustered a solution is. It has a global minimum when the cells are equi-distributed around the circle and a maximum (of 1) when all the cells have the same location (synchronized). In the simulation, G was measured at the end of each cycle on the Poincaré section Inline graphic.

Fig. 9.

Fig. 9.

Comparison of convergence speed for the model with and without a gap of ε=0.01 and n=60 cells. Norm squared of the gap vector G vs. time. (a) For s=0.2 and r=0.9 both models converge to four clusters. (b) For s=0.3 and r=0.7 both models converge to two clusters. For all simulations the feedback was taken to be f(I)=−I, and the initial condition was evenly distributed – the global minimum for 0. The model with gaps converges to the clustered solutions much more quickly.

For the models with and without a gap, we see that solutions converge to a stable clustered configuration. For the model with even a modest gap of Inline graphic this convergence is much more rapid. This seems to contradict the conclusions of Sections 3 and 4, where we observed that stable cyclic solutions have exactly the same Floquet exponents for the gap and non-gap models. However, the calculation in Sections 3 and 4 were completed in the clustered subspace, not in the full phase space of n cells. In the case of a negative feedback, where clustered solutions tend to be stable, the model without a gap has a local linear instability effect on individual clusters as they cross the RS boundary. In the gap system, this effect does not occur as reflected in Proposition 2.1. The Floquet exponents in the full phase space are more negative with a gap since individual clusters are not locally unstable.

To take a close look at this, we consider a small perturbation of the cyclic solution, close enough to the cyclic solution so that the order of events for those new groups of points does not change (i.e. if one cluster leaves S before another enters R, after dispersion the two clusters and viewing them as two groups of cells, we now have all cells in one group leave S before any cells in the second group enter R). For the k-cyclic solution, we denote each group by 1, 2, 3, … , k. Let time run until the first cell in group k reaches at r and denote the diameter of the kth group at this time to be δ. Then when this group has entirely entered R, its diameter has reduced to Inline graphic because each cell in the group is subjected to negative feedback β since another group of cells has been in S during this time.

For the model without a gap, let time run until the first cell of the kth group lies on 1. Because cells which have reached 1 will travel with velocity 1, the diameter of this group after it passes 1 entirely will be the amount of time it takes for the cell lying at Inline graphic (i.e. the last cell in this group) to reach at 1. To find the maximum of this diameter, we consider the worst case that one cell lies at Inline graphic and all other cells of this group are at 1. We can easily calculate that the time it takes for the one cell at Inline graphic to arrive at 1:

5.2.

Thus, the diameter of the group is Inline graphic. f above is the feedback function and the fraction inside is obtained by calculating the proportion of cells inside S during this time. By monotonicity of f, for negative feedback, Inline graphic. Therefore, the diameter for the kth group is strictly less than δ. We can conclude that after each cycle, the diameter δ of a cluster may shrink to Inline graphic.

For the model with ε-gap, we may assume that Inline graphic. When the last cell in the kth group reaches at 1, the rest of the cells in the group still lie inside [0, ε], thus the feedback remains the same. Therefore, the diameter of the group shrinks from δ to Inline graphic for a negative feedback. Obviously, Inline graphic for −1<β<0, and in fact the contraction factor in the worst case for the system without a gap will be very close to 1. This shows that the spectral radius of the linearization for the no-gap system is much closer to 1 than the system with a gap. Thus the maximum eigenvalue of the linearization is smaller for the system with a gap.

The differences in the (local) Floquet exponents account for the marked differences in the convergence once the solution is in a neighbourhood of the clustered solution. These differences are apparent in Figure 9.

It can also be seen in Figure 9 that with a gap, solutions also reach a neighbourhood of the attracting periodic orbit much more rapidly. Generally speaking this can be due to either (1) increased rates of repulsion at repellers (probably unstable periodic orbits) or (2) global factors. The first of these might be amendable to analysis while the second is very difficult to assess.

5.3. Simulations with (relatively) large gaps

Note that the condition Inline graphic is assumed in Sections 3 and 4. This condition states that:

The gap going from R to S is smaller than the gap going from S to R.

Thus if the condition fails, then we are dealing with a fundamentally different kind of system; a system in which S could be viewed as located ahead of R rather than vice versa.

One situation where the condition is violated is when ε is small, but rs is even smaller. We encountered this in Case IV in Section 4, where the dynamics were essentially reversed; the clustered solutions become unstable. In Figure 7, we also observed the violation of the condition for parameter values near the diagonal line r=s. There we observe synchronous solutions.

In order to shed more light on the condition Inline graphic, we performed several numerical experiments. In Figure 10, we show the final position of 40 cells after integrating until the system stabilizes to a periodic solution or until a maximum number of steps is reached. Here we set s=0.5 and r=0.8 and let ε vary on the interval [0.01, 0.49]. When Inline graphic, two clusters emerge as we expect from earlier analysis. As ε approaches rs=0.3 the stability of the 2-cluster solution weakens and at Inline graphic there appears to be a bifurcation. At the critical value Inline graphic, where R and S are equal in size and exactly opposite one another, no clustering occurs at all, and near that value there appears to be complex and unpredictable behaviour. When ε is approximately 0.37, three clusters emerge. We note that this value corresponds to Inline graphic, so that it might be possible for three clusters to circulate without interacting. However, a closer look at the numerics reveals that the clusters are in fact interacting and are asymptotically stable with respect to small perturbations. Thus, we conclude that beyond the parameter domain of Inline graphic the dynamics exhibit completely different characteristics that would require further analysis to understand.

Fig. 10.

Fig. 10.

The final configuration of cells in systems with gap sizes varying in [0.1, 4.9].

6. Discussion

Inclusion of a gap in the cell cycle system is a reasonable biological modelling assumption. We have found that inclusion of the gap does not complicate the model beyond amenability to do rigorous analysis.

We have fully studied the dynamics of this system when the cells are arranged into two cell cycle clusters. We have shown that the dynamics in this subspace are almost the same as for the model without a gap. The only difference is that the ε-gap introduces a corresponding ε interval of neutral solutions near the synchronous solution. Because this solution has no basin of attraction beyond itself, it is not likely to be realized in real systems.

We also considered the stability of cyclic periodic solutions with k=M+1 clusters; just enough clusters to guarantee that interactions occur between consecutive clusters. For these cases, we again find that the dynamics mirror those of the system with no gap.

Simulations support these analytical conclusions. We find that the inclusion of a small gap does not greatly alter the global dynamics of the system. Across a wide set of possible parameter values, solutions tend exactly to the same clustering configurations for the gap and no-gap systems.

Thus in the gap model, like the less realistic model with no gap, we find that there are large open sets of parameters for which clustering is a stable phenomenon. We conclude that one should expect to see clustering in some biological systems.

On the other hand, simulations reveal that inclusion of the gap significantly enhances the stability of the stable cyclic solutions and significantly increases the rates at which solutions converge to a stable clustered solution. In simulations the rate of convergence was around twice as fast. Analysis reveals that the gap increases the local stability of a stable cyclic solution.

For a phenomenon to be observable in biological systems, it need not only be stable, but it must be realizable on a time scale that is biologically realistic. These results show that a delay in signalling actually favours clustering.

Funding

This work was supported by the NIH-NIGMS [grant number R01GM090207].

REFERENCES

  1. Boczko E.M., Cooper T.G., Gedeon T., Mischaikow K., Murdock D.G., Pratap S., Wells K.S. Structure theorems and the dynamics of nitrogen catabolite repression in yeast . Proc. Natl Acad. Sci. USA. 2005;102:5647–5652. doi: 10.1073/pnas.0501339102. [DOI] [PMC free article] [PubMed] [Google Scholar]
  2. Boczko E., Gedeon T., Stowers C., Young T. ODE, RDE and SDE models of cell cycle dynamics and clustering in yeast . J. Biol. Dyn. 2010;4:328–345. doi: 10.1080/17513750903288003. [DOI] [PMC free article] [PubMed] [Google Scholar]
  3. doi: 10.1007/s00285-014-0786-7. N. Breitsch, G. Moses, T. Young, and E. Boczko, Cell cycle dynamics: Clustering is universal in negative feedback systems, preprint (2012), submitted for publication. Available at http://www.math.ohiou.edu/young/preprints/breitsch.pdf.zip. [DOI] [PubMed]
  4. Buckalew R. Cell cycle clustering and quorum sensing in a nonlinear mediated feedback model, Discrete. Contin. Dyn. Syst. Ser. B. 2014;19(4) Available at http://www.ohio.edu/people/rb301008/mediated_final.pdf. [Google Scholar]
  5. Buese M., Kopmann A., Diekmann H., Thoma M. Oxygen, pH value, and carbon source induced changes of the mode of oscillation in synchronous continuous culture of Saccharomyces ceravisiae . Biotechn. Bioeng. 1998;63:410–417. doi: 10.1002/(SICI)1097-0290(19990520)63:4&#x0003c;410::AID-BIT4&#x0003e;3.0.CO;2-R. [DOI] [PubMed] [Google Scholar]
  6. Chen Z., Odstrcil E.A., Tu B.P., McKnight S.L. Restriction of DNA replication to the reductive phase of the metabolic cycle protects genome integrity . Science. 2007;316:1916–1919. doi: 10.1126/science.1140958. [DOI] [PubMed] [Google Scholar]
  7. Danø S., Madsen M.F., Sørensen P.G. Quantitative characterization of cell synchronization in yeast . Proc. Natl Acad. Sci. USA. 2007;104:12732–12736. doi: 10.1073/pnas.0702560104. [DOI] [PMC free article] [PubMed] [Google Scholar]
  8. Monte S. De, d'Ovidio F., Danø S., Sørensen P.G. Dynamical quorum sensing: Population density encoded in cellular dynamics . Proc. Natl Acad. Sci. USA. 2007;104:18377–18381. doi: 10.1073/pnas.0706089104. [DOI] [PMC free article] [PubMed] [Google Scholar]
  9. Diekmann O., Heijmans H., Thieme H. On the stability of the cell size distribution . J. Math. Biol. 1984;19:227–248. doi: 10.1007/BF00277748. [DOI] [Google Scholar]
  10. Finn R.K., Wilson R.E. Population dynamics of a continuous propagator for microorganisms . J. Agric. Food Chem. 1954;2:66–69. doi: 10.1021/jf60022a003. [DOI] [Google Scholar]
  11. Hannsgen K., Tyson J. Stability of the steady-state size distribution in a model of cell growth and division . J. Math. Biol. 1985;22:293–301. doi: 10.1007/BF00276487. [DOI] [PubMed] [Google Scholar]
  12. Henson M.A. Cell ensemble modeling of metabolic oscillations in continuous yeast cultures . Comput. Chem. Engin. 2005;29:645–661. doi: 10.1016/j.compchemeng.2004.08.018. [DOI] [Google Scholar]
  13. Kilpatrick Z.P., Ermentrout B. Sparse gamma rhythms arising through clustering in adapting neuronal networks . PLoS Comput. Biol. 2011;7 doi: 10.1371/journal.pcbi.1002281. e1002281. [DOI] [PMC free article] [PubMed] [Google Scholar]
  14. Kjeldsen T., Ludvigsen S., Diers I., Balshmidt P., Sorensen A., Kaarshold N. Engineering-enhanced protein secretory expression in yeast with applications to insulin . J. Biol. Chem. 2002;277:18245–18248. doi: 10.1074/jbc.C200137200. [DOI] [PubMed] [Google Scholar]
  15. Klevecz R.R., Murray D. Genome wide oscillations in expression . Mol. Biol. Rep. 2001;28:73–82. doi: 10.1023/A:1017909012215. [DOI] [PubMed] [Google Scholar]
  16. Kuenzi M.T., Fiechter A. Changes in carbohydrate composition and trehalose activity during the budding cycle of Saccharomyces cerevisiae . Arch. Microbiol. 1969;64:396–407. doi: 10.1007/BF00417021. [DOI] [PubMed] [Google Scholar]
  17. Mauroy A., Sepulchre R. Clustering behaviors in networks of integrate-and-fire oscillators . Chaos. 2008;18 doi: 10.1063/1.2967806. 037122. [DOI] [PubMed] [Google Scholar]
  18. Meyenburg H.K. von. Energetics of the budding cycle of Saccharomyces cerevisiae during glucose limited aerobic growth . Arch. Microbiol. 1969;66:289–303. doi: 10.1007/BF00414585. [DOI] [PubMed] [Google Scholar]
  19. Murray D., Klevecz R., Lloyd D. Generation and maintenance of synchrony in Saccharomyces cerevisiae continuous culture . Exp. Cell Res. 2003;287:10–15. doi: 10.1016/S0014-4827(03)00068-5. [DOI] [PubMed] [Google Scholar]
  20. Palkova Z., Forstova J. Yeast colonies synchronize their growth and development . J. Cell Sci. 2000;113:1923–1928. doi: 10.1242/jcs.113.11.1923. [DOI] [PubMed] [Google Scholar]
  21. Patnaik P.R. Oscillatory metabolism of Saccharomyces cerevisiae: An overview of mechanisms and models . Biotech. Adv. 2003;21:183–192. doi: 10.1016/S0734-9750(03)00022-3. [DOI] [PubMed] [Google Scholar]
  22. Richard P. The rhythm of yeast . FEMS Microbiol. Rev. 2003;27:547–557. doi: 10.1016/S0168-6445(03)00065-2. [DOI] [PubMed] [Google Scholar]
  23. Robertson J.B., Stowers C.C., Boczko E.M., Johnson C.H. Real-time luminescence monitoring of cell-cycle and respiratory oscillations in yeast . Proc. Natl Acad. Sci. USA. 2008;105(46):17988–17993. doi: 10.1073/pnas.0809482105. PMCID:2584751. [DOI] [PMC free article] [PubMed] [Google Scholar]
  24. Slavov N., Botstein D. Coupling among growth rate response, metabolic cycle, and cell division cycle in yeast . Mol. Biol. Cell. 2011;22:1999–2009. doi: 10.1091/mbc.E11-02-0132. [DOI] [PMC free article] [PubMed] [Google Scholar]
  25. Stowers C., Robertson J.B., Ban H., Tanner R.D., Boczko E.M. Periodic fermentor yield and enhanced product enrichment from autonomous oscillations . Appl. Biochem. Biotechnol. 2009;156(1–3):59–75. doi: 10.1007/s12010-008-8486-7. [DOI] [PubMed] [Google Scholar]
  26. Stowers C., Young T., Boczko E. The structure of populations of budding yeast in response to feedback . Hypoth. Life Sci. 2011;1(3):71–84. [Google Scholar]
  27. Tu B.P., Kudlicki A., Rowicka M., McKnight S.L. Logic of the yeast metabolic cycle: temporal compartmentation of cellular processes . Science. 2005;310:1152–1158. doi: 10.1126/science.1120499. [DOI] [PubMed] [Google Scholar]
  28. Walker G. Synchronization of yeast cell populations . Methods Cell Sci. 1999;21:87–93. doi: 10.1023/A:1009824520278. [DOI] [PubMed] [Google Scholar]
  29. Wang J., Liu W., Uno T., Tonozuka H., Mitsui K., Tsurugi K. Cellular stress response oscillate in synchronization with the ultridian oscillation of energy metabolism in the yeast Saccharomyces cervisiae . FEMS Microbiol. Lett. 2000;189:9–13. doi: 10.1111/j.1574-6968.2000.tb09198.x. [DOI] [PubMed] [Google Scholar]
  30. Young T., Fernandez B., Buckalew R., Moses G., Boczko E. Clustering in cell cycle dynamics with general responsive/signaling feedback . J. Theor. Biol. 2012;292:103–115. doi: 10.1016/j.jtbi.2011.10.002. [DOI] [PMC free article] [PubMed] [Google Scholar]
  31. Zhu G., Zamamiri A., Henson M.A., Hjortsø M.A. Model predictive control of continuous yeast bioreactors using cell population balance models . Chem. Eng. Sci. 2000;55:6155–6167. doi: 10.1016/S0009-2509(00)00208-6. [DOI] [Google Scholar]

Articles from Journal of Biological Dynamics are provided here courtesy of Taylor & Francis

RESOURCES