Biochemical oscillators perform crucial functions in cells, e.g., they set up circadian clocks. The dynamical behavior of oscillators is best described and analyzed in terms of the scalar quantity, phase. A rigorous and useful definition for phase is based on the so-called isochrons of oscillators. Phase computation techniques for continuous oscillators that are based on isochrons have been used for characterizing the behavior of various types of oscillators under the influence of perturbations such as noise.
In this article, we extend the applicability of these phase computation methods to biochemical oscillators as discrete molecular systems, upon the information obtained from a continuous-state approximation of such oscillators. In particular, we describe techniques for computing the instantaneous phase of discrete, molecular oscillators for stochastic simulation algorithm generated sample paths. We comment on the accuracies and derive certain measures for assessing the feasibilities of the proposed phase computation methods. Phase computation experiments on the sample paths of well-known biological oscillators validate our analyses.
The impact of noise that arises from the discrete and random nature of the mechanisms that make up molecular oscillators can be characterized based on the phase computation techniques proposed in this article. The concept of isochrons is the natural choice upon which the phase notion of oscillators can be founded. The isochron-theoretic phase computation methods that we propose can be applied to discrete molecular oscillators of any dimension, provided that the oscillatory behavior observed in discrete-state does not vanish in a continuous-state approximation. Analysis of the full versatility of phase noise phenomena in molecular oscillators will be possible if a proper phase model theory is developed, without resorting to such approximations.
Keywords:discrete molecular oscillators; oscillator phase; noise; phase noise; numerical methods; Monte Carlo methods; Stochastic Simulation Algorithm (SSA); isochrons; phase equations; phase computation schemes; phase models
1.1 Oscillators in biological and electronic systems
Oscillatory behavior is encountered in many types of systems including electronic, optical, mechanical, biological, chemical, financial, social and climatological systems. Carefully designed oscillators are intentionally introduced into many engineered systems to provide essential functionality for system operation. In electronic systems, oscillators are used to generate clock signals that are needed in the synchronization of operations in digital circuits and sampled-data systems. The periodic signal generated by an electronic oscillator or monochromatic light from a laser is used as a carrier and for frequency translation of signals in wireless and optical communication systems. Oscillatory behavior in biological systems is seen in population dynamics models (prey-predator systems), in neural systems , in the motor system, and in circadian rhythms . Intracellular and intercellular oscillators of various types perform crucial functions in biological systems. Due to their essentialness, and intricate and interesting dynamic behavior, biological oscillations have been a research focus for decades. Genetic oscillators that are responsible for setting up the circadian rhythms have received particular attention . Circadian rhythms are crucial for the survival of many species, and there are many health problems associated with the disturbance of these clocks in humans [4,5]. For instance, working night shifts has been recently listed as a probable cause of cancer by the World Health Organization [6-8]. A milestone in synthetic biology is the work in  reporting on a genetic regulatory network called the repressilator, essentially a synthetic genetic oscillator.
Oscillators in electronic and telecommunication systems are adversely affected by the presence of undesired disturbances in the system. Various types of disturbances such as noise affect the spectral and timing properties of the ideally periodic signals generated by oscillators, resulting in power spreading in the spectrum and jitter and phase drift in the time domain . Unlike other systems which contain an implicit or explicit time reference, autonomously oscillating systems respond to noise in a peculiar and somewhat nonintuitive manner. Understanding the behavior of oscillators used in electronic systems in the presence of disturbances and noise has been a preoccupation for researchers for many decades . The behavior of biological oscillators under various types of disturbances has also been the focus of a good deal of research work in the second half of the 20th century [1,2,12,13].
1.2 Phase models for oscillators
The dynamical behavior of oscillators is best described and analyzed in terms of the scalar quantity, phase. Of the pertaining notions in the literature, the most straightforward phase definition is obtained when a planar oscillator is expressed in polar coordinates, with amplitude and polar angle as the state variables. The usefulness of the polar angle as phase does not generalize to higher dimensional oscillators. In the general case, it is our conviction that the most rigorous and precise definition of phase is the one that is based on the so-called isochrons (formed from in-phase points in the state-space) of an oscillator [1,2,14,15]. The notion of isochrons was first proposed by Winfree [2,14] in 1974. It was later revealed that isochrons are intimately related to the notion of asymptotic phase in the theory of differential equations [16,17]. The isochron theoretic phase of a free-running, noiseless oscillator is simply time itself. Such an unperturbed oscillator serves as a perfect time keeper if it is in the process of converging to a limit cycle, even when it has not yet settled to a periodic steady-state solution. Perturbations make the actual phase deviate from time, due to the degrading impact of disturbances on the time keeping ability.
Phase is a quantity that compactly describes the dynamical behavior of an oscillator. One is then interested in computing the phase of a perturbed oscillator. If this can be done in a semi or fully analytical manner for a practical oscillator, one can draw conclusions and obtain useful characterizations in assessing the time keeping performance. Indeed, we observe in the literature that, in various disciplines, researchers have derived phase equations that compactly describe the dynamics of weakly perturbed oscillators [1,11]. It appears that a phase equation for oscillators has first been derived by Malkin  in his work on the reduction of weakly perturbed oscillators to their phase models , and the same equation has been subsequently reinvented by various other researchers in several disciplines [2,11,19]. This phase equation has been used in mathematical biology to study circadian rhythms and coupled oscillators in the models of neurological systems [1,2,20], and in electronics for the analysis of phase noise and timing jitter in oscillators [11,21]. Phase equations have great utility in performing (semi) analytical phase computations. However, simpler and more accurate schemes for numerical phase computations have been recently proposed [15,22]. In some applications, merely a technique for computing the instantaneous phase of an oscillator for a given perturbation is needed. In this case, not only the machinery of phase equations is not necessary but also one can perform more accurate phase computations in a much simpler and straightforward manner.
1.3 Phase computations for discrete oscillators
We have proposed in  a numerical method for the computation of quadratic approximations for the isochrons of oscillators. In , we have reviewed the derivation of the first-order phase equation (which is based on the linear approximations for isochrons [1,2,20]), with a formulation based on the isochron-theoretic oscillator phase. On top of this, in  we have also made use of again the quadratic isochron approximations of  to derive a novel second-order phase equation that is more accurate than the first-order. However, the phase equations  and phase computation schemes  discussed above are founded on continuous oscillators described by differential equations. Therefore, these models and techniques do not directly apply to the analysis of molecular oscillators with discrete-space models. In this article, we present a methodology, enabling the application of these continuous phase models  and the phase computation schemes  on biological oscillators modeled in a discrete manner at the molecular level. Our preliminary results recently appeared in a workshop presentation . This article details and expands on our contributions over this methodology.
We now summarize the workflow followed in the methodology and also give an outline of the article. Section 2 provides background information describing how the discrete model of the oscillator is transformed into a continuous, differential equation model through a limiting process based on the assumption that the concentration of molecular species in the model of the oscillator are large so that discrete effects are negligible [24-30]. It should be particularly noted that the reaction events in an SSA sample path (as generated by Gillespie's Stochastic Simulation Algorithm (SSA) ) are the most crucial ingredients in translating the continuous-state formalism on oscillator phase for use on molecular oscillators.
Section 3 actually describes our major contribution, i.e., how discrete-state oscillator phase computation is accomplished using the paradigms of phase equations and phase computation schemes. Using the phase modeling techniques mentioned above, a continuous phase model (depending on the model developed in Section 2) is constructed and discretized. The noise sources in this discretized phase model are represented as a cumulation of the events occurring in the discrete model of the oscillator. This two-way continuous-discrete transformation mechanism enables us to perform phase computations for discrete, molecular oscillators based on the continuous phase model theory . Moreover, the fact that the noise sources in the phase computation are synthesized from the same events in the SSA sample path makes one-to-one comparisons with full SSA  based simulations possible. The phase model constructed as such from the continuous-limit model of the oscillator is accurate when a large number of molecules exist for every species. However, in many biological molecular oscillators, the number of molecules can be quite small. Large deviations from the continuous limit for such oscillators cause computations via continuous first-order phase models based on linear isochron approximations to become inaccurate. This was the observation that prompted our work on the quadratic (as opposed to linear) approximation theory and computational techniques for the isochrons of oscillators [15,22]. With phase computation schemes based on quadratic isochron approximations , deviations from the continuous-deterministic limit are much better captured and more accurate phase computations for discrete oscillators even with few molecules can be performed.
In Section 4, we provide a brief literature review of the approaches taken in the phase noise analysis of oscillators. Several seminal articles in the literature [11,31-36] are categorized according to three classification schemes in particular: the nature of the oscillator model used, the nature of the analysis method, and the phase definition adopted. We also classify in Section 4 the approach proposed in this article within the same framework.
Section 5 provides performance results for the proposed phase computation methods running on intricate molecular oscillators. The results are as expected, i.e., phase equations are quite accurate and fast for oscillators in a larger volume with big molecule numbers for the species, but they lose accuracy when a smaller volume is considered and noise effects become pronounced. Phase computation schemes are always very accurate, even in smaller volumes, but they are not as fast as the equations. Several crucial points in the theory underlying the methods are also emphasized in the discussion throughout this section. Section 6 concludes the article and suggests some future research directions.
The next three sections constitute the detailed explanation of the proposed methods. Sections 7 and 8 are expanded versions of Sections 2 and 3, respectively, with hints and references to derivations. Section 9 explains how and where molecular oscillator models can be obtained to test the proposed algorithms, which types of information are obtained from the models in preparation for oscillator phase analysis, numerical implementation details for the proposed phase computation methods, and in this section are also derived the computational complexities for these methods.
2 Modeling and simulation of discrete molecular oscillators
Biochemical models for molecular oscillators are generally specified as a set of molecular species participating in a number of reactions with predefined propensities. These models based on a stochastic chemical kinetics formalism capture the inherent stochastic and noisy behavior arising from the discrete and random nature of molecules and reactions. The (instantaneous) number of each molecular species, i.e., reactant, constitutes the state of the model. The time-dependent state probabilities for the system are described precisely with the Chemical Master Equation (CME) . The generic form of the CME is as in
Above in (1), x represents the state of a molecular oscillator. The solution of this equation yields , i.e., the probability that the oscillator is visiting a certain state x at time t. Also, in (1), aj(x) is called the propensity of the j th reaction (note that we have M possible reactions), while the oscillator is again visiting the state x. This propensity function facilitates the quantification of how much of a probability we have of reaction j occuring in the next infinitesimal time. The constant vector sj defines the changes in the numbers of molecules for the species constituting the oscillatory system, when reaction j occurs. The CME corresponds to a continuous-time Markov chain. Due to the exponential number of state configurations for the system, CME is generally very hard to construct and solve. Therefore, one prefers to generate sample paths for the system using Gillespie's SSA , whose ensemble obeys the probability law dictated by the CME.
Continuous state-space models for molecular oscillators that serve as approximations to the discrete model described above are also used. Based on the CME and employing certain assumptions and approximations, one may derive a continuous state-space model as a system of stochastic differential equations, known as the Chemical Langevin Equations (CLEs). A CLE is of the generic form in
Above in (2), X(t) is the state of the oscillator, i.e., the solution of the SDE for a particular realization. Vectors sj defined above are stacked side by side for all of the M reactions to compose the stoichiometric matrix S in (2). Note also that is a square diagonal matrix with its diagonal entries given by for j = 1, ..., M, with a(X(t)) the vector of propensity functions. The vector ξ(t) is composed of independent zero-mean Gaussian random variables with variance one. The deterministic limit of the CLEs is in turn called the Reaction Rate Equations (RREs). The generic form of an RRE is as in
which is mathematically obtained by crossing out the second term on the right-hand side of (2). The RRE model for an oscillator has a solution that is perfectly periodic without noisy fluctuations. On the other hand, the solution of the CLEs produces oscillatory sample paths with fluctuations around the periodic orbit on top of the deterministic solution of the RREs .
The reader is referred to Figure 1, in which a summary of the models (along with their respective natures) for molecular oscillators and the algorithms used to solve these models are provided. The instantaneous phase computations we describe in this article are performed on the sample paths generated by SSA simulations based on a fully discrete model of the oscillator. However, the isochron characterization (computation of linear and quadratic isochron approximations) for the oscillator is based on the continuous-space RRE and CLE model, as we describe in the next section.
Figure 1. Summary of molecular models and corresponding algorithms. The models, their natures, and the simulation algorithms for these models are given. CME (of discrete stochastic nature) dictates the probability evolution of the ensemble of the sample paths generated by the SSA algorithm. Applying to the CME the τ-leap criterion and Gaussian approximation to Poisson random variables, CLE (continuous stochastic) is derived. CLE sample paths are obtained via appropriate SDE Solutions. The infinite volume approximation acting on the CLE leads us to the RRE (continuous deterministic), whose solutions we get through algorithms for ODEs.
3 Phase computations based on Langevin models
In performing phase characterizations, we compute sample paths for the instantaneous phase (in units of time) of a molecular oscillator. In the absence of noise and disturbances, i.e., for an unperturbed oscillator, the phase is always exactly equal to time t itself, even if the oscillator is not at periodic steady-state. Perturbations and noise result in deviations in the phase and cause it to be different from time t [1,2,11,15,22]. The perpetual effect of noise and disturbances causes this deviation in the phase to accumulate. Our goal is to compute the instantaneous phase that corresponds to an SSA generated sample path for a molecular oscillator. A pictorial description of this phase computation problem for oscillators is given in Figure 2.
Figure 2. Phase computation problem for oscillators. The two trajectories xs(t), the periodic solution of the RRE, and xssa(t), a sample path, start at the same point on the limit cycle, but at t = t0 they end up at different points and possibly on different isochrons. The point xssa(t0) has registered a phase shift with respect to xs(t0). According to isochron theory, there is a point that is on the same isochron as xssa(t0), therefore the two points are in-phase. The time argument of the point is the instantaneous phase value of xssa(t0). Phase computation methods aim to calculate this value .
We assume that the deterministic RREs for a molecular oscillator have a stable periodic solution xs(t) that represents a periodic orbit or limit cycle. An isochron of an oscillator associated with the limit cycle xs(t) is a set of points (in the state-space) that have the same phase. For an oscillator with N state variables, each isochron is an N - 1-dimensional hypersurface. The union of isochrons covers the neighborhood of its periodic orbit [1,14]. See Figure 3 for the limit cycle and isochrons of a simple polar oscillator. Isochrons form the basis for a rigorous phase definition and phase computations for oscillators . Another crucial quantity in devising phase computation schemes, in addition to isochrons, is the orbital deviation, i.e., the instantaneous difference between the noisy oscillator state and the in-phase point on the limit cycle (by definition, the two points are on the same isochron) .
The perturbation projection vector (PPV) v(t) is defined as the gradient of the phase of an oscillator  on the limit cycle represented by xs(t). The PPV, which is equivalent to the infinitesimal phase response curves (PRCs) , is instrumental in forming linear approximations for the isochrons of an oscillator. The matrix H(t) is defined as the Hessian of the phase (and the Jacobian of the PPV)  on the limit cycle. The phase Hessian H(t) is useful in forming quadratic approximations for the isochrons of an oscillator. The PPV v(t) and the Hessian H(t) can be computed using the techniques described in .
Phase equations (differential equations for the phase ) can be derived based on the CLE model of an oscillator. Phase equations come in various flavors, depending on whether a linear or quadratic approximation is used for the isochrons and the orbital deviation . The acclaimed phase equation, used in multiple disciplines [1,2,11], of the form
is based on linear isochron approximations and a linear differential equation for the orbital deviation (not shown here). Above, b is the noise excitation which is synthesized as a cumulation of the events that occur in the discrete, molecular level model of the oscillator. We call the model of (4) PhEqnLL (the first L for the isochron and the second one for the orbital deviation approximation, the natures of both of which are linear). We also have PhEqnQQ (quadratic approximations for both isochrons and orbital deviation) and PhEqnQL (quadratic approximations for isochrons and linear approximations for orbital deviation) . See Figure 4 for a high-level representation of the phase computations methodology using phase equations.
Figure 4. Phase computations through phase equations methodology. The events in the SSA-generated sample path are recorded. From the RRE, the limit cycle and isochron approximation information is computed. Phase equations make use of these two pieces of information to compute the instantaneous phase corresponding to each point in the sample path. The first-order phase equation as adapted to this methodology is given in the figure.
With the phase equations based on linear and quadratic isochron approximations, we can compute the phase of an oscillator without having to run SSA simulations based on its discrete, molecular model (unless a one-to-one comparison between the results of phase computations based on phase equations and SSA simulations is required). On the other hand, more accurate phase computations can be attained if they are based on, i.e., use information, from SSA simulations. In this scheme, we run an SSA simulation based on the discrete, molecular model of the oscillator. For points (in the state-space) on the sample path generated by the SSA simulation, we compute a corresponding phase by essentially determining the isochron on which the point in question lies. Here, one can either employ no approximations (PhCompBF) for the isochrons or perform phase computations based on linear (PhCompLin) or quadratic (PhCompQuad) isochron approximations. Brute-force phase computations without isochron approximations (PhCompBF) are computationally costly [15,22]. See Figure 5 for a pictorial description of PhCompBF. Phase computations based on isochron approximations and SSA simulations proceeds as follows: Let xssa(t) be the sample path for the state vector of the oscillator that is being computed with SSA. We solve
Figure 5. Brute-force phase computation scheme (PhCompBF). (a) An SSA sample path and a noiseless RRE solution (running in parallel) end up at different isochrons at t0. (b) The last timepoints in the two simulations for part (a) are separately fed as initial conditions to the RRE in order to generate the two separate traces shown in this subfigure. The RRE solution that was already on the periodic orbit continues tracing it, and the off-orbit solution in turn approaches the limit cycle. (c) The off-orbit solution finally becomes periodic and the phase shift between the two RRE solutions can be found, switching to the plots in the time domain and applying appropriate algorithms to compute the phase shift. (d) Legend for the traces in the subplots.
based on linear isochron approximations (PhCompLin)--or a similar equation that also involves the phase Hessian H(t) based on quadratic isochron approximations (PhCompQuad)--for the phase that corresponds to xssa(t). Figure 6 provides a description for PhCompLin. The above computation needs to be repeated for every time point t of interest. Above, for xssa(t), we essentially determine the isochron (in fact, a linear or quadratic approximation for it) that passes through both the point on the limit cycle and xssa(t). The phase of , i.e., , is then the phase of xssa(t) as well since they reside on the same isochron. We should note here that, even though xssa(t) above is computed with an SSA simulation based on the discrete model of the oscillator, the steady-state periodic solution , the phase gradient and the Hessian (i.e., all of the information that is used in constructing the isochron approximations) are computed based on the continuous, RRE model of the oscillator. See Figure 7 for the high-level representation of the phase computations methodology using phase computation schemes. The phase computation schemes we describe here can be regarded as hybrid techniques that are based both on the continuous, RRE and also the discrete, molecular model of the oscillator. On the other hand, the phase computations based on phase equations are completely founded upon the continuous, RRE and CLE models of the oscillator.
Figure 6. Phase computation scheme depending on linear isochron approximations. An isochron whose linear approximation passes through the point xssa(t0) is found. The point where this hyperplane crosses the limit cycle is , with the solution of this phase computation scheme. The difference between the exact solution and the approximate solution is reduced if the isochrons are close to being linear.
Figure 7. Phase computation schemes methodology. An SSA-generated sample path (alternatively one that is generated through the CLE) and the limit cycle and isochron approximation information are fed to the phase computation schemes, which compute the instantaneous phase corresponding to each point in the sample path. The algebraic equation for the scheme depending on linear isochron approximations is given as an example.
In summary, we point out the acronyms and some properties of the proposed phase computation methods for convenience. The phase equations are PhEqnLL, PhEqnQL, and PhEqnQQ. The phase computation schemes are PhCompBF (the most accurate but computationally expensive method), PhCompLin, and PhCompQuad. The schemes employ no approximations in orbital deviation, therefore they are expected to be more accurate with respect to the equations. The equations, on the other hand, have low computational complexity and can generate results very fast. We also show in this article that there is a trade-off between accuracy and computational complexity for these methods.
4 Related work
A classification scheme for categorizing previous work, pertaining to the phase noise analysis of biochemical oscillators, can be described as follows.
First, we note that there are basically two types of models for inherently noisy biochemical oscillators, i.e., discrete and continuous-state. CME describes the probabilistic evolution of the states of an oscillator, and it is referred to as the most accurate characterization for discrete molecular oscillators. Through approximations, one derives from CME the CLE, a continuous-state noisy model. CLE can be used to extract crucial information about the continuous-state system that is an approximate representation of its discrete-state ancestor. We note here that, in oscillator phase noise analyses, mostly the continuous-state model has been utilized [11,31-36].
Second, the nature of the phase noise analyses conducted can be considered in two categories, i.e., semi-analytical techniques and sample path-based approaches. Semi-analytical techniques have been developed, in particular, for the stochastic characterization of phase diffusion in oscillators [11,31-36]. In biology, CLE has been used as a tool in illustrating and quantifying the phase diffusion phenomena [31-34,36]. Characterization and computations pertaining to phase diffusion in electronic oscillators were carried out through a stochastic phase equation and the probabilistic evolution of its solutions , noting that the phase equation used was derived from an SDE (a Stochastic Differential Equation describing a noisy electronic oscillator) that corresponds to the CLE for biochemical oscillators. In all, these semi-analytical techniques are based on the continuous-state model of an oscillator. Regarding sample path-based approaches, one may recall that, in discrete state, SSA is used to generate sample paths, whose ensemble obeys the CME. In continuous state, CLE can in turn be used to generate sample paths. A recent study  illustrates derivations of the crucial findings presented in [11,33,34] and adopts an approach for phase diffusion constant computation, based on the transient phase computation of CLE-generated sample paths in an ensemble.
Third, oscillator phase can be defined via two different methods. There are the Hilbert transform-based and the isochron-based definitions. The phase computation based on the Hilbert transform  takes the evolution of a single state variable within a sample path to compute the phases of all time points in the whole sample path. The Hilbert transform-based phase computation technique can be used to compute the phase of any oscillatory waveform, without any information as to where this waveform came from. The oscillatory waveform could belong to one of the state variables of an oscillator generated with a simulation. This method has been utilized in [31,35] for phase computations of sample paths. The isochron-theoretic phase (recall that an isochron portrait belongs to a limit cycle of the deterministic RRE) makes use of all of the state variables and equations for an oscillator. The isochron-based phase definition assigns a phase value to the points in the state space of the oscillator, making phase a property of the whole oscillator, not a property of just a certain state variable or a waveform obtained with a simulation of the oscillator [15,22]. Note that even though there appears to be empirical evidence [31,35] that there is a correspondence between the Hilbert transform-based and isochron-based phase definitions, a precise connection has not been worked out in the literature.
The hybrid phase computation techniques proposed in this article apply to discrete-state models and particularly the SSA generated sample paths of these models, based on the isochron-theoretic oscillator phase definition. Our approach is hybrid because isochrons are obtained based on the continuous model but the phase traces are computed for the sample paths generated by an SSA simulation that is based on the discrete model for an oscillator. This hybrid approach targets moderately noisy oscillators, within a container of not too large or small volume, consequently with not too high or low molecule numbers for the species in the system, respectively.
5 Results and discussion
We now present results obtained with the proposed methods for oscillator phase computations on several intricate molecular oscillators. Accuracy demonstrations and computational speed-up figures will be given with respect to PhCompBF, the brute-force scheme, which we accept as the golden reference for oscillator phase computations, since this method does not employ any approximations in either isochrons or orbital deviations. Section 5.1 below, in which we analyze the brusselator, contains details pertaining to the general flow of the phase computations and the preparatory procedures for all the methods. Sections 5.2 and 5.3 are brief sections illustrating the performance of the methods for oscillators called the oregonator and the repressilator, respectively. All simulations were run on a computer with an Intel i7 processor at 3.07 GHz and accommodating 6 GB of memory.
The Brusselator is a theoretical model for a type of autocatalytic reaction. The Brusselator actually describes a type of chemical clock, and the Belousov-Zhabotinsky (BZ in short) reaction is a typical example . The model below in (6) has been largely adapted from , which is based on .
Parameter values in (6) are: k1 = 0.025 s-1, k2 = 1 s-1 mL, k3 = 1 s-1 (mL)2, and k4 = 0.01 s-1. Volume is set to 250 mL. Molecule numbers of A, B, R, and S are held, constant.
Several models and quantities must be derived from the reactions in (6) before moving onto phase analysis. The stoichiometric matrix in this case reads
where the first row is for the species X and the second is for Y. The columns each denote the changes in molecule numbers as a reaction takes place, e.g., column one is for the first reaction in (6). Let us also call X the random process denoting the instantaneous molecule number for the species X, similarly Y is for Y in the same fashion. Then, the random process vector X = [X Y]Τ concatenates these numbers for convenience. The propensity functions for the reactions can be written as
where Ω denotes the volume parameter. Using (8), the CME for the Brusselator can be derived in line with (1) as
Now it is possible to derive the CLE as in (2)
It is easy to extract from (10) the RRE in (3) as
Note that in deriving (10) and (11) from (9), the variables X and Y (which represent molecule numbers, not concentrations, of the species X and Y, respectively) have become continuous instead of remaining discrete. In preparation for phase analysis, some computational quantities have to be derived from (11).
The phase analysis of a continuous oscillator (modeled by nonlinear systems of ODEs such as an RRE) depends on linearizations around the steady-state periodic waveform xs(t) solving the RRE. The periodic solution xs(t) for the Brusselator in (6) is given in Figure 8. This function has been computed for a whole period (with the actual approximate value for the period T = 1000 s) through the shooting method . The species A, B, R, and S, with their molecule numbers constant, should be excluded from the machinery of the shooting method for it to work.
Figure 8. The periodic solution xs(t) for the Brusselator. The periodic solution (consisting of the changes in the molecule numbers for the species X and Y) of the RRE (the continuous deterministic model) for the Brusselator. This periodic solution vector function is called xs(t). Note that the oscillating molecular system has discrete states, i.e., it has discrete numbers for the molecule numbers for each species. However, through the continuous-state limit, we have derived the RRE and CLE, which are continuous, from the original oscillator model. Therefore, entries of the periodic solution xs(t) in this figure are continuous valued. Also, in the transformation from the discrete model to the continuous one, we have chosen to stick with molecule numbers for species rather than switching to concentrations, because we would like to plot on top of each other, compare, and use in computational analysis the SSA sample paths obtained from the discrete model and sample paths and deterministic solutions obtained from the continuous models.
In fact, xs(t) computation is enough preparation for running the brute-force scheme PhCompBF as will be demonstrated next. Recalling that we aim to solve for the possibly constantly changing phase along individual SSA-generated sample paths, we run the SSA algorithm to generate the sample path given in Figure 9. In this plot, the SSA simulation result and the unperturbed xs(t) have been plotted on top of each other, for only species Y, for illustration purposes. It must be noted that both xs(t) and the SSA sample path start initially at the same state on the limit cycle, therefore the star and the circle are on top of each other at t = 0 s. Due to isochron-theoretic oscillator phase theory, the initial relative phase, or the initial phase shift of the SSA sample path with respect to xs(t), is zero.
Figure 9. An SSA-generated sample path as compared to the deterministic periodic solution for the Brusselator (showing changes in the molecule number for only the species Y). Changes in the molecule number for only species Y monitored. The noisy sample path is compared to the noiseless RRE solution. The noise has an adverse effect such that it has apparently caused the oscillator to lag behind the deterministic solution. A quantitative measure of this phase shift on a point-by-point basis (for all points) in the sample path is to be obtained by the phase computation methods proposed in this article.
In Figure 9, we would like to solve eventually for the time-evolving relative phase shift of the SSA sample path, for now with PhCompBF. This means solving for the phase shift for the visited states in the sample path, denoted by circles in the figure, and preferably for all the states in between the circles along the path as well. PhCompBF requires running a particular type of simulation for computing the relative phase shift of each visited state. We will demonstrate the method shortly, but let us comment on how much information can be gained by inspecting only the plot in Figure 9. The SSA simulation suggests that the system continually introduces noise, so that everything about the system appears noisy, the phase, the amplitude, etc. Phase is a particular quantity that helps quantify the effect of noise on an autonomously oscillating system. One may easily guess that the relative phase shift of the SSA sample path is always changing along the interval of simulation. It is not obvious at all how to compute this phase shift at particular points in time in Figure 9. Perhaps, one may argue that the sudden decrease that should take place at about t = 200 s for the unperturbed xs(t), appears about 200s in time later for the SSA path. However, this is only an educated guess and an approximate value. Also, that the stars and circles appear very close to each other for example in between 600 and 1000s does not directly help invoke the isochron-theoretic phase theory to deduce that the phase shift along this interval is close to zero. Recalling that Figure 9 depicts only species Y, one has to inspect also the other species to arrive at such a conclusion. It is also needless to state as a reminder that for two states to have the same relative phase, having the two states equal to each other is a sufficient but not necessary condition, again due to isochron theory. In all, accurately what happens to the phase shift along the interval is still obscure. As a side note, one should also note that without the perfectly periodic xs(t), it is awfully difficult to guess the period T, inspecting only a long SSA sample path. Relevant theory for noisy oscillators suggests that inspecting the zero-crossings of a whole ensemble of long and mildly noisy SSA sample paths yields information related to the period and phase diffusion constant of an oscillator, in a brute-force manner .
In order to demostrate PhCompBF, we have first plotted both the SSA sample path and the limit cycle (the closed curve traced over and over by xs(t)) in 2-D state space as in Figure 10. As stated earlier, the star and the circle are initially coincident. Then, as time progresses, xs(t) just traces the limit cycle, but the SSA sample path xssa(t) runs berserk. At t0 = 600 s, we have again indicated where the two traces end up. The SSA path at this time is off the limit cycle. Since we do not have exact isochron information, it is not possible to compute the phase value that makes xssa(t0 = 600 s) and in-phase, i.e., on the same isochron. If we could find this value, then would be the sought phase shift value.
Figure 10. Limit cycle and SSA sample path shown on the state space for the Brusselator. Both trajectories start at the same point on the limit cycle. The star traces the limit cycle in clockwise direction, whereas the noisy sample path wanders around though remaining close to the periodic orbit. After some time has passed, the star (of the noiseless path) and the circle (of the noisy sample path) are found to be at different locations. The qualitative difference in terms of phase between these two points is explained by the concept of isochrons.
The value of the phase shift α can, however, be computed through a possibly long, ideally infinitely long, simulation, in line with the theory of asymptotic phase (a theory on intimate terms with isochrons). The following is the essence of PhCompBF. One takes in Figure 10 the states xssa(t0 = 600 s) (the circle on the SSA path) and xs(t0 = 600 s) (the star on the limit cycle) and feeds them as initial conditions to the RRE in (21) and then simulates both traces for some time. The result is the two traces in Figure 11. In this plot, again only the species Y is demonstrated. The circular marker (along with the corresponding star) has been put only at the beginning of the simulation in Figure 11 to note the fact that only the initial value belongs to the SSA sample path. After this initial time, both traces are parts of separate RRE solutions. Incorporation of these two new simulated traces into the plot of Figure 10 would be as follows (see Figure 12): The plot starting with the circle in Figure 11 (with both of the two states) would be a curve in the state space of Figure 10 starting from the circle off the limit cycle but gradually converging to it. Meanwhile, the plot starting from the star in Figure 11 would resume tracing the limit cycle in Figure 10 from again the star. Then, as shown in Figure 12, the two simulated plots are observed to be tracing the limit cycle after simulating long enough in time, the star of the unperturbed path always leading the circle of the initially perturbed path (but notice that during the simulation for both traces in Figure 12 all perturbations or noise are removed). Observe in Figure 12 that the star has went ahead to make the rightmost turn on the limit cycle, travelling clockwise, whereas the circle is still way behind. However, all along this simulation of Figure 12, the instantaneous phase shift between the two traces has remained the same. As the simulation goes on along the limit cycle, the circle (originating from the SSA simulation) and the star (of the unperturbed xs(t)) would appear sometimes near, and sometimes far away from each other. This effect is due to particularly the varying velocity along the limit cycle, all determined by the dynamic properties of the RRE. The constant difference in time between the circle and star is the phase shift α (t0 = 600 s) that we aim to compute. Notice that in the state space of Figures 10 and 12, time is only an implicit parameter. Therefore, we have to inspect plots of the type in Figure 11 to obtain the desired phase shift value.
Figure 11. Mechanism of PhCompBF (the brute-force phase computation scheme) in time domain for the Brusselator (changes in the molecule number for the species Y are monitored). The star and the circle obtained at the end of the simulations (let us call this time t0) in Figure 10 are fed as initial conditions to the RRE in (11), hence the star and the circle at the beginning of the traces in this figure. The waveforms in this figure monitor the same entry for these two different RRE solutions, i.e., the changes in the molecule number for the species Y are shown. The curve starting with the circle should come to be almost periodic in a matter of a few periods for this oscillator. Then the phase shift between the two waveforms can be computed. This phase shift belongs to the point identified by the circle in Figure 10 at the end of the simulation (we have called this time t0). This phase shift has been obtained with respect to the star in Figure 10 at again the time t0.
Figure 12. Mechanism of PhCompBF (the brute-force phase computation scheme) in state space for the Brusselator (changes in molecule numbers for both species are monitored). This is the state-space pictorial description of PhCompBF that corresponds to Figure 11. There are two RRE solutions in this figure. The final states of the solutions in Figure 10 are fed as initial conditions to the RRE in (11) for the Brusselator. The RRE solution, whose initial and final conditions are indicated by the circle, approaches the limit cycle and almost starts tracing it, traveling clockwise. The solution indicated by the star, which is actually leading in terms of phase that indicated by the circle, has already made the rightmost turn at the end of this simulation. The circle is way behind. The actual phase shift between the two solutions has to be computed as explained in Figure 11.
For some oscillators (as determined by the dynamics of the RRE again), a state off the limit cycle converges fast to begin tracing quickly an almost periodic curve, as in the case in hand. Almost two periods are enough to deduce the phase shift between the two curves. After RRE simulations, the phase shift can be computed using Fourier transforms .
One question that may arise is why we are particularly using the traces belonging to the species Y to compute phase shifts in Figure 11. Indeed, it follows from the theory that phase is a scalar-valued property of the whole system, therefore investigating phase shifts over non-constant periodic molecule numbers for any species in a system would yield the same phase shift value. In this case, employing Y is only a matter of choice.
Notice that this brute-force scheme is carried out to compute the relative phase shift of the SSA sample path at only t0 = 600 s. The phase shift for each state along the sample path can be computed one by one through the just outlined PhCompBF.
It has already been stated that PhCompBF is almost the golden reference for phase computations but also that the method is very time-consuming. It was for this reason that new methods depending on isochron and orbital deviation approximations were proposed. Particularly, two quantities are necessary for characterizing isochron approximations: the phase gradient v(t) and the phase Hessian H(t). These are depicted for the Brusselator respectively in Figures 13 and 14. Recall that v(t) is a vector function, but H(t) is a matrix function. Therefore, only the phase Hessian diagonals have been plotted in Figure 14.
Figure 13. Phase gradient for the Brusselator. Entries of the phase gradient (a vector function) as periodic functions, computed through the algorithm described in . The phase gradient is referred to as v(t) in this article.
Phase computation schemes are fairly easy to comprehend geometrically. Regarding for example the limit cycle depicted in Figure 10, there are both a hyperplane (accounting for the linear isochron approximation) and a quadric surface (for quadratic approximation) associated with each point on the limit cycle. Equations for these characterizations are given in (40) and (41), respectively. A phase computation scheme aims to solve for that point on the limit cycle whose linear or quadratic isochron approximation passes through a given point, for example the stated point denoted by the circle off the limit cycle in Figure 10, xssa(t0 = 600 s). Notice that PhCompBF is also a variant of these phase computation schemes, but in this case not the isochron approximations but the exact isochrons themselves associated with points on the limit cycle are used.
The geometrical interpretations of phase equations, on the other hand, are not easy to visualize. As stated in previous sections, phase equations are differential equations involving orbital deviation in addition to isochron approximations. Phase computation schemes are expected to be more costly but then more accurate with respect to phase equations. Phase equations, as they are differential equations and need to be discretized, suffer from local truncation errors and global errors, whereas this is not the case for the schemes that are in the form of algebraic equations. An approximate phase computation scheme may deviate from the golden reference (PhCompBF result) at times (particularly if the noisy state is too far off the limit cycle), but the scheme (if carefully designed) does not suffer from the accumulation of truncation errors and its phase results are expected to be almost always very close to that of PhCompBF.
We now check the performance of the phase computation methods for this oscillator, on a sample path that lasts about 1000 s, with the period about the same as that. The results are depicted in Figure 15. PhCompBF takes about 138 min. Speed-up of the methods on this duration are as follows: PhCompLin (the scheme depending on linear isochron approximations) 56x, PhEqnLL (the phase equation that employs linear isochron approximations and a linear differential equation model for orbital deviations) 8583x, and PhEqnQL (the phase equation with quadratic isochron and linear orbital deviation approximations) 2257x. The phase equations are most of the time sharing a common accuracy level, not disregarding the apparent attempt of PhEqnQL to come closer to PhCompBF around 400-600 s. PhCompLin is slower than the equations but almost as accurate as can be.
Figure 15. Phase computation methods on the Brusselator. The approximate schemes are almost a perfect match for the golden reference PhCompBF. The equations are very fast as indicated by the speed-up figures given in the text. Results of the phase equations are quite close to each other. In the interval 400-600 s, PhEqnQL comes closer to the true value. The following observations and facts are iterated for this first figure of the results. For convenience, these comments are not going to be repeated for every figure that follows. Note that the phase equations are in reality differential equations, solving one by one for the instantaneous phase of points in an oscillator sample path. Therefore, due to the approximations involved in their design and, furthermore, due to the imperfect discretizations (of the differential equations that they are represented by) for their numerical solutions, the phase equations are doomed to suffer from accumulating truncation errors. This is why, in many results figures for the oscillators in this article, we observe the results of phase equations tending to deviate from the golden reference PhCompBF as time progresses. However, computational complexity-wise the phase equations are indeed very fast. This makes the phase equations a feasible and accurate choice for the phase computations of less noisy oscillators, possibly with a dense grid of timepoints in an SSA sample path and high molecule numbers for every species in the system (especially in a container of large volume), deviating not much from their limit cycles. The phase computation schemes, on the other hand, do not employ as many approximations as the phase equations do in their design. Furthermore, these schemes are in the form of algebraic equations, again solving one by one for the instantaneous phase of points in an oscillator sample path. Therefore, the schemes, for their numerical solution, do not involve time discretizations as the phase equations do. This means that the schemes do not suffer from truncation error accumulation. The schemes are subject to errors originating from the approximations committed in their theoretical development, and once again, these approximations are not on the same scale as those employed in the derivation of phase equations, i.e., the schemes are much more accurate than the equations. However, the numerical procedures associated with the schemes render them more costly in computational complexity with respect to the equations. Therefore, one may rightfully contend that the phase computation schemes are tailored to fit phase computations for moderately noisy oscillators in small volume, with low molecule numbers for each species and possibly a sparse grid of timepoints in an SSA sample path.
In this section, we present phase computation results for a well-known and studied biochemical oscillator, the oregonator . This realistic oscillator accurately models the Belousov-Zhabotinsky reaction, an autocatalytic reaction that serves as a classical example of non-equilibrium thermodynamics. The molecular reactions model, adapted mostly from , is given as follows. Names of the reactants have been simplified for convenience.
In (12), the propensity functions, employing also the volume of the container, can easily be derived. Parameter values are: k1 = 0.005 s -1 mL, k2 = k3 = k4 = 1 s-1 mL, and k5 = 1.25 × 10 -4 s-1 (mL)3. Molecule numbers for the reactants A, B, and R are held constant. For this model, the volume initially is set to 12,000 mL. In this case, noise will not have considerable effect on a sample path. Then, we set the volume to 3,200 mL in order to obtain a moderately noisy oscillator. Later on, we will, halve the value of the volume parameter, resulting in a very noisy oscillator, and the performance of the phase computation methods will be demonstrated for this latter case as well.
With the volume as 12,000 mL, the performance of the phase computation methods on a particular sample path of length 4 × 104 s (the period is about 4.43 × 104 s) is depicted in Figure 16. PhCompBF simulation takes 502 minutes, with two periods of RRE computations before setting out to compute the phase shift values. There are a total of 8114 timepoints on the sample path. As the volume is decreased, the number of timepoints per unit time will reduce. The speed-up of the methods over PhCompBF are: PhCompLin (on linear isochron approximations) 70x, PhEqnLL (on linear isochron and linear orbital deviation approximations) 10733x, PhCompQuad (on quadratic isochron approximations) 46x, and PhEqnQL (on quadratic isochron and linear orbital deviation approximations) 2791x. It is observed that all the methods for a good part of the sample path stick to the PhCompBF result. However, towards the end the phase equations (with PhEqnQL a little more accurate compared to PhEqnLL) begin accumulating global errors, Otherwise, they are exquisitely fast all the time and accurate at the beginning until they start deviating from the golden reference. The phase computation schemes are not as fast as the equations, but they are always accurate in this simulation.
Figure 16. Phase computation methods on the Oregonator. (volume = 12, 000 mL). In a large volume, the system is not expected to be very noisy. The phase is closer to ideal. Therefore, all phase computation methods are quite accurate, but the phase equations have started to accumulate global errors towards the end of the simulation, as they are differential equations.
We have also tested the phase computation methods on a sample path, with the volume set to 3,200 mL. Figure 17 illustrates the results. The simulation interval length (5 × 104 s) is a little more than the period (about 4.37 × 104 s). The simulation for PhCompBF took 242 minutes, and there are 2981 timepoints in total. The observed speed-ups were: PhCompLin 70x, PhEqnLL 13971x, PhCompQuad 51x, and PhEqnQL 3203x. It is observed that the phase equations are really fast, keeping track of the exact phase though not very closely, whereas the computation schemes, though not as fast, are almost a perfect match for the exact phase in terms of accuracy.
Figure 17. Phase computation methods on the Oregonator. (volume = 3, 200 mL). In a smaller volume, the system is noisier. Phase equation results deviate in accuracy. PhEqnQL is a little more accurate. The schemes retain their accuracies.
We then set volume to 1,600 mL, resulting in a noisier oscillator. We expect the phase equations results to deviate much more from the exact one, and the computation schemes to still do well. Again for a sample path (of length 5 × 104 s with the period 4.3 × 104 s), the PhCompBF simulation now takes 76 min. There are 1033 timepoints. Speed-ups with the methods are: 12637x (PhEqnLL), 74x (PhCompLin), and 44x (PhCompQuad). PhEqnQL apparently suffers from numerical problems for such a noisy oscillator, and the result for this method is not included. In Figure 18, we observe in line with our expectations that although PhEqnLL is again very fast, the result it produces is almost unacceptably inaccurate, whereas both the computation schemes maintain their relative speed-ups (as compared to the less noisy version) along with their accuracies.
Figure 18. Phase computation methods on the Oregonator. (volume = 1, 600 mL). In an even smaller volume, the system is very noisy. PhEqnLL computes the phase shift result very fast, but this result is unacceptably inaccurate. The schemes are still accurate.
The Repressilator is a synthetic genetic regulatory network, designed from scratch and implemented in Escherichia coli using standard molecular biology methods . Its development is a milestone in synthetic biology. We have obtained the model as an SBML file in XML format [41-43]. We have used the libSBML  and SBMLToolbox  libraries to interpret the model and incorporate it to our own manipulation and simulation toolbox for phase computations. The period of the continuous oscillator obtained from the model is about 2.57 h. A sample path running for about 3 h was generated, and the phase methods were applied. The results are in Figure 19. PhCompBF (the brute-force scheme) takes about 76 min. Speed-ups obtained with the methods are: PhCompLin (on linear isochron approximations) 58x, PhEqnLL (on linear isochron and linear orbital deviation approximations) 7601x, and PhEqnQL (on quadratic isochron and linear orbital deviation approximations) 1994x. It appears in Figure 19 that PhEqnLL towards the end of the simulation has started to accumulate a global error. PhEqnQL looks a little more accurate. Again PhCompLin is, excepting a few minor intervals, the most accurate.
Figure 19. Phase computation methods on the Repressilator. PhEqnQL is more accurate than PhEqnLL, but the scheme PhCompLin is the most accurate.
6 Conclusions and future work
The phase computation methods described in this article basically target three classes of discrete molecular oscillators. First, the continuous phase models, based on the information obtained from the oscillator model in the continuous-state limit (i.e., basically the limit cycle and isochron approximations), are acceptably accurate for discrete molecular oscillators with a large number of molecules for each species, in a big volume. Indeed, we have shown in this article that the phase equations serve this purpose well. Second, for oscillators with very few molecules for each species in a small volume, a new phase concept needs to be developed, without resorting to continuous limit approximations. This one is as yet an unsolved problem. Third, there are systems in between the two classes just stated, with moderate number of molecules, for which the continuous phase concept is still useful but requires a hybrid approach with combined use of both discrete and continuous models for acceptable accuracy (note that the phase computation schemes are tailored to concretize this hybrid approach), and this is where the contribution of this article should be placed.
As yet, the described methods benefit extensively from continuous state-space approxi-mations derived from the molecular descriptions of such oscillators, and the assumed most accurate brute-force scheme shares this aspect. A future direction furthering this study can be described as follows, in line with the necessity of handling the second class of oscillators stated above. A proper phase model theory (not relying on continuous limit approximations) for discrete-space oscillators modeled with Markov chains needs to be developed. We believe that such a discrete phase model theory can be developed based on cycle representations for Markov chains [46-48]. We made progress also on this problem. We have developed a theory that precisely characterizes the phase noise of a single cycle in a continuous-time Markov chain. We were able to show that the phase noise theory we have developed for a single cycle in fact reduces to the previously developed continuous-space phase noise theory in the limit. We are currently working on extending this discrete phase noise theory to many cycles, i.e., to a cycle decomposition of a continuous-time Markov chain.
7 Methods - Modeling and simulation of discrete molecular oscillators
In this section we review, after giving preliminary information (Section 7.1), some crucial paradigms in the modeling of discrete molecular oscillators: a model that is the complete probabilistic characterization of a discrete system, known as the CME (Section 7.2), a continuous deterministic approximation to the CME in the form of the Reaction Rate Equation (Section 7.3), and the steps that let us proceed to a continuous stochastic model, the Chemical Langevin Equation, from again the CME (Section 7.4). Also a descriptive review of the SSA algorithm of Gillespie  for the simulation of molecular models is provided in Section 7.5.
We first describe a mathematical model for an autonomous, discrete molecular oscillator based on a stochastic chemical kinetics formalism [24-28,30]. We consider N molecular species denoted by S1, S2,..., SN. Let X be the stochastic vector [X1, X2, ..., XN]Τ where Xi is the number of molecules of species Si in the reaction chamber (i.e., a cell). The M reactions taking place among these molecular species are denoted by R1, R2, ..., RM. Let aj (X) denote the propensity [25,27] of reaction j, i.e., the probability that one Rj reaction will occur somewhere in the system in the next infinitesimal time interval [t, t + dt) is given by aj (X) dt, i.e.,
Let sji denote the change in the number of molecules of species Si as a result of one Rj reaction. We define the stoichiometry vector sj
for reaction Rj, and the N × M stochiometry matrix 
7.2 Chemical master equation
The following derivation follows closely that outlined in . Let us take a note of the events X(t + dt) = x, X(t) = x - sj and X(t) = x, where dt is an infinitesimal time element. Through several manipulations making use of these events and taking the limit as dt → 0 , we obtain
where denotes the probability that the system is at state x at time t. The above is known as the CME [27-30]. If we enumerate all the (discrete) state configurations X can be in as C1, C2,..., Cns and define,
then, the CME in (16) can be written as
where Q is a constant square matrix with dimension ns × ns, known as the transition rate matrix [28,29]. The above is a linear system of homogeneous ODEs, but the number of state configurations ns is possibly huge. It is usually not practically feasible to construct and solve (19). CME in (16) and (19) above corresponds to a homogeneous, continuous-time Markov chain model [28-30]. The state transitions of this Markov chain are highly structured and compactly described by the list of the reactions as in the CME. The CME provides the ultimate probabilistic characterization for a discrete molecular oscillator. It was shown that the solution of the CME converges to a unique stationary distribution. For a discrete molecular oscillator with a limit cycle, this stationary probability distribution takes the form of a "probability crater" for a planar system with two species .
7.3 From the stochastic CME to the deterministic rate equations
We note here that unless aj(x) is a linear function of x. Thus, in general, (20) can not be solved for since the term involves higher-order moments of X(t) . However, if we assume that the fluctuations of X(t) around its mean is negligible and thus can perform a crude moment closure scheme, i.e., if , then (20) simplifies to
where S is the stoichiometry matrix defined in (15) and
7.4 From CME to Langevin model
The derivations in this section have been particularly borrowed from . If we assume that the reaction propensities aj(X(t)) for j = 1, ..., M are constant in [t, t + dt) (known as the leap condition) [26,27], then the number of the times reactions fire in [t, t + τ) are independent Poisson random variables [26-30] with mean and variance equal to aj(x(t)) τ, denoted by for j = 1, ..., M. Hence, we can write,
where for j = 1, ..., M are independent Gaussian random variables with zero mean and unity variance [26-30]. Incorporating (24) into (23), we recognize the (forward) Euler discretization of the following stochastic differential equation (SDE), known as a Langevin equation [26-28,30]:
where ξ(t) denotes an M × 1 vector of independent white stationary Gaussian processes with unity (two-sided) spectral density, and
denotes the diagonal M × M matrix function shown in (25). We note here that if the stochastic, fluctuation term (known as the diffusion term) above is omitted, we obtain the RREs in (21). We note here that, with the Langevin model, the stochastic fluctuations in the oscillator are captured by the second term in the right hand side in (25). This term represents an additive noise in the model. By zeroing this additive noise term, we are able to obtain the mean, deterministic dynamics of the oscillator as the solution of the RREs in (21). On the other hand, in the discrete, Markov chain model of the oscillator, the mean, deterministic behavior of the system and the stochastic fluctuations are not separable from each other [26-28,30].
7.5 Stochastic simulation algorithm (SSA)
Even though the CME in (16) and (19) provides the ultimate probabilistic characterization for a discrete molecular oscillator, its solution is most often not practical due to the huge number of possible state configurations. As a result, one most often performs a stochastic simulation of the continuous-time Markov chain that models the oscillator and generates a sample path or a realization for the state vector X(t) as a function of time t. This kind of a simulation can be performed with a technique called the SSA, proposed in Gillespie's seminal work . In the original SSA algorithm , the computational cost per reaction event (due to the generation of a random variable from a dynamic discrete probability distribution) is in the number of reactions M. The cost per reaction event can be reduced to by using a binary tree for random selection of reactions , and to under certain conditions . One also has to consider the fact that the time gap between reactions tends to shrink as the number of reactions M, the number of species N, and the number of molecules of every species increases. This means that the total computational cost of SSA for a given time period increases as a result . On the other hand, if the numbers of molecules of all of the species are very large, discrete stochastic simulation of a discrete molecular oscillator in the sense of SSA may be unnecessary [24,27]. In this case, the fluctuations around the deterministic limit cycle will be small, and the continuous Langevin model in (25) may be adequate. As the number of molecules increase, the reaction propensities aj(X(t)) become larger, and the fluctuation term in the Langevin model in (25) become less and less pronounced in comparison with the drift term, since the magnitude of the drift term is proportional to the reaction propensities whereas the fluctuation term is proportional to their square root [26-28].
Molecular models, their nature (as discrete or continuous, and as stochastic or deterministic), and the algorithms to solve these models are summarized in Figure 1. The approximation that leads us from the discrete stochastic CME to the continuous stochastic CLE is the Gaussian approximation to Poisson random variables and accordingly the τ-leap approximation. Similarly, infinite volume approximation takes us from the CLE to the continuous deterministic RRE. Sample paths in line with the CME can be generated through SSA. CLE is a type of stochastic differential equation, so it can be solved via appropriate algorithms. Solution of the RRE requires algorithms designed for ordinary differential equations (ODEs) [26-28].
8 Methods - Phase computations based on Langevin models
There exists a well developed theory and numerical techniques for phase characterizations of oscillators with continuous-space models based on differential and stochastic differential equations [15,22]. As described in Sections 7.3 and 7.4, continuous models in the form of differential and stochastic differential equations can be constructed in a straightforward manner for discrete molecular oscillators. Thus, one can in principle apply the previously developed phase models and computation techniques [15,22] to these continuous models.
The outline of this section is as follows: After presenting the preliminaries (Section 8.1), the phase computation problem is introduced (Section 8.2). The methods in Section 8.3 (phase models in the form of ODEs) and in Section 8.4 (phase computation schemes that involve the numerical solution of certain algebraic equations) are designed to numerically solve the phase computation problem of Section 8.2.
For a molecular oscillator, we assume that the deterministic RREs in (21) have a stable periodic solution xs(t) (with period T ) that represents a periodic orbit or limit cycle.
An isochron of an oscillator associated with the limit cycle xs(t) is a set of points that have the same phase. For an N-dimensional oscillator, each isochron is an N-1-dimensional hypersurface. The union of isochrons covers the neighborhood of its periodic orbit [1,14]. Isochrons form the basis for phase definition and phase computations for oscillators . In Figure 3, the limit cycle and the isochron portrait of a simple polar oscillator are shown [2,15].
Expanding (21) to first-order (linearization) around xs(t), with
(28) is a linear periodically time-varying (LPTV) system. The adjoint form of (28) is given by
The PPV v(t) is defined as the T-periodic solution of the adjoint LPTV equation in (29), which satisfies the following normalization condition
where u(t) = dxs(t)/dt. The entries of the PPV are the infinitesimal PRCs . The PPV is instrumental in forming linear approximations for the isochrons of an oscillator and in fact is the gradient of the phase of an oscillator  on the limit cycle represented by xs(t).
We next define the matrix H(t) as the Jacobian of the PPV as follows
taking into note that actually both v(t) = v(xs(t)) and H(t) = H(xs(t)) are functions of the periodic solution xs(t). The function H(t) is in fact the Hessian of the phase of an oscillator  on the limit cycle represented by xs(t). This matrix function is useful in forming quadratic approximations for the isochrons of an oscillator.
8.2 Phase computation problem
The phase computation problem for oscillators can be stated as follows. It is observed in Figure 2 that assuming an SSA sample path and the periodic RRE solution start at the same point on the limit cycle (note that the two are in-phase initially), the two trajectories may end up on different isochrons instantaneously at t = t0 (i.e., the two traces at this instant are out of phase). However, according to the properties of isochrons, there is always a point on the limit cycle that is in-phase with a particular point near the limit cycle. Therefore, the existence of in-phase with the instantaneous point xssa(t0) is guaranteed. We call then the time argument of the instantaneous phase of xssa(t0) [1,2,14,22]. All methods described below in this section are designed to numerically compute this phase value.
8.3 Phase equations based on Langevin models
In this section, oscillator phase models in the form of ODEs are described. In , we have reviewed the first order phase equation based on linear isochron approximations, and we have also developed novel and more accurate second order phase equations depending on quadratic approximations for isochrons. We will, furthermore in this section, explain how to apply these models to discrete oscillator phase computation.
8.3.1 First-order phase equation based on linear isochron approximations
The first-order phase equation based on linear isochron approximations can be derived from the continuous Langevin model in (25) using the theory and numerical techniques described in [15,22], which takes the form
where represents the total phase of the oscillator (in units of time) and v(t) is the PPV discussed above. The value , the periodic solution xs(t) evaluated at the perturbed phase , represents possibly a good approximation for the solution of the Langevin equation in (25) provided that the perturbed oscillator does not wander off too far away from the deterministic limit cycle represented by xs(t).
The phase defined above and the phase equation in (32), capture the deviations (from the periodic steady-state) of the perturbed oscillator only along the limit cycle, i.e., phase deviations. A perturbed oscillator also exhibits orbital deviations away from its deterministic limit cycle. Moreover, for a discrete, molecular oscillator, the deterministic periodic solution xs(t) is merely the solution of its continuous and deterministic limit when the number of molecules are assumed to be very large. As such, the solution of a discrete molecular oscillator may exhibit large fluctuations around this continuous and deterministic limit. Thus, may not serve as a good approximation in such a case. In order to truly assess the quality of as an approximation in a meaningful manner, we need to compare it with a sample path solution of the discrete, Markov chain model that can be generated with an SSA simulation. However, a one-to-one comparison of based on the solution of the phase equation in (32) and a sample path obtained with an SSA simulation is not straightforward. In solving (32), one would normally generate sample paths for the independent white stationary Gaussian processes denoted by ξ(t). In an SSA simulation, sample paths are generated as described in Section 7.5. If done so, a one-to-one comparison between a sample path from an SSA simulation and would not make sense. In order to make this sample path based comparison meaningful, we use the same discrete random events that are generated in an SSA simulation in order to synthesize the sample paths for the independent white stationary Gaussian processes ξ(t) in the numerical simulation of (25). More precisely, we proceed as follows. We numerically compute the solution of (32) in parallel and synchronous with an SSA simulation. We discretize the SDE in (32) using time steps that are dictated by the reaction occurrence times in the SSA simulation. Assuming that the last reaction has just occurred at time t, the next reaction will occur at time t + τ and it will be the jth reaction, we form the update equation for as follows
where ej is the M × 1 unit vector with the jth entry set to 1 and the rest of the entries set to 0, and
is an M × 1 column vector of reaction propensities evaluated at . The form of the update rule above in (33) can be deduced by examining (24) where we have approximated a Poisson random variable with a Gaussian one. With (33) above, the sample paths for the white Gaussian processes ξ(t) in (25) (and hence the Wiener processes as their integral) are being generated as a cumulation of the individual events, i.e., reactions, that occur in the SSA simulation of the oscillator at a discrete, molecular level. In the update rule (33), we subtract from ej that represents an individual reaction event in order to make the synthesized ξj(t) zero mean. The mean, deterministic behavior of the oscillator is captured by the first drift term on the right hand side of (25) which is used in the computation of the periodic steady-state solution xs(t) and the PPV v(t). Thus, the mean behavior is already captured, and that is why, it needs to be subtracted in (33). We can now compare and the SSA generated sample path in a one-to-one manner in order to assess the quality of . We should note here that the SSA simulation that is run in parallel and synchronous with the solution of the phase equation in (32) is necessary only for a meaningful sample path based comparison. One would normally not run an SSA simulation but simply generate sample paths for the Gaussian processes ξ(t) and numerically solve (32) with an appropriate technique and generate a sample path for the phase . In this case, we would not be synthesizing ξ(t) as a cumulation of reaction events from SSA, but instead directly as white Gaussian processes.
Figure 4 summarizes the phase equations (as opposed to the phase computation schemes, to be introduced later) approach for oscillator phase computations. An SSA sample path is generated. Then, the reaction events in the SSA sample path are recorded. This information, along with limit cycle and isochron approximations computed from the RRE, are fed into phase equations (the first-order phase equation in (32) has been given as an example in Figure 4), which in turn yield the phase . A high-level pseudocode description of phase computations using the first order phase equation is given in Algorithm 1.
In (33), we evaluate the reaction propensities at , on the solution of the system projected onto the limit cycle represented by xs(t). However, the oscillator also experiences orbital fluctuations and rarely stays on its limit cycle. Based on linear isochron approximations, we can in fact compute an approximation for the orbital fluctuations as well by solving the following equation 
With the orbital fluctuation computed by solving the above linear system of differential equations, we can form a better approximation for the solution of the oscillator:
Then, one can evaluate the reaction propensities at instead of , in (32), (33) and (35), in order to improve the accuracy of phase computations. One can further improve accuracy, by replacing in (35) with
marking also that the matrix G is indeed a function of explicitly the state variables. Still, the equations in (32) and (35) are both based on linear isochron approximations. Phase and orbital deviation equations based on quadratic approximations for isochrons will provide even better accuracy, which we discuss next.
8.3.2 Second-order phase equation based on quadratic isochron approximations
The second-order phase equation based on quadratic isochron approximations can be derived from the continuous Langevin model in (25) using the theory and numerical techniques described in [15,22], which takes the form
With quadratic approximations for the isochrons of the oscillator, the phase computations based on (38) and (39) will be more accurate. We can assess the accuracy of the results obtained with these equations again by numerically solving them in synchronous fashion with an SSA simulation while synthesizing the white Gaussian processes ξ(t) as a cumulation of the reaction events in SSA, as described in Section 8.3.1.
8.4 Phase computation schemes based on Langevin models and SSA simulations
With the phase equations based on linear and quadratic isochron approximations described in Section 8.3, we can compute the phase of an oscillator without having to run SSA simulations based on its discrete, molecular model. We note here again that the SSA simulations described in (32) were necessary only when a one-to-one comparison between the results of phase computations based on phase equations and SSA simulations was required. On the other hand, more accurate phase computations can be attained if they are based on, i.e., use information, from SSA simulations. In this hybrid scheme, we run an SSA simulation based on the discrete, molecular model of the oscillator. For points (in the state-space) on the sample path generated by the SSA simulation, we compute a corresponding phase by essentially determining the isochron on which the point in question lies. Here, one can either employ no approximations for the isochrons or perform phase computations based on linear or quadratic isochron approximations. In , we have established the theory for these types of approximate phase computation schemes based on linear and quadratic isochron approximations.
The brute-force phase computations without isochron approximations, which we call Ph-CompBF in short, aims to compute the phase difference between two individual given points, based on the isochron-theoretic phase definition with respect to the periodic solution xs(t) tracing the limit cycle. This method is computationally costly [15,22], as the following explanation based on Figure 5 will reveal. An SSA sample path is computed and the instantanous phase of xssa(t0) is desired to be found. Note that t0 is a particular value in time. For this purpose, in the transition from Figure 5a to 5b, all noise is switched off and RRE solutions (trajectories in state space) starting from xs(t0) (star on the limit cycle) and xssa(t0) (circle off the limit cycle) in Figure 5a are computed. We can compute the phase shift between these two traces only when the off-cycle solution converges as in Figure 5c, that is we will have to integrate RRE for this solution until it becomes approximately periodic in the time domain. In this plot, the illustration has been prepared such that the convergence to the limit cycle takes one period or so, but this may not always be the case. Indeed, ideally this process takes infinite time. This is why the brute-force method is costly. Eventually, the phase shift between the two trajectories can be computed and added to instantaneous time t0, to compute the phase [15,22].
The phase computation based on isochron approximations and SSA simulations proceeds as follows: Let xssa(t) be the sample path for the state vector of the oscillator that is being computed with SSA. We either solve
based on linear isochron approximations or
based on quadratic isochron approximations for the phase that corresponds to xssa(t) [15,22]. The above computation needs to be repeated for every time point t of interest. Above, for xssa(t), we essentially determine the isochron (in fact, a linear or quadratic approximation for it) that passes through both the point on the limit cycle and xssa(t). The phase of , i.e., , is then the phase of xssa(t) as well since they reside on the same isochron. An illustration of the scheme founded upon linear isochron approximations is given in Figure 6. In this plot, we are looking for an isochron whose linear approximation goes through xssa(t0), and this is the isochron of the point . Notice that the linear approximation (the straight line in Figure 6) is tangent to the isochron of at exactly . The value then is the phase computed by this scheme. Notice that there is some difference between the exact solution and the approximate . This difference is certain to shrink if the isochrones are locally closer to being linear. For more accurate but still approximate solutions, the quadratic scheme can be used [15,22].
We should note here that, even though xssa(t) above is computed with an SSA simulation based on the discrete model of the oscillator, the steady-state periodic solution , the phase gradient and the Hessian (i.e., all of the information that is used in constructing the isochron approximations) are computed based on the continuous, RRE model of the oscillator [15,22]. The phase computation schemes we describe here can be regarded as hybrid techniques that are based both on the continuous, RRE and the discrete, molecular model of the oscillator. On the other hand, the phase computation schemes discussed in Section 8.3 based on phase equations are completely based on the continuous, RRE and Langevin models of the oscillator. Figure 7 explains the ingredients that the phase computation schemes utilize. An SSA sample path is generated (note that alternatively a sample path may be generated through the CLE). From the RRE model, limit cycle information (xs(t)) and isochron approximations (v(t) and H(t)) are computed. All this information is fed into the phase computation schemes (in Figure 7 we have given the expression for the scheme utilizing linear approximations for convenience, as this is the method likely to be preferred due to its lower complexity despite its inferior accuracy as compared to the quadratic scheme) and then finally the phase is found. A high level pseudocode of phase computations using the scheme depending on linear isochron approximations is given in Algorithm 2.
9 Methods - Oscillator models, numerical methods, and implementation notes
This section briefly describes where suitable oscillator models can be found particularly on the internet and how these models can be modified when possible (Section 9.1), how the obtained ODE models can be handled computationally (Section 9.2), a description of the numerical methods used in the simulations (Section 9.3), and the computational costs that they incur (Section 9.4).
9.1 Biochemical oscillator models
Oscillator models for analysis can be found from multiple resources on the web. Models generally come in two separate forms, described briefly as follows.
Models of the first type are translated directly from actual biochemical reactions. Propensities of the reactions are functions of a reaction rate parameter and appropriate algebraic expressions of molecule numbers associated with the reacting species. As such, the propensities are always positive. Moreover, the volume parameter (associated with the container or the cell accommodating the species) can easily be incorporated into the propensity functions. Volume of the cell implies the level of noisiness in the sample path simulations, i.e., basically, the more voluminous a cell, the more the number of each reacting species, and then the closer the sample path solution to the ensemble average. Therefore, one may rightfully declare that every different value for the volume parameter defines a new oscillator to be analyzed, although the mechanism of the reactions and the pattern for the propensities remain the same for a pre-determined setting.
Models of the second type are provided directly as ODE models. In some cases, the propensity functions are difficult to handle, and it is not obvious how the crucial volume parameter can be incorporated into the equations. Then, it happens that analysis of these oscillators is a little restricted, not having the capability to adjust the level of noisiness in a correct and reliable manner. However, in all, the simulations can be carried out for the value of the volume implied by the ODE model.
As to where oscillator models can be found on the web, there are multiple alternatives. http://www.xmds.org/ webcite is the website for a simulator, in which particularly models from  have been modified in appropriate form to be analyzed. We have benefitted extensively from the models we have obtained from these references, as most of them are models of the first type described above. One of the other alternatives is obtaining ODE models (models of the second type stated above) from online repositories such as [41-43] and manipulate them via appropriate software toolboxes [44,45].
9.2 Information computed from the ODE model and SSA
Oscillator models are approximated by ODEs in the deterministic sense, through procedures already explained in the previous sections. Our purpose before handling a sample path generated by SSA is to have available in hand some crucial computational quantities that will help compute the phase along the sample path. All these crucial quantities will be computed using the ODE model. A shooting type of formulation  is preferred to obtain the periodic solution, more particularly a number of discrete timepoints for xs(t) along a single period. The shooting method solves this boundary value problem efficiently even for large systems of ODEs . A further key benefit is that by-products of the shooting method can be utilized in solving for v(t), namely the PPV or the phase gradient . On top of xs(t) and v(t) and using again the by-products of these computations, H(t), the phase Hessian, can be obtained through the algorithm proposed in . Now, SSA simulations for the sample paths of the noisy molecular oscillator can be performed , and these sample paths are analyzed in terms of phase with the following numerical methods. It should be recalled, however, that during the SSA simulation, also pieces of information have to be stored at each reaction event, conveying which reaction was chosen randomly to be simulated and what were the propensity function values at that particular instant.
9.3 Phase simulations
In this section, we provide details concerning the numerical aspects of the proposed phase computation methods.
The brute-force scheme (PhCompBF) (described in Section 8.4) is basically run for all of the timepoints in an SSA-generated sample path, and it is very costly in terms of computation. If xssa(t0) is a timepoint in the sample path (naturally at where a state change takes place) the RRE is integrated with this initial condition at t = 0 for a long time so that this deterministic solution settles to the limit cycle in continuous time. The solution of the RRE with the initial condition xs(t0) at t=0 can be readily computed, this is a shifted version of the periodic solution xs(t) that is available. If the phase shift between the two solutions is computed, this shift is the phase shift of the sample path xssa at t = t0 . Since one generally does not know the phase value at the very first timepoint of an SSA sample path, the brute-force scheme is mandatory in computing this phase value and providing the initial condition, on which all of the other approximate phase computation schemes and equations can operate.
The approximate phase computation schemes  (again described in Section 8.4) consist of solving the algebraic equation in (40) or (41), depending on whether linear or quadratic approximations are respectively preferred to be used, and they are also run for all points in the SSA sample path (see Algorithm 2 for the pseudocode of phase computations utilizing the scheme founded upon the linear isochron approximations). Benefitting from the scalar nature of these equations, the bisection method is used extensively in their numerical solution. Details and subtleties involved with these schemes (of considerably less computational load compared to PhCompBF) are provided in .
Phase equations , described in Section 8.3 are in this context stochastic differential equations, operating on the recorded reaction events of an SSA sample path. The specific discretization scheme applied to the first order phase equation is explained in detail in Section 8.3.1 (see Algorithm 1 for the pseudocode of phase computations with this first order equation). This discretization scheme can be easily extended to the second order phase equation of Section 8.3.2.
We will denote each method analyzed and used in generating results by some abbreviations, for ease of reference. The brute-force scheme explained above is denoted by Ph-CompBF, the scheme depending on linear isochron approximations (summarized by (40)) by PhCompLin, and that depending on quadratic in (41) by PhCompQuad. The first order phase equation of (32) is denoted by PhEqnLL (the first L for linear isochron approximations and the second L for linear orbital deviation approximations). The second order phase equation of (38) and (39) is denoted by PhEqnQQ (Q for both type of approximations, isochron and orbital deviation). We prefer to use instead of PhEqnQQ a simpler, but numerically more reliable, version of the second order equation. This simpler version is described by the equations (38) and (35). Equation (35) is the orbital deviation equation belonging to the first order phase equation theory. In turn, we denote this simpler model by PhEqnQL .
9.4 Analysis of computational complexities
In this section, we analyze the computational costs of phase computation schemes and phase equations. Let us denote by N the number of states in an oscillator, M the number of reactions, K the number of timepoints along a single period, L the number of total timepoints along the interval where a phase computation method is run.
Preliminary statements on computational complexities are as follows. We assume as well-known complexities that xs(t), G(t) (assumed to be sparse), u(t) and v(t) are computable along a single period in time. The computation of H(t) (which is usually not sparse) upon the stated quantities takes time . We assume that if a matrix is sparse, then matrix vector multiplications and solving a linear system of equations involving this matrix can be done in linear time.
For PhCompBF (see Section 8.4 and Figure 5 for explanations), in order to compute the phase of a point xssa(t0), we have to integrate the RRE with initial condition xssa(t0) for an ideally infinite number, namely nper, of periods, so that the states vector can be assumed more or less to be tracing the limit cycle. If FFT (fast Fourier transform) properties are used to compute the phase shift between periodic waveforms, the overall complexity of PhCompBF can be shown to amount to .
The approximate phase computation schemes consist of solving the algebraic equations in (40) or (41) (depending on whether the linear or quadratic scheme is preferred). The bisections method is used to solve these equations. In order to compute the phase value of a particular timepoint, an interval has to be formed. In forming such an interval, we start with an interval, of length dmin and centered around the phase value of the previous timepoint, and double this length value until the interval is certain to contain the phase solution. The allowed maximum interval length is denoted by dmax. Then, the bisections scheme starts to chop down the interval until a tolerance value dtol for the interval length is reached. See Algorithm 2 for the pseudocode of phase computations using PhCompLin (the scheme depending on linear isochron approximations), based on this explanation. More explanations on the flow of PhCompLin are given in Section 8.4 and Figure 6. The PhCompLin computational complexity can be shown to be
and PhCompQuad (which depends on quadratic isochron approximations) complexity is
based on the explanations above.
The computational complexity expressions for all of the phase computation schemes are summarized in Table 1.
Table 1. Computational complexities for the phase computation schemes
Phase equation solution complexities depend (in extreme conditions) mainly on the stoichiometric matrix S being sparse (few nonzero entries per row) or totally dense. Note that in realistic problems S is observed to be usually sparse. These stated respective conditions lead us to come up with best and worst case complexities. As such, PhEqnLL (the equation employing linear isochron and linear orbital deviation approximations) complexity in the best and worse case can be shown to be and , respectively. PhEqnQL (with quadratic isochron and linear orbital deviation approximations) complexities are (best case) and (worst case). Complexities for the phase equations are summarized in Table 2. For a pseudocode of phase computations using PhEqnLL, see the explanation in Section 8.3.1 and Algorithm 1 based on this account.
Table 2. Computational complexities for the phase equations
The essence of the above analyses is that there is a trade-off between accuracy and computational complexity . For mildly noisy oscillators, the phase equations should remain somewhat close to the results of the golden reference PhCompBF and the other approximate phase computation schemes, which imitate PhCompBF very successfully with much less computation times. For more noisy oscillators, we should expect the phase computation schemes to do still well, although the phase equations will compute some inaccurate results very fast. PhCompBF is always very slow .
SSA: Stochastic Simulation Algorithm; CME: Chemical Master Equation; CLE: Chemical Langevin Equation; RRE: Reaction Rate Equation; SDE: Stochastic Differential Equation; ODE: Ordinary Differential Equation; PhCompBF: brute-force phase computation scheme; PhCompLin: phase computation scheme depending on linear approximations for isochrons; PhCompQuad: phase computation scheme depending on quadratic approximations for isochrons; PhEqnLL: phase equation depending on linear approximations for isochrons and linear approximations for orbital deviation; PhEqnQL: phase equation depending on quadratic approximations for isochrons and linear approximations for orbital deviation; PhEqnQQ: phase equation depending on quadratic approximations for isochrons and quadratic approximations for orbital deviation.
The authors declare that they have no competing interests.
Algorithm 1 - PhEqnLL pseudocode
input : oscModel and ssaPath
output: phase and phaseShift of points in ssaPath
//compute limit cycle 
1 xs(t) = computeLimitCycle (oscModel);
//compute linear isochron approximations along a single period 
2 v(t) = computePhaseGradient (oscModel);
//obtain SSA path data
3 pts = pts in ssaPath;
4 for i ← 1 to size(pts in ssaPath) do
//for the first timepoint, use the brute-force scheme PhCompBF
//refer to Section 8.4 and Figure 5 for explanations
//refer to Section 9.4 for computational complexity
5 if i is equal to 1 then
//tValue of pts(i) : the time at which pts(i) occurs
//value of pts(i) : state vector for the oscillator at tValue of pts(i)
6 phaseShift(i ) = PhCompBF(oscModel, xs(t), tValue of pts(i), value of pts(i ));
7 phase(i ) = [ tValue of pts(i) ] + phaseShift(i);
//for the other timepoints, use the first order phase equation
//PhEqnLL update rule is given in (33) of Section 8.3.1
//more implementation details and computational complexity in Section 9.4
//stoichiometric matrix (S) and propensity function (a(X))
//information are embedded in oscModel
9 if i is not equal to 1 then
10 tau = [ tValue of pts(i ) ] - [ tValue of pts(i-1 ) ];
//Now apply the update rule in (33)
//reactionNo of pts(i ) : number of the reaction occuring at tValue of pts(i )
//ej is an M-sized vector with its j th entry one
11 phase(i) =
phase(i-1 ) + tau + vΤ(phase(i-1)) S [ereactionNo of pts(i) - a(xs(phase(i-1))) tau];
12 phaseShift (i)=phase(i)-[tValue of pts(i)];
Algorithm 1: PhEqnLL pseudocode
Extended caption for Algorithm 1: Lines 1-2 compute the limit cycle and the phase gradient. In lines 4-14, the phase computation is described. Lines 5-8 describe the use of the brute-force scheme PhCompBF for the phase computation of the first timepoint. In lines 9- 13, the phase computation of the other timepoints is accomplished via PhEqnLL (the phase equation founded upon the linear isochron and the linear orbital deviation approximations).
Algorithm 2 - PhCompLin pseudocode
input : oscModel and ssaPath
output: phase and phaseShift of points in ssaPath
1 xs(t) = computeLimitCycle (oscModel); v(t) = computePhaseGradient (oscModel);
//obtain SSA path data
2 pts = pts in ssaPath;
3 for i ← 1 to size(pts in ssaPath) do
//for the first timepoint, use the brute-force scheme PhCompBF
4 if i is equal to 1 then
5 phaseShift(i) = PhCompBF(oscModel, xs(t), tValue of pts(i), value of pts(i));
6 phase(i ) = [ tValue of pts(i)] + phaseShift(i );
//for the other timepoints, use PhCompLin, see (40) of Section 8.4
//pictorial description in Figure 6
//algorithm description and computational complexity in Section 9.4
8 if i is not equal to 1 then
//phase(i-1 ) used as the midpoint of the interval
9 d = dmin/2; interval = [ phase(i-1 ) - d, phase(i-1) + d];
10 while length(interval) < dmax/2 do
11 if solution is in interval then break;
12 d = 2* d; interval = [ phase(i-1) - d, phase(i-1 ) + d];
//use bisection method to compute the solution to (40)
14 phase(i ) = BisectionMethod(oscModel, xs(t), v(t), interval, value of pts(i));
15 phaseShift(i) = phase(i) - [tValue of pts(i)];
Algorithm 2: PhCompLin pseudocode
Extended caption for Algorithm 2: Line 1 computes the limit cycle and the phase gradient. In lines 3-17, the phase computation is described. Lines 4-7 describe the use of the brute-force scheme PhCompBF for the phase computation of the first timepoint. In lines 8-16, the phase computation of the other timepoints is accomplished via PhCompLin (the phase computation scheme founded upon the linear approximations for isochrons).
This work was supported by the Scientific and Technological Research Council of Turkey (TUBITAK).
L Fu, H Pelicano, J Liu, P Huang, C Lee, The circadian gene Period2 plays an important role in tumor suppression and DNA damage response in vivo. Cell 111, 41–50 (2002). PubMed Abstract | Publisher Full Text
S Davis, DK Mirick, Circadian disruption, shift work and the risk of cancer: a summary of the evidence and studies in Seattle. Cancer Causes Control 17, 539–545 (2006). PubMed Abstract | Publisher Full Text
ES Schernhammer, F Laden, FE Speizer, WC Willett, DJ Hunter, I Kawachi, CS Fuchs, GA Colditz, Night-shift work and risk of colorectal cancer in the nurses' health study. J Natl Cancer Inst 95, 825–828 (2003). PubMed Abstract | Publisher Full Text
K Straif, R Baan, Y Grosse, BE Secretan, FE Ghissassi, V Bouvard, A Altieri, L Benbrahim-Tallaa, V Cogliano, Carcinogenicity of shift-work, painting, and fire-fighting. Lancet Oncol 12(8), 1065–1066 (2007)
A Demir, A Mehrotra, J Roychowdhury, Phase noise in oscillators: A unifying theory and numerical methods for characterisation. IEEE Trans Circ Syst I Fund Theory Appl 47(5), 655–674 (2000). Publisher Full Text
JMG Vilar, HY Kueh, N Barkai, S Leibler, Mechanisms of noise-resistance in genetic oscillators. Proc Natl Acad Sci USA 99(9), 5988–5992 (2002). PubMed Abstract | Publisher Full Text | PubMed Central Full Text
K Josic, ET Shea-Brown, J Moehlis, Isochron. Scholarpedia 1(8), 1361 (2006). Publisher Full Text
O Suvak, A Demir, Quadratic approximations for the isochrons of oscillators: a general theory, advanced numerical methods and accurate phase computations. IEEE Trans Comput Aided Design Integr Circ Syst 29(8), 1215–1228 (2010)
A Demir, Fully nonlinear oscillator noise analysis: an oscillator with no asymptotic phase. Int J Circ Theory and Appl 35, 175–203 (2007). Publisher Full Text
FX Kaertner, Analysis of white and f -α noise in oscillators. Int J Circ Theory Appl 18, 485–519 (1990). Publisher Full Text
O Suvak, A Demir, Phase models and computations for molecular oscillators. in Proc 8th Internat, ed. by . Workshop on Computational Systems Biology (WCSB 2011) (ETH Zurich, Switzerland, 2011), pp. 173–176
DT Gillespie, Stochastic simulation of chemical kinetics. Ann Rev Phys Chem 58, 35–55 (2007). Publisher Full Text
DT Gillespie, Exact stochastic simulation of coupled chemical reactions. J Phys Chem 81(25), 2340–2361 (1977). Publisher Full Text
DT Gillespie, The chemical Langevin equation. J Chem Phys 113(1), 297–306 (2000). Publisher Full Text
DJ Higham, Modeling and simulating chemical reactions. SIAM Rev 50(2), 347–368 (2008). Publisher Full Text
M Amdaoud, M Vallade, C Weiss-Schaber, I Mihalcescu, Cyanobacterial clock, a stable phase oscillator with negligible intercellular coupling. Proc Natl Acad Sci USA 104, 7051–7056 (2007). PubMed Abstract | Publisher Full Text | PubMed Central Full Text
W Vance, J Ross, Fluctuations near limit cycles in chemical reaction systems. J Chem Phys 105, 479–487 (1996). Publisher Full Text
P Gaspard, The correlation time of mesoscopic chemical clocks. J Chem Phys 117, 8905–8916 (2002). Publisher Full Text
T Tomita, T Ohta, H Tomita, Irreversible circulation and orbital revolution. Prog Theory Phys 52, 1744–1765 (1974). Publisher Full Text
R Feistel, W Ebeling, Deterministic and stochastic theory of sustained oscillations in autocatalytic reaction systems. Phys A Stat Theor Phys 93(1-2), 114–137 (1978). Publisher Full Text
MA Gibson, J Bruck, Exact stochastic simulation of chemical systems with many species and many channels. J Phys Chem A 104, 1876–1889 (2000). Publisher Full Text
A Slepoy, AP Thompson, SJ Plimpton, A constant-time kinetic Monte Carlo algorithm for simulation of large biochemical reaction networks. J Chem Phys 128, 205101 (2008). PubMed Abstract | Publisher Full Text