Rodrigue Nicolas, Philippe Hervé, Lartillot Nicolas
Canadian Institute for Advanced Research, Département de Biochimie, Université de Montréal, C.P. 6821, Succ. Centre-ville, Montréal, Québec Canada.
Bioinformatics. 2008 Jan 1;24(1):56-62. doi: 10.1093/bioinformatics/btm532. Epub 2007 Nov 14.
Mapping character state changes over phylogenetic trees is central to the study of evolution. However, current probabilistic methods for generating such mappings are ill-suited to certain types of evolutionary models, in particular, the widely used models of codon substitution.
We describe a general method, based on a uniformization technique, which can be utilized to generate realizations of a Markovian substitution process conditional on an alignment of character states and a given tree topology. The method is applicable under a wide range of evolutionary models, and to illustrate its usefulness in practice, we embed it within a data augmentation-based Markov chain Monte Carlo sampler, for approximating posterior distributions under previously proposed codon substitution models. The sampler is found to be more efficient than the conventional pruning-based sampler with the decorrelation times between draws from the posterior reduced by a factor of 20 or more.
在系统发育树上描绘字符状态变化是进化研究的核心。然而,当前用于生成此类映射的概率方法并不适用于某些类型的进化模型,特别是广泛使用的密码子替换模型。
我们描述了一种基于均匀化技术的通用方法,该方法可用于在字符状态比对和给定树拓扑结构的条件下生成马尔可夫替换过程的实现。该方法适用于广泛的进化模型,为说明其在实际中的有用性,我们将其嵌入基于数据增强的马尔可夫链蒙特卡罗采样器中,用于在先前提出的密码子替换模型下近似后验分布。结果发现,该采样器比传统的基于剪枝的采样器更有效,后验抽样之间的去相关时间减少了20倍或更多。