CSDL Home IEEE/ACM Transactions on Computational Biology and Bioinformatics 2012 vol.9 Issue No.01 - January/February
Issue No.01 - January/February (2012 vol.9)
D. Bogdanowicz , Dept. of Algorithms & Syst. Modeling, Gdansk Univ. of Technol., Gdansk, Poland
K. Giaro , Dept. of Algorithms & Syst. Modeling, Gdansk Univ. of Technol., Gdansk, Poland
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TCBB.2011.48
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 this paper, we propose a new method of defining distances between unrooted binary phylogenetic trees that is especially useful for relatively large phylogenetic trees. Next, we investigate in detail the properties of one example of these metrics, called the Matching Split distance, and describe how the general method can be extended to nonbinary trees.
Measurement, Phylogeny, Bipartite graph, Artificial neural networks, Radio frequency, Bioinformatics, Computational biology,matching split distance., Phylogenetic tree, phylogenetic tree metric, phylogenetic tree comparison, splits, minimum-weight perfect matching
D. Bogdanowicz, K. Giaro, "Matching Split Distance for Unrooted Binary Phylogenetic Trees", IEEE/ACM Transactions on Computational Biology and Bioinformatics, vol.9, no. 1, pp. 150-160, January/February 2012, doi:10.1109/TCBB.2011.48