SplitsTree4 is the leading application   for computing unrooted phylogenetic networks from molecular sequence data.   Given an alignment of sequences, a distance matrix or a set of trees, the   program will compute a phylogenetic tree or network using methods such as   split decomposition, neighbor-net, consensus network, super networks methods   or methods for computing hybridization or simple recombination networks.

SplitsTree4 is an all-new implementation   of the SplitsTree3 software written in Java. Superficially, this new program   is similar to previous versions of this software. However, there are   substantial differences. The new program has many new features, see the   manual for details.

If you use SplitsTree in work in any way,   then please cite the following paper: D. H. Huson and D. Bryant, Application   of Phylogenetic Networks in Evolutionary Studies, Mol. Biol. Evol.,   23(2):254-267, 2006.

SplitsTree4是从分子序列数据计算无根系统发育网络的主要应用。给定比对好的序列、距离矩阵或一组树，程序将使用分裂分解、邻域网络、共识网络、超级网络方法或计算杂交或简单重组网络的方法运算系统树或网络。

SplitsTree4是用Java对SplitsTree3重新编写的全新应用。从表面上看，这个新程序与以前版本类似。然而，两者之间存在着实质性的差异。新程序有许多新功能，有关详细信息，请参阅使用手册。

如果您在工作中以任何方式使用SplitsTree，请引用以下文献：D. H.   Huson and D. Bryant, Application of Phylogenetic Networks in Evolutionary   Studies, Mol. Biol. Evol., 23(2):254-267, 2006.