An O(nlogn) Time Algorithm for Computing the Path-Length Distance Between Trees

Tree comparison metrics have proven to be an invaluable aide in the reconstruction and analysis of phylogenetic (evolutionary) trees. The path-length distance between trees is a particularly attractive measure as it reflects differences in tree shape as well as differences between branch lengths. Th...

Full description

Saved in:
Bibliographic Details
Published in:Algorithmica Vol. 81; no. 9; pp. 3692 - 3706
Main Authors: Bryant, David, Scornavacca, Celine
Format: Journal Article
Language:English
Published: New York Springer US 16.09.2019
Springer Nature B.V
Springer Verlag
Subjects:
Algorithm Analysis and Problem Complexity
Algorithms
Computer Science
Computer Systems Organization and Communication Networks
Data Structures and Algorithms
Data Structures and Information Theory
Discrete Mathematics
Mathematics of Computing
Theory of Computation
Trees
68Q25
92D15
Path-length metric
Tree comparison metrics
05CO5
Tree decomposition
Phylogeny
ISSN:0178-4617, 1432-0541
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Tree comparison metrics have proven to be an invaluable aide in the reconstruction and analysis of phylogenetic (evolutionary) trees. The path-length distance between trees is a particularly attractive measure as it reflects differences in tree shape as well as differences between branch lengths. The distance equals the sum, over all pairs of taxa, of the squared differences between the lengths of the unique path connecting them in each tree. We describe an O ( n log n ) time for computing this distance, making extensive use of tree decomposition techniques introduced by Brodal et al. (Algorithmica 38(2):377–395, 2004 ).
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0178-4617
1432-0541
DOI:10.1007/s00453-019-00594-5