A Memory-Efficient Tree Edit Distance Algorithm

Mateusz Pawlik, Nikolaus Augsten. A Memory-Efficient Tree Edit Distance Algorithm. In Hendrik Decker, Lenka Lhotská, Sebastian Link, Marcus Spies, Roland R. Wagner, editors, Database and Expert Systems Applications - 25th International Conference, DEXA 2014, Munich, Germany, September 1-4, 2014. Proceedings, Part I. Volume 8644 of Lecture Notes in Computer Science, pages 196-210, Springer, 2014. [doi]

@inproceedings{PawlikA14,
  title = {A Memory-Efficient Tree Edit Distance Algorithm},
  author = {Mateusz Pawlik and Nikolaus Augsten},
  year = {2014},
  doi = {10.1007/978-3-319-10073-9_16},
  url = {http://dx.doi.org/10.1007/978-3-319-10073-9_16},
  researchr = {https://researchr.org/publication/PawlikA14},
  cites = {0},
  citedby = {0},
  pages = {196-210},
  booktitle = {Database and Expert Systems Applications - 25th International Conference, DEXA 2014, Munich, Germany, September 1-4, 2014. Proceedings, Part I},
  editor = {Hendrik Decker and Lenka Lhotská and Sebastian Link and Marcus Spies and Roland R. Wagner},
  volume = {8644},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {978-3-319-10072-2},
}