Schadt Eric, Lange Kenneth
Department of Biomathematics, UCLA School of Medicine, Los Angeles, CA, USA.
Mol Biol Evol. 2002 Sep;19(9):1534-49. doi: 10.1093/oxfordjournals.molbev.a004216.
This article generalizes previous models for codon substitution and rate variation in molecular phylogeny. Particular attention is paid to (1) reversibility, (2) acceptance and rejection of proposed codon changes, (3) varying rates of evolution among codon sites, and (4) the interaction of these sites in determining evolutionary rates. To accommodate spatial variation in rates, Markov random fields rather than Markov chains are introduced. Because these innovations complicate maximum likelihood estimation in phylogeny reconstruction, it is necessary to formulate new algorithms for the evaluation of the likelihood and its derivatives with respect to the underlying kinetic, acceptance, and spatial parameters. To derive the most from maximum likelihood analysis of sequence data, it is useful to compute posterior probabilities assigning residues to internal nodes and evolutionary rate classes to codon sites. It is also helpful to search through tree space in a way that respects accepted phylogenetic relationships. Our phylogeny program LINNAEUS implements algorithms realizing these goals. Readers may consult our companion article in this issue for several examples.
本文归纳了分子系统发育中密码子替换和速率变化的先前模型。特别关注以下几点:(1)可逆性;(2)对提议的密码子变化的接受和拒绝;(3)密码子位点间不同的进化速率;(4)这些位点在确定进化速率中的相互作用。为了适应速率的空间变化,引入了马尔可夫随机场而非马尔可夫链。由于这些创新使系统发育重建中的最大似然估计变得复杂,因此有必要制定新的算法来评估似然性及其关于潜在动力学、接受和空间参数的导数。为了从序列数据的最大似然分析中获得最大收益,计算将残基分配给内部节点以及将进化速率类别分配给密码子位点的后验概率是有用的。以尊重公认的系统发育关系的方式在树空间中进行搜索也很有帮助。我们的系统发育程序LINNAEUS实现了实现这些目标的算法。读者可参考本期我们的配套文章获取几个示例。