Exact and Approximate Algorithms for Unordered ' H E Matching

We consider the problem of comparison between unordered 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. In companion work, we have shown this problem to be NP-complete. This paper presents an efflcient 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.

[1]  Kaizhong Zhang,et al.  A System for Approximate Tree Matching , 1994, IEEE Trans. Knowl. Data Eng..

[2]  Kaizhong Zhang,et al.  On the Editing Distance Between Unordered Labeled Trees , 1992, Inf. Process. Lett..

[3]  Kaizhong Zhang,et al.  Fast Serial and Parallel Algorithms for Approximate Tree Matching with VLDC's , 1992, CPM.

[4]  Kaizhong Zhang,et al.  Fast Algorithms for the Unit Cost Editing Distance Between Trees , 1990, J. Algorithms.

[5]  Kaizhong Zhang,et al.  Comparing multiple RNA secondary structures using tree comparisons , 1990, Comput. Appl. Biosci..

[6]  Yannis E. Ioannidis,et al.  Randomized algorithms for optimizing large join queries , 1990, SIGMOD '90.

[7]  Kaizhong Zhang,et al.  Simple Fast Algorithms for the Editing Distance Between Trees and Related Problems , 1989, SIAM J. Comput..

[8]  Cecilia R. Aragon,et al.  Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning , 1989, Oper. Res..

[9]  Branimir Boguraev,et al.  Dictionaries, Dictionary Grammars and Dictionary Entry Parsing , 1989, ACL.

[10]  S. Altuvia,et al.  RNase III stimulates the translation of the cIII gene of bacteriophage lambda. , 1987, Proceedings of the National Academy of Sciences of the United States of America.

[11]  D. Draper,et al.  S4-alpha mRNA translation regulation complex. II. Secondary structures of the RNA regulatory site in the presence and absence of S4. , 1987, Journal of molecular biology.

[12]  Sartaj Sahni,et al.  Simulated Annealing and Combinatorial Optimization , 1986, 23rd ACM/IEEE Design Automation Conference.

[13]  Taylor L. Booth,et al.  Grammatical Inference: Introduction and Survey-Part I , 1986, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[14]  Shin-Yee Lu,et al.  Waveform Correlation by Tree Matching , 1985, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[15]  S. Y. Lu,et al.  A Tree-Matching Algorithm Based on Node Splitting and Merging , 1984, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[16]  O. Firschein,et al.  Syntactic pattern recognition and applications , 1983, Proceedings of the IEEE.

[17]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.

[18]  Hanan Samet,et al.  Distance Transform for Images Represented by Quadtrees , 1982, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[19]  Kuo-Chung Tai,et al.  The Tree-to-Tree Correction Problem , 1979, JACM.

[20]  Roger W. Ehrich,et al.  Representation of Random Waveforms by Relational Trees , 1976, IEEE Transactions on Computers.

[21]  King-Sun Fu,et al.  A Tree System Approach for Fingerprint Pattern Recognition , 1976, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[22]  Richard O. Duda,et al.  Pattern classification and scene analysis , 1974, A Wiley-Interscience publication.

[23]  Bharat K. Bhargava,et al.  Tree Systems for Syntactic Pattern Recognition , 1973, IEEE Transactions on Computers.

[24]  Kaizhong Zhang,et al.  Approximate Tree Matching in the Presence of Variable Length Don't Cares , 1994, J. Algorithms.

[25]  Frank Y. Shih,et al.  Threshold Decomposition of Gray-Scale Morphology into Binary Morphology , 1989, IEEE Trans. Pattern Anal. Mach. Intell..

[26]  Geoffrey E. Hinton,et al.  A Learning Algorithm for Boltzmann Machines , 1985, Cogn. Sci..

[27]  Jean Serra,et al.  Image Analysis and Mathematical Morphology , 1983 .

[28]  J. Brayer,et al.  A note on the k-tail method of tree grammar inference , 1975 .

[29]  Alfred V. Aho,et al.  The Design and Analysis of Computer Algorithms , 1974 .

[30]  Michael J. Fischer,et al.  The String-to-String Correction Problem , 1974, JACM.