%0 Journal Article %1 journals/algorithmica/BryantS19 %A Bryant, David %A Scornavacca, Céline %D 2019 %J Algorithmica %K dblp %N 9 %P 3692-3706 %T An O(n log n) Time Algorithm for Computing the Path-Length Distance Between Trees. %U http://dblp.uni-trier.de/db/journals/algorithmica/algorithmica81.html#BryantS19 %V 81

@article{journals/algorithmica/BryantS19, added-at = {2019-09-05T00:00:00.000+0200}, author = {Bryant, David and Scornavacca, Céline}, biburl = {https://www.bibsonomy.org/bibtex/2f80b94f5890f73875ba1c77a2821aedd/dblp}, ee = {https://doi.org/10.1007/s00453-019-00594-5}, interhash = {81295f502a4ae8f560381559db02cb59}, intrahash = {f80b94f5890f73875ba1c77a2821aedd}, journal = {Algorithmica}, keywords = {dblp}, number = 9, pages = {3692-3706}, timestamp = {2019-09-06T11:40:21.000+0200}, title = {An O(n log n) Time Algorithm for Computing the Path-Length Distance Between Trees.}, url = {http://dblp.uni-trier.de/db/journals/algorithmica/algorithmica81.html#BryantS19}, volume = 81, year = 2019 }