Median-joining networks

The median-joining network method begins   by combining the MINIMUM-SPANNING TREES (MSTs) within a single network. With   a parsimony criterion, median vectors (which represent MISSING INTERMEDIATES)   are added to the network. Median-joining networks can handle large data sets   and multistate characters. It is an exceptionally fast method that can   analyze thousands of haplotypes in a reasonable amount of time and can also be   applied to amino acid sequences. However, it requires the absence of   recombination, which restricts the application of this method at the population   level.

中间连接网

中间连接网络方法首先将最小生成树（MST）组合到单个网络中。用简约的标准，中值向量（代表缺失的中间物）被添加到网络中。中间连接网络可以处理大数据集和多状态字符。这是一种非常快速的方法，可以在合理的时间内分析数千个单倍型，也可以应用于氨基酸序列。然而，它要求不存在重组，这限制了该方法在群体层面的应用。