An O ( n log n ) Time Algorithm for Computing the Path-Length Distance Between Trees - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Algorithmica Année : 2019

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

Résumé

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(nlog n) time for computing this distance, making extensive use of tree decomposition techniques introduced by Brodal et al. [2].
Fichier principal
Vignette du fichier
Scornavacca_12.pdf (211.19 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-02163060 , version 1 (18-12-2019)

Identifiants

Citer

David Bryant, Celine Scornavacca. An O ( n log n ) Time Algorithm for Computing the Path-Length Distance Between Trees. Algorithmica, 2019, 81 (9), pp.3692-3706. ⟨10.1007/s00453-019-00594-5⟩. ⟨hal-02163060⟩
138 Consultations
111 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More