This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Matching Split Distance for Unrooted Binary Phylogenetic Trees
PrePrint
ISSN: 1545-5963
ASCII Text
x 
 
Damian Bogdanowicz, Krzysztof Giaro, "Matching Split Distance for Unrooted Binary Phylogenetic Trees," IEEE/ACM Transactions on Computational Biology and Bioinformatics, vol. 99, no. 1, pp. , , 5555.
 
 
BibTex
x
 
@article{ 10.1109/TCBB.2011.38,
author = {Damian Bogdanowicz and Krzysztof Giaro},
title = {Matching Split Distance for Unrooted Binary Phylogenetic Trees},
journal ={IEEE/ACM Transactions on Computational Biology and Bioinformatics},
volume = {99},
number = {1},
issn = {1545-5963},
year = {5555},
doi = {http://doi.ieeecomputersociety.org/10.1109/TCBB.2011.38},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - JOUR
JO - IEEE/ACM Transactions on Computational Biology and Bioinformatics
TI - Matching Split Distance for Unrooted Binary Phylogenetic Trees
IS - 1
SN - 1545-5963
SP
EP
EPD -
A1 - Damian Bogdanowicz,
A1 - Krzysztof Giaro,
PY - 5555
KW - Graph algorithms
KW - Trees
KW - Applications
KW - Biology and genetics
KW - phylogenetic trees
KW - phylogenetic tree comparison
KW - phylogenetic tree metric
KW - phylogenetic tree distance
VL - 99
JA - IEEE/ACM Transactions on Computational Biology and Bioinformatics
ER -
 
Damian Bogdanowicz, Gdansk University of Technology, Gdansk
Krzysztof Giaro, Gdansk University of Technology, Gdansk
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.
Index Terms:
Graph algorithms, Trees, Applications, Biology and genetics, phylogenetic trees, phylogenetic tree comparison, phylogenetic tree metric, phylogenetic tree distance
Citation:
Damian Bogdanowicz, Krzysztof Giaro, "Matching Split Distance for Unrooted Binary Phylogenetic Trees," IEEE/ACM Transactions on Computational Biology and Bioinformatics, 17 Feb. 2011. IEEE computer Society Digital Library. IEEE Computer Society, <http://doi.ieeecomputersociety.org/10.1109/TCBB.2011.38>
Usage of this product signifies your acceptance of the Terms of Use.