Damian Bogdanowicz , Gdansk University of Technology, Gdansk
Krzysztof Giaro , Gdansk University of Technology, Gdansk
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TCBB.2011.38
The reconstruction of evolutionary trees is one of the primary objectives in phylogenetics. Such a tree represents the historical evolutionary relationship between different species or organisms. Tree comparisons are used for multiple purposes, from unveiling the history of species to deciphering evolutionary associations among organisms and geographical areas. In the paper we propose a new method of defining distances between unrooted binary phylogenetic trees that is especially applicable to relatively large phylogenetic trees. Next, we investigate in details properties of one example of these metrics called Matching Split distance.
Graph algorithms, Trees, Applications, Biology and genetics, phylogenetic trees, phylogenetic tree comparison, phylogenetic tree metric, phylogenetic tree distance
Damian Bogdanowicz, Krzysztof Giaro, "Matching Split Distance for Unrooted Binary Phylogenetic Trees", IEEE/ACM Transactions on Computational Biology and Bioinformatics, , no. 1, pp. , PrePrints PrePrints, doi:10.1109/TCBB.2011.38