An $$O(n \log n)$$ Time Algorithm for Computing the Path-Length Distance Between Trees
Crossref DOI link: https://doi.org/10.1007/s00453-019-00594-5
Published Online: 2019-06-19
Published Print: 2019-09
Update policy: https://doi.org/10.1007/springer_crossmark_policy
Bryant, David http://orcid.org/0000-0003-1963-5535
Scornavacca, Celine
Text and Data Mining valid from 2019-06-19
Version of Record valid from 2019-06-19
Article History
Received: 10 October 2018
Accepted: 28 May 2019
First Online: 19 June 2019