Matching Split distance for unrooted binary phylogenetic trees

(By Damian Bogdanowicz and Krzysztof Giaro)


Supplemental Material

During the computation we analyzed 10000 pairs of trees that were chosen at random from among all possible unrooted binary trees with a particular number of leaves (n) under two the most popular models: the uniform model and the Yule model. In the case of the uniform model, an edge is added uniformly and randomly to any edge of the base tree. In this model, all phylogenetic trees have the same probability to be drawn. In the case of the Yule model, an edge is added uniformly and randomly to a pendant edge only, and the corresponding label is uniformly and randomly drawn as well.

A preliminary experimental version of the application MSdist (which is a part of TreeCmp application) for computing the Matching Split distance between unrooted phylogenetic trees can be download as a zip archive: MSdist.zip together with a short manual MSdist_manual.pdf. In order to unpack the file any software supporting zip compression, for example free software 7-zip (http://www.7-zip.org/), can be used. MSdist is a command line tool written in pure Java. Java VM in version at least 1.5 is required to properly run MSdist.

The uniform model

The Yule model

The average value of the MS distance for 10000 pairs of trees under the two considered models

The solid lines show the average values, dashed lines represent double standard deviation intervals (avg±2*sd).