Creat membership Creat membership
Sign in

Forgot password?

Confirm
  • Forgot password?
    Sign Up
  • Confirm
    Sign In
Creat membership Creat membership
Sign in

Forgot password?

Confirm
  • Forgot password?
    Sign Up
  • Confirm
    Sign In
Collection

toTop

If you have any feedback, Please follow the official account to submit feedback.

Turn on your phone and scan

home > search >

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

Author:
Bryant, David  Scornavacca, Celine  


Journal:
ALGORITHMICA


Issue Date:
2019


Abstract(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 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).


Page:
3692---3706


Similar Literature

Submit Feedback

This function is a member function, members do not limit the number of downloads