Vingron M, von Haeseler A
Deutsches Krebsforschungszentrum, Abt. Theoretische Bioinformatik, Heidelberg, Germany.
J Comput Biol. 1997 Spring;4(1):23-34. doi: 10.1089/cmb.1997.4.23.
A central problem in the study of molecular evolution is the reconstruction of the history of a set of biological sequences in the form of a phylogenetic tree. One step in calculating this tree is the computation of a multiple alignment. Most existing approaches treat the two problems of multiple alignment and tree construction as separate while in fact they influence each other. Based on three-way alignments of pre-aligned groups of sequences we adapt a commonly used tree construction procedure to produce both tree and multiple alignment simultaneously. In contrast to existing iterative algorithms the new method can change alignments made early in the course of the computation at a later stage. A sufficient criterion to prevent the introduction of edges with negative length reduces the number of three-way alignments that need to be computed. Applications of the new approach to the alignment of protein and of nucleic acid sequences are presented.
分子进化研究中的一个核心问题是以系统发育树的形式重建一组生物序列的历史。计算这棵树的一个步骤是多重比对的计算。大多数现有方法将多重比对和树构建这两个问题视为相互独立的,而实际上它们相互影响。基于序列预比对组的三元比对,我们采用一种常用的树构建程序,以同时生成树和多重比对。与现有的迭代算法不同,新方法可以在计算后期改变计算早期所做的比对。一个防止引入负长度边的充分标准减少了需要计算的三元比对的数量。本文展示了新方法在蛋白质和核酸序列比对中的应用。