Slide 7
Slide 7 text
Solvable cases vs simulation
The model is a Markov chain described by a master equation.
Variables: joint probabilities that each site is in a specified
state, e.g. p(O1, U[2,72]
, A73, U[74,n−1]
, On).
Massive number of variables so solution is not feasible, but
statistics can be obtained from stochastic simulations.
The single-polymerase case is solvable.
For shorter genes, we can compute ρ(τ).
In general, we can recover all the moments of the distribution
of transcription times.