@inproceedings{9a3e945c40894bca92fe3101700b65e7,
title = "A faster and unifying algorithm for comparing trees",
abstract = "A widely-used method for determining the similarity of two labeled trees is to compute a maximum agreement subtree of the two trees. Previous work on this similarity measure only concerns with the comparison of labeled trees of two special kinds, namely, uniformly labeled trees (i.e., trees with all their nodes labeled by the same symbol) and evolutionary trees (i.e., leaf-labeled trees with distinct symbols for distinct leaves). This paper presents an algorithm for comparing trees that are labeled in an arbitrary manner. In addition to the generalization, our algorithm is faster than the previous algorithms in many cases.",
author = "Kao, {Ming Yang} and Lam, {Tak Wah} and Sung, {Wing Kin} and Ting, {Hing Fung}",
note = "Publisher Copyright: {\textcopyright} Springer-Verlag Berlin Heidelberg 2000.; 11th Annual Symposium on Combinatorial Pattern Matching, CPM 2000 ; Conference date: 21-06-2000 Through 23-06-2000",
year = "2000",
doi = "10.1007/3-540-45123-4_13",
language = "English (US)",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "129--142",
editor = "Raffaele Giancarlo and David Sankoff",
booktitle = "Combinatorial Pattern Matching - 11th Annual Symposium, CPM 2000, Proceedings",
}