Suppr超能文献

渐进序列比对是构建正确系统发育树的前提条件。

Progressive sequence alignment as a prerequisite to correct phylogenetic trees.

作者信息

Feng D F, Doolittle R F

机构信息

Department of Chemistry, University of California-San Diego, La Jolla 92093.

出版信息

J Mol Evol. 1987;25(4):351-60. doi: 10.1007/BF02603120.

Abstract

A progressive alignment method is described that utilizes the Needleman and Wunsch pairwise alignment algorithm iteratively to achieve the multiple alignment of a set of protein sequences and to construct an evolutionary tree depicting their relationship. The sequences are assumed a priori to share a common ancestor, and the trees are constructed from difference matrices derived directly from the multiple alignment. The thrust of the method involves putting more trust in the comparison of recently diverged sequences than in those evolved in the distant past. In particular, this rule is followed: "once a gap, always a gap." The method has been applied to three sets of protein sequences: 7 superoxide dismutases, 11 globins, and 9 tyrosine kinase-like sequences. Multiple alignments and phylogenetic trees for these sets of sequences were determined and compared with trees derived by conventional pairwise treatments. In several instances, the progressive method led to trees that appeared to be more in line with biological expectations than were trees obtained by more commonly used methods.

摘要

本文描述了一种渐进比对方法,该方法迭代使用Needleman和Wunsch的成对比对算法,以实现一组蛋白质序列的多重比对,并构建描绘它们关系的进化树。序列被预先假定有一个共同的祖先,并且树是由直接从多重比对中导出的差异矩阵构建的。该方法的重点在于,相比于那些在遥远过去进化的序列,更信任最近分化的序列之间的比较。特别是遵循这样一条规则:“一旦出现缺口,永远保持缺口”。该方法已应用于三组蛋白质序列:7种超氧化物歧化酶、11种球蛋白和9种酪氨酸激酶样序列。确定了这些序列集的多重比对和系统发育树,并与通过传统成对处理得到的树进行了比较。在几个实例中,渐进方法得到的树似乎比更常用方法得到的树更符合生物学预期。

文献AI研究员

20分钟写一篇综述,助力文献阅读效率提升50倍。

立即体验

用中文搜PubMed

大模型驱动的PubMed中文搜索引擎

马上搜索

文档翻译

学术文献翻译模型,支持多种主流文档格式。

立即体验