Schmidt Heiko A, von Haeseler Arndt
Center for Integrative Bioinformatics Vienna, Max F. Perutz Laboratories, Vienna, Austria.
Curr Protoc Bioinformatics. 2007 Mar;Chapter 6:Unit 6.6. doi: 10.1002/0471250953.bi0606s17.
TREE-PUZZLE provides a means to analyze and reconstruct evolutionary relationships and trees based on quartets, i.e., groups of four sequences. Basic Protocol 1 explains how to reconstruct trees based on the maximum-likelihood principle and quartet puzzling. Basic Protocol 2 discusses likelihood mapping, a method to visualize phylogenetic content in a multiple sequence alignment. Basic Protocol 3 explains how to compare tree topologies using different tests.
TREE-PUZZLE提供了一种基于四重奏（即四个序列的组）来分析和重建进化关系及树的方法。基本方案1解释了如何基于最大似然原理和四重奏困惑来重建树。基本方案2讨论了似然性映射，这是一种在多序列比对中可视化系统发育内容的方法。基本方案3解释了如何使用不同的测试来比较树的拓扑结构。
