Split decomposition

Any data set can be partitioned into sets   (not necessarily of equal size) of sequences or ‘splits’. A network can be   built by taking in turn those splits defined by the characters and combining   them successively. Each split will define a branch connecting the two   partitions delimited by the split. When splits are incompatible (i.e. they   define contradictory groupings) a loop is introduced to indicate that there   are alternative splits. The split decomposition method is fast, which means   that a reasonable number of haplotypes (>50) can be analyzed; that it can   be applied to nucleotide or protein data; and that it allows for the   inclusion of models of nucleotide substitution or amino acid replacement. The   method is suitable also to bootstrap evaluation.

分割分解

任何数据集都可以分割成更小的数据集（大小不一定相等）或“分割”。反过来，可以通过这些由具体特征定义的“分割”迭代组合成网络。每次拆分将定义一次分支，连接由拆分分隔的两个分区。当拆分不兼容（即它们定义了相互矛盾的分组）时，将引入一个循环来指示存在可选拆分。分割分解法快速，这意味着可以分析相当多的单倍型（>50）；它可以应用于核苷酸或蛋白质数据；允许包含核苷酸替代或氨基酸替代模型。该方法也适用于自举检验。