The Visual TreeCmp application was designed to compute distances between arbitrary phylogenetic trees. Visual TreeCmp is the first implementation of Matching Split/Cluster/Pair metrics and the first efficient and convenient implementation of Nodal Splitted. It allows to compare relatively large trees. Offers an implementation of metrics with better computational efficiency than available tools, allowing to compare trees with a large number of leaves.
The Visual TreeCmp implements twelve metrics that can be calculated in polynomial time for arbitrary (not only bifurcating) trees.
Five metrics for unrooted trees:
Seven metrics for rooted trees
There are four modes of comparing trees available:
We also propose a way to obtain normalized distances between trees, which indicate whether two trees are more dissimilar than two random trees with the same number of leaves according to a given metric. Application allow summarizing for each metric such parameters as: number of compared trees, average value, standard deviation, minimum and the maximum value.
Visual TreeCmp is available in three forms, as: