A Faster and Unifying Algorithm for Comparing Trees

Authors:
Ming-Yang Kao;Tak Wah Lam;Wing-Kin Sung;Hing-Fung Ting
Affiliations:
-;-;-;-
Venue:
COM '00 Proceedings of the 11th Annual Symposium on Combinatorial Pattern Matching
Year:
2000

Citing 15
Cited 0

O(n2.5) time algorithms for the subgraph homeomorphism problem on trees

Journal of Algorithms
Threshold Decomposition of Gray-Scale Morphology into Binary Morphology

IEEE Transactions on Pattern Analysis and Machine Intelligence
Faster scaling algorithms for network problems

SIAM Journal on Computing
Introduction to algorithms

Introduction to algorithms
On query languages for the P-string data model

Information modelling and knowledge bases
Retrieval from hierarchical texts by partial patterns

SIGIR '93 Proceedings of the 16th annual international ACM SIGIR conference on Research and development in information retrieval
Kaikoura tree theorems: computing the maximum agreement subtree

Information Processing Letters
Shapes, shocks, and deformations I: the components of two-dimensional shape and the reaction-diffusion space

International Journal of Computer Vision
Sparse Dynamic Programming for Evolutionary-Tree Comparison

SIAM Journal on Computing
Tree Contractions and Evolutionary Trees

SIAM Journal on Computing
An O(n log n) algorithm for the maximum agreement subtree problem for binary trees

Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
All-Cavity Maximum Matchings

ISAAC '97 Proceedings of the 8th International Symposium on Algorithms and Computation
Grammatical Tree Matching

CPM '92 Proceedings of the Third Annual Symposium on Combinatorial Pattern Matching
Computing the Agreement of Trees with Bounded Degrees

ESA '95 Proceedings of the Third Annual European Symposium on Algorithms
A Decomposition Theorem for Maximum Weight Bipartite Matchings with Applications to Evolutionary Trees

ESA '99 Proceedings of the 7th Annual European Symposium on Algorithms

Quantified Score

Hi-index	0.00

Visualization

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.