"An O(n log n) Time Algorithm for Computing the Path-Length Distance ..."

David Bryant, Céline Scornavacca (2019)

> Home

Details and statistics

DOI: 10.1007/S00453-019-00594-5

access: closed

type: Journal Article

metadata version: 2019-09-05

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/algorithmica/BryantS19
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/algorithmica/BryantS19
David Bryant, Céline Scornavacca:
An O(n log n) Time Algorithm for Computing the Path-Length Distance Between Trees. Algorithmica 81(9): 3692-3706 (2019)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.