Matching Split Distance for Unrooted Binary Phylogenetic Trees

Authors:
Damian Bogdanowicz;Krzysztof Giaro
Affiliations:
Gdansk University of Technology, Gdansk;Gdansk University of Technology, Gdansk
Venue:
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Year:
2012

Citing 6
Cited 1

Faster scaling algorithms for network problems

SIAM Journal on Computing
New scaling algorithms for the assignment and minimum mean cycle problems

Mathematical Programming: Series A and B
On distances between phylogenetic trees

SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Nodal Distance Algorithm: Calculating a Phylogenetic Tree Comparison Metric

BIBE '03 Proceedings of the 3rd IEEE Symposium on BioInformatics and BioEngineering
TreeJuxtaposer: scalable tree comparison using Focus+Context with guaranteed visibility

ACM SIGGRAPH 2003 Papers
A congruence index for testing topological similarity between trees

Bioinformatics

A Metric for Phylogenetic Trees Based on Matching

IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.