@inproceedings{37bbce6ccf2745d2828b42e4b9ae5d2f,
title = "Pattern matching in unordered trees (Extended Abstract)",
abstract = "We consider the problem of comparison between tmordered trees, i.e., trees for which the order among siblings is unimportant. The criterion for comparison is the distance as measured by a weighted sum of the costs of deletion, insertion and relabel operations on tree nodes. Such comparisons may contribute to pattern recognition efforts in any field (e.g., genetics) where data can naturally be characterized by unordered trees. We first observe that the problem is NP-complete. Then we present an enumerative algorithm and several heuristics leading to approximate solutions. The algorithms are based on probabilistic hill climbing and bipartite matching techniques. The paper evaluates the accuracy and time efficiency of the heuristics by applying them to a set of trees transformed from industrial parts based on a previously proposed morphological model.",
author = "D. Shasha and Wang, {J. T.L.} and K. Zhang and Shih, {F. Y.}",
note = "Publisher Copyright: {\textcopyright} 1992 IEEE.; 4th International Conference on Tools with Artificial Intelligence, ICTAI 1992 ; Conference date: 10-11-1992 Through 13-11-1992",
year = "1992",
doi = "10.1109/TAI.1992.246429",
language = "English (US)",
series = "Proceedings - International Conference on Tools with Artificial Intelligence, ICTAI",
publisher = "IEEE Computer Society",
pages = "352--361",
booktitle = "4th International Conference on Tools with Artificial Intelligence, ICTAI 1992",
address = "United States",
}