Answers are grounded in this paper and cite their sources.
Recently, Markov processes for the evolution of coding DNA with neighbor dependence in the instantaneous substitution rates have been considered. The neighbor dependency makes the models analytically intractable, and previously Markov chain Monte Carlo methods have been used for statistical inference. Using a pseudo-likelihood idea, we introduce in this paper an approximative estimation method which is fast to compute. The pseudo-likelihood estimates are shown to be very accurate, and from analyzing 348 human-mouse coding sequences we conclude that the incorporation of a CpG effect improves the fit of the model considerably.
No takes yet. Share an insight, caveat, or question.
Christensen et al. (2005) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: