@article{DBLP:journals/talg/DemaineMRW09,
  author    = {Erik D. Demaine and
               Shay Mozes and
               Benjamin Rossman and
               Oren Weimann},
  title     = {An optimal decomposition algorithm for tree edit distance},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {6},
  number    = {1},
  pages     = {2:1--2:19},
  year      = {2009},
  url       = {https://doi.org/10.1145/1644015.1644017},
  doi       = {10.1145/1644015.1644017},
  timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/talg/DemaineMRW09.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}

{"_id":"vHqimer55DmCkZTMc","bibbaseid":"demaine-mozes-rossman-weimann-anoptimaldecompositionalgorithmfortreeeditdistance-2009","downloads":0,"creationDate":"2015-06-13T03:01:21.915Z","title":"An optimal decomposition algorithm for tree edit distance","author_short":["Demaine, E. D.","Mozes, S.","Rossman, B.","Weimann, O."],"year":2009,"bibtype":"article","biburl":"https://dblp.org/pid/93/2346.bib","bibdata":{"bibtype":"article","type":"article","author":[{"firstnames":["Erik","D."],"propositions":[],"lastnames":["Demaine"],"suffixes":[]},{"firstnames":["Shay"],"propositions":[],"lastnames":["Mozes"],"suffixes":[]},{"firstnames":["Benjamin"],"propositions":[],"lastnames":["Rossman"],"suffixes":[]},{"firstnames":["Oren"],"propositions":[],"lastnames":["Weimann"],"suffixes":[]}],"title":"An optimal decomposition algorithm for tree edit distance","journal":"ACM Trans. Algorithms","volume":"6","number":"1","pages":"2:1–2:19","year":"2009","url":"https://doi.org/10.1145/1644015.1644017","doi":"10.1145/1644015.1644017","timestamp":"Sun, 02 Jun 2019 01:00:00 +0200","biburl":"https://dblp.org/rec/journals/talg/DemaineMRW09.bib","bibsource":"dblp computer science bibliography, https://dblp.org","bibtex":"@article{DBLP:journals/talg/DemaineMRW09,\n author = {Erik D. Demaine and\n Shay Mozes and\n Benjamin Rossman and\n Oren Weimann},\n title = {An optimal decomposition algorithm for tree edit distance},\n journal = {{ACM} Trans. Algorithms},\n volume = {6},\n number = {1},\n pages = {2:1--2:19},\n year = {2009},\n url = {https://doi.org/10.1145/1644015.1644017},\n doi = {10.1145/1644015.1644017},\n timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},\n biburl = {https://dblp.org/rec/journals/talg/DemaineMRW09.bib},\n bibsource = {dblp computer science bibliography, https://dblp.org}\n}\n\n","author_short":["Demaine, E. D.","Mozes, S.","Rossman, B.","Weimann, O."],"key":"DBLP:journals/talg/DemaineMRW09","id":"DBLP:journals/talg/DemaineMRW09","bibbaseid":"demaine-mozes-rossman-weimann-anoptimaldecompositionalgorithmfortreeeditdistance-2009","role":"author","urls":{"Paper":"https://doi.org/10.1145/1644015.1644017"},"metadata":{"authorlinks":{}}},"search_terms":["optimal","decomposition","algorithm","tree","edit","distance","demaine","mozes","rossman","weimann"],"keywords":[],"authorIDs":["557ac9564e99777d36000593"],"dataSources":["sbkREmouf8DYYKikN","gzaiqt38X7DKLvHXK"]}