betaFeedback

WorksAgricultural and Biological Sciences

The impact of DNA replication on the timing of cellular events

Abstract

Cellular timing often relies on the accumulation of a regulatory protein to a threshold. For a stable protein produced at a constant rate, the threshold alone sets timing precision: the squared coefficient of variation of the first-passage time is the inverse of the threshold number of molecules. This counting limit appears to be a fundamental constraint. However, production rates vary across the cell cycle. By solving exactly a stochastic model coupling DNA replication and protein accumulation, we show that when a gene replicates at an optimal time, precision exceeds the counting limit.

Gene expression is intrinsically stochastic: the individual biochemical events underlying it, such as transcription, translation, and degradation, occur at random times. This randomness in event timing gives rise to cell-to-cell variability in molecule numbers [1, 2]. Correspondingly, the time required to reach a given molecule number threshold is a random variable that is governed by first-passage-time (FPT) statistics [3, 4, 5]. A common strategy by which cells schedule events is to accumulate a regulatory protein until its copy number first reaches a threshold, triggering a downstream process [6]. Accurate timing is often essential to biological function. For example, during embryonic development, Hox genes are switched on in a strict temporal sequence [7, 8], with premature activation of some of them resulting in a truncated body axis [9]. Timing is equally critical in the cell cycle, where each phase transition is triggered when phase-specific cyclins accumulate beyond a threshold level [10]. In both cases, it is not the average amount of a gene product that is decisive but, rather, the timing of the event and its reproducibility across cells. The key quantity is therefore the time at which product first reaches a triggering threshold, and its variability across the cell population.

The simplest reference case for this scenario is a stable protein produced by a single Poisson process at constant rate kk. The time it takes to accumulate λ\lambda molecules is then a sum of λ\lambda independent exponential waiting times, i.e., Erlang distributed, with mean λ/k\lambda/k and squared coefficient of variation CV2=1/λ\mathrm{CV}^{2}=1/\lambda [3], which we henceforth refer to as the counting limit.

However, this picture is incomplete, as protein production rates are not constant across the cell cycle: when a gene is replicated at a well-defined point in the cycle, its copy number doubles and the effective protein production rate also increases. This increase is roughly twofold in some cases [11]; however, for many genes, it is significantly reduced by dosage compensation [12]. How replication affects copy-number and concentration distributions has been studied using a variety of stochastic models [13, 14, 15, 16, 17, 18]. By contrast, the effect of replication on the timing of threshold crossing has been examined only recently, in a model where replication is triggered when the gene’s own mRNA count reaches a fixed value and dosage is not compensated [19]. In reality, however, a gene’s replication time is set by the cell-cycle programme, independently of its own expression.

Here, we study a general model in which replication is timed independently of copy-number fluctuations and gene dosage may be partially compensated. We obtain the exact FPT distribution for the protein copy number to reach a threshold, and we crucially show that the coupling of protein accumulation to DNA replication can push the noise in the FPT below the counting limit 1/λ1/\lambda. Furthermore, there is an optimal mean replication time at which the timing precision is maximal; when replication is itself the noisier clock, the coupling can instead amplify the noise above that limit.

Model—We model a gene GG that synthesises a stable protein PP and undergoes replication as an NN-step process (Fig. 1):

G0→αG1→α⋯→αGN,Gj<N→kGj<N+P,G_0 \xrightarrow{\alpha} G_1 \xrightarrow{\alpha} \cdots\xrightarrow{\alpha} G_N,\qquad G_{j<N} \xrightarrow{k} G_{j<N}+P,
GN→2kGN+P.(1)G_N \xrightarrow{2k} G_N+P. \tag*{(1)}

The gene advances through the states G0→G1→⋯→GNG_0 \to G_1 \to\cdots\to G_N at some constant rate α\alpha; the corresponding NN steps represent progression from the initial time t=0t=0 to replication of the gene, which doubles its copy number in the final transition (N−1→NN-1 \to N). The time to DNA replication is therefore Erlang distributed,

TR∼Erlang⁡(N,N/⟨TR⟩)T_R \sim\operatorname{Erlang}(N, N/\langle T_R\rangle), with mean ⟨TR⟩=N/α\langle T_R\rangle= N/\alpha and squared coefficient of variation CVTR2=1/N\mathrm{CV}_{T_R}^{2} = 1/N. Hence, ⟨TR⟩\langle T_R\rangle is the mean time from the onset of the replication process at t=0t = 0 until the gene is replicated. The multistep, constant-rate setup in Eq. (1) reproduces the non-exponential, Erlang-like distributions of cell-cycle and phase durations measured experimentally [20, 21], and has also been applied in models of gene expression with replication and dosage compensation [13, 14, 15, 22]. In these models, replication occurs after a fixed number of steps, i.e., at a reproducible fraction of the cell cycle, as in the stretched cell cycle model used to describe eukaryotic cells [16, 23]; correspondingly, we take NN steps to represent that fraction of the cell-cycle progression. Protein PP is produced at rate kk before replication and at the amplified rate Λk\Lambda k after. The dosage factor Λ\Lambda captures the change in gene dosage (Figure 1, top inset): Λ=2\Lambda= 2 corresponds to exact copy-number doubling, while dosage-compensation mechanisms that partially buffer the extra gene copy place Λ\Lambda between 1 and 2 [12, 24, 25, 26]; our analysis holds for any Λ≥1\Lambda\ge1. We assume protein PP to be stable on the timescale of interest. Since over 70% of proteins in mouse fibroblasts have half-lives exceeding the cell cycle duration of around 27 hours [27], degradation is negligible when the threshold must be reached well within a cycle. Similarly, in growing E. coli, most proteins are not actively degraded [28, 29] within a single cell cycle. We assume that at t=0t = 0 – i.e., at the onset of both protein accumulation and the replication clock – the gene is in state G0G_0 and that no copies of PP are present. We then solve for the distribution of the FPT TT at which the copy number of PP first reaches λ\lambda.

Figure 1. Illustration of the model coupling protein accumulation to DNA replication. Outer ring: with one gene copy (teal), replication advances through NN exponential steps at rate α=N/⟨TR⟩\alpha= N/\langle T_R\rangle, where ⟨TR⟩\langle T_R\rangle is the mean time from t=0t = 0 until the gene is replicated; replication of the gene ends when step NN is reached, and the cell cycle continues with two gene copies (red) until division. Insets: gene dosage (top), where replication raises the production rate from kk to Λk\Lambda k, with Λ≥1\Lambda\ge1; protein counts (bottom) accumulate at these rates up to the threshold λ\lambda. Grey: single trajectories; solid lines: mean counts before and after replication; orange: distribution of the FPT TT at λ\lambda.

**Exact first-passage-time distribution—**The joint probability of the protein count and the replication state obeys a chemical master equation [30], which we solve exactly using the Laplace transform; see the

Supplemental Material for the derivation. Denoting by h~(s)=∫0∞e−sth(t) dt\tilde{h}(s)=\int_{0}^{\infty}e^{-st}h(t)\,\mathrm{d}t the transform of the FPT density h(t)h(t), we obtain

h~(s)=(ks+k)λIp(λ,N)+(kΛs+kΛ)λ(NΛ/⟨TR⟩s(Λ−1)+NΛ/⟨TR⟩)NIp′(N,λ),(2)\tilde{h}(s)=\left(\frac{k}{s+k}\right)^{\lambda}I_p(\lambda,N)+\left(\frac{k\Lambda}{s+k\Lambda}\right)^{\lambda}\left(\frac{N\Lambda/\langle T_R\rangle}{s(\Lambda-1)+N\Lambda/\langle T_R\rangle}\right)^N I_{p'}(N,\lambda), \tag*{(2)}

where

p=s+ks+k+N/⟨TR⟩,p′=s(Λ−1)+NΛ/⟨TR⟩[s+k+N/⟨TR⟩]Λ,(3)p=\frac{s+k}{s+k+N/\langle T_R\rangle},\qquad p'=\frac{s(\Lambda-1)+N\Lambda/\langle T_R\rangle}{[s+k+N/\langle T_R\rangle]\Lambda}, \tag*{(3)}

and Ix(a,b)I_x(a,b) is the regularised incomplete Beta function [31]. The two terms in Eq. (2) admit a direct physical interpretation (Figure 1, bottom inset). The first term describes threshold crossing before replication, with protein produced at rate kk: [k/(s+k)]λ[k/(s+k)]^\lambda is the Laplace transform of Erlang(λ,k)(\lambda,k), while Ip(λ,N)I_p(\lambda,N) is the probability, at s=0s=0, that λ\lambda molecules are produced before NN replication steps are completed. The second term describes crossing after replication, and is a convolution of two clocks: an effective replication delay, Erlang of shape NN with mean μ3=⟨TR⟩(Λ−1)/Λ\mu_3=\langle T_R\rangle(\Lambda-1)/\Lambda and squared coefficient of variation 1/N1/N, and the subsequent accumulation at the boosted rate kΛk\Lambda, Erlang of shape λ\lambda, with squared coefficient of variation 1/λ1/\lambda. Correspondingly, μ3\mu_3 represents the mean time “lost” due to protein production at rate kk, rather than Λk\Lambda k, until replication. The FPT thus reflects the competition between these two clocks; which clock dominates, and how noisy each is, determines whether coupling decreases or increases timing precision.

Moments—From ⟨Tm⟩=(−1)mh~(m)(0)\langle T^m\rangle=(-1)^m\tilde{h}^{(m)}(0), we can obtain all moments of the FPT distribution in closed form; see the Supplemental Material. The mean is a weighted sum,

⟨T⟩=μ1Ip0(λ,N)+(μ2+μ3)[1−Ip0(λ,N)]+C1ϕ,(4)\langle T\rangle=\mu_1 I_{p_0}(\lambda,N)+(\mu_2+\mu_3)\left[1-I_{p_0}(\lambda,N)\right]+C_1\phi, \tag*{(4)}

where μ1=λ/k\mu_1=\lambda/k and μ2=λ/(kΛ)\mu_2=\lambda/(k\Lambda) are the Erlang means at low and high production rates, respectively; μ3\mu_3 is the effective delay defined above; p0=k⟨TR⟩/(k⟨TR⟩+N)=p(s=0)p_0=k\langle T_R\rangle/(k\langle T_R\rangle+N)=p(s=0); and C1ϕC_1\phi corrects for the dependence between the route taken – accumulation or replication – and its duration. Finally, Ip0I_{p_0} and 1−Ip01-I_{p_0} are the probabilities that the threshold is reached before and after replication, respectively.

The same two-route structure is found for the second moment,

⟨T2⟩=⟨t2⟩(1)Ip0(λ,N)+[⟨t2⟩(2)+2μ2μ3+⟨t2⟩(3)][1−Ip0(λ,N)]+C2ϕ,(5)\begin{aligned} \langle T^2\rangle={}&\langle t^2\rangle_{(1)}I_{p_0}(\lambda,N)\\ &+\left[\langle t^2\rangle_{(2)}+2\mu_2\mu_3+\langle t^2\rangle_{(3)}\right]\left[1-I_{p_0}(\lambda,N)\right]\\ &+C_2\phi, \tag*{(5)} \end{aligned}

with ⟨t2⟩(l)=μl2(1+CVl2)\langle t^2\rangle_{(l)}=\mu_l^2(1+\mathrm{CV}_l^2) (l=1,2,3)(l=1,2,3), where CV12=CV22=1/λ\mathrm{CV}_1^2=\mathrm{CV}_2^2=1/\lambda and CV32=1/N\mathrm{CV}_3^2=1/N are the squared coefficients of variation of the two accumulation clocks and of the effective replication delay, respectively; the cross-term 2μ2μ32\mu_2\mu_3 derives from the convolution of the replication delay with the post-replication run to threshold. Here, ϕ=p0λ−1(1−p0)N−1/B(λ,N)\phi=p_0^{\lambda-1}(1-p_0)^{N-1}/B(\lambda,N) is the associated Beta density, while C1C_1 and C2C_2 are rational functions of the model parameters, given in the Supplemental Material. Finally, the correction C2ϕC_2\phi plays the role of C1ϕC_1\phi in Eq. (4).

The size of the timing noise then follows in closed form as CVT2=⟨T2⟩/⟨T⟩2−1\mathrm{CV}_T^2=\langle T^2\rangle/\langle T\rangle^2-1. In the two extremes, where replication is instantaneous (⟨TR⟩→0+\langle T_R\rangle\to0^+, with T∼Erlang⁡(λ,kΛ)T\sim\operatorname{Erlang}(\lambda,k\Lambda)) or where it is irrelevant (⟨TR⟩→∞\langle T_R\rangle\to\infty, with T∼Erlang⁡(λ,k)T\sim\operatorname{Erlang}(\lambda,k)), we recover the counting limit: CVT2=1/λ\mathrm{CV}_T^2=1/\lambda. Hence, any departure from that limit must occur at intermediate replication times.

References

  1. [1]P. S. Swain, M. B. Elowitz, and E. D. Siggia, Proc. Natl. Acad. Sci. U.S.A. 99, 12795–12800 (2002).
  2. [2]M. B. Elowitz, A. J. Levine, E. D. Siggia, and P. S. Swain, Science 297, 1183–1186 (2002).
  3. [3]K. R. Ghusinga, J. J. Dennehy, and A. Singh, Proc. Natl. Acad. Sci. U.S.A. 114, 693–698 (2017).
  4. [4]K. Rijal, A. Prasad, A. Singh, and D. Das, Phys. Rev. Lett. 128, 048101 (2022).
  5. [5]L. Ham, M. A. Coomer, K. Ocál, R. Grima, and M. P. H. Stumpf, Nat. Commun. 15, 5286 (2024).
  6. [6]U. Alon, An Introduction to Systems Biology. Design Principles of Biological Circuits (Chapman and Hall/CRC, 2019).
  7. [7]T. R. J. Lappin, D. G. Grier, A. Thompson, and H. L. Halliday, Ulster Med. J. 75, 23 (2006).
  8. [8]T. Montavon and N. Soshnikova, Semin. Cell Dev. Biol. 34, 76–84 (2014).
  9. [9]T. Young, J. E. Rowland, C. van de Ven, M. Bialecka, A. Novoa, M. Carapuco, J. van Nes, W. de Graaff, I. Duluc, J.-N. Freund, F. Beck, M. Mallo, and J. Deschamps, Dev. Cell 17, 516–526 (2009).
  10. [10]H. K. Matthews, C. Bertoli, and R. A. M. de Bruin, Nat. Rev. Mol. Cell Biol. 23, 74–88 (2022).
  11. [11]C. J. Zopf, K. Quinn, J. Zeidman, and N. Maheshri, PLoS Comput. Biol. 9, e1003161 (2013).
  12. [12]Y. Voichek, R. Bar-Ziv, and N. Barkai, Science 351, 1087–1090 (2016).
  13. [13]Z. Cao and R. Grima, Proc. Natl. Acad. Sci. U.S.A. 117, 4682 (2020).
  14. [14]C. H. Beentjes, R. Perez-Carrasco, and R. Grima, Phys. Rev. E 101, 032403 (2020).
  15. [15]C. Jia, A. Singh, and R. Grima, PLoS Comput. Biol. 18, e1010574 (2022).
  16. [16]C. Jia and R. Grima, iScience 26, 105746 (2023).
  17. [17]J. R. Peterson, J. A. Cole, J. Fei, T. Ha, and Z. A. Luthey-Schulten, Proc. Natl. Acad. Sci. U.S.A. 112, 15886 (2015).
  18. [18]R. Dessalles, V. Fromion, and P. Robert, PLoS ONE 15, e0226016 (2020).
  19. [19]A. K. Verma, H. K. Barman, K. Rijal, and D. Das, bioRxiv 10.64898/2026.08.20.745891 (2026).
  20. [20]C. A. Yates, M. J. Ford, and R. L. Mort, Bull. Math. Biol. 79, 2905 (2017).
  21. [21]H. X. Chao, R. I. Fakhreddin, H. K. Shimerov, K. M. Kedziora, R. J. Kumar, J. Perez, J. C. Limas, G. D. Grant, J. G. Cook, G. P. Gupta, and J. E. Purvis, Mol. Syst. Biol. 15, MSB188604 (2019).
  22. [22]Q. Sun, F. Jiao, G. Lin, J. Yu, and M. Tang, PLoS Comput. Biol. 15, e1007017 (2019).
  23. [23]M. R. Dowling, A. Kan, S. Heinzel, J. H. S. Zhou, J. M. Marchingo, C. J. Wellard, J. F. Markham, and P. D. Hodgkin, Proc. Natl. Acad. Sci. U.S.A. 111, 6377–6382 (2014).
  24. [24]S. O. Skinner, H. Xu, S. Nagarkar-Jaiswal, P. R. Freire, T. P. Zwaka, and I. Golding, eLife 5, e12175 (2016).
  25. [25]I. Kalita, I. A. Iosub, L. McLaren, L. Goossens, S. Granneman, and M. El Karoui, eLife 13, RP94918 (2025).
  26. [26]A. Sukys and R. Grima, Nucleic Acids Res. 53, gkaf295 (2025).
  27. [27]B. Schwanhäusser, D. Busse, N. Li, G. Dittmar, J. Schuchhardt, J. Wolf, W. Chen, and M. Selbach, Nature 473, 337–342 (2011).
  28. [28]R. Mosteller, R. Goldstein, and K. Nishimoto, J. Biol. Chem. 255, 2524–2532 (1980).
  29. [29]M. Gupta, A. N. T. Johnson, E. R. Cruz, E. J. Costa, R. L. Guest, S. H.-J. Li, E. M. Hart, T. Nguyen, M. Stadlmaier, B. P. Bratton, T. J. Shilhavy, N. S. Wingreen, Z. Gitai, and M. Wühr, Nat. Commun. 15, 5890 (2024).
  30. [30]N. G. van Kampen, Stochastic Processes in Physics and Chemistry, 3rd ed. (Elsevier, Amsterdam, 2007).
  31. [31]DLMF, NIST Digital Library of Mathematical Functions, https://dlmf.nist.gov/, Release 1.2.8 of 2026-09-15 (2026), F. W. J. Olver, A. B. Olde Daalhuis, D. W. Lozier, B. I. Schneider, R. F. Boisvert, C. W. Clark, B. R. Miller, B. V. Saunders, H. S. Cohl, and M. A. McClain, eds.
  32. [32]S. Cooper and C. E. Helmstetter, J. Mol. Biol. 31, 519 (1968).
  33. [33]N. Walker, P. Nghe, and S. J. Tans, BMC Biol. 14, 11 (2016).
  34. [34]X. Chen and J. Zhang, Cell Syst. 2, 347–354 (2016).
  35. [35]J. A. Bryant, L. E. Sellars, S. J. W. Busby, and D. J. Lee, Nucleic Acids Res. 42, 11383 (2014).
  36. [36]C. Sousa, V. de Lorenzo, and A. Cebolla, Microbiology 143, 2071 (1997).
  37. [37]V. Dileep and D. M. Gilbert, Nat. Commun. 9, 428 (2018).
  38. [38]J. Yu, J. Xiao, X. Ren, K. Lao, and X. S. Xie, Science 311, 1600–1603 (2006).
  39. [39]D. T. Gillespie, J. Comput. Phys. 22, 403–434 (1976).
  40. [40]T. E. Loman, Y. Ma, V. Ilin, S. Gowda, N. Korsbo, N. Yewale, C. Rackauckas, and S. A. Isaacson, PLoS Comput. Biol. 19, e1011530 (2023).
  41. [41]W. Feller, An Introduction to Probability Theory and Its Applications, 1st ed., Vol. 2 (John Wiley & Sons, New York, 1966).
  42. [42]P. Billingsley, Probability and Measure, 3rd ed. (John Wiley & Sons, New York, 1995).
  43. [43]W. Feller, An Introduction to Probability Theory and Its Applications, 3rd ed., Vol. 1 (John Wiley & Sons, New York, 1968).
  44. [44]G. Casella and R. L. Berger, Statistical Inference, 2nd ed. (Duxbury, Pacific Grove, CA, 2002).
  45. [45]K. Burdett, Econ. Lett. 52, 263–267 (1996).
  46. [46]D. T. Gillespie, Annu. Rev. Phys. Chem. 58, 35–55 (2007).
  47. [47]V. Shahrezaei and P. S. Swain, Proc. Natl. Acad. Sci. U.S.A. 105, 17256–17261 (2008).

Paper details

vlnc:W_5sxj6qn7
Version
v1 · latest
Published
Fresh — added to the Hub within the last 30 days
Added
License
CC BY 4.0
Usage

views · 0

downloads · 0

A view counts once per browser per day, a download each time the PDF is requested.

  • Agricultural and Biological Sciences

Not recorded for this paper

View statement
Looking for related papers…
Contents