Exact and Approximate Algorithms for Unordered Tree Matching

IEEE Transactions on Systems, Man and Cybernetics

Volumn 24, Issue 4, 1994, Pages 668-678

  Shasha, Dennis ^a   Wang, Jason Tsong Li ^b   Zhang, Kaizhong ^c   Shih, Frank Y ^b  

^a NEW YORK UNIVERSITY   (United States)

^b NEW JERSEY INSTITUTE OF TECHNOLOGY   (United States)

^c UNIVERSITY OF WESTERN ONTARIO   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; DATA REDUCTION; DATA STRUCTURES; HEURISTIC METHODS; MATHEMATICAL MODELS; MATHEMATICAL MORPHOLOGY; PATTERN RECOGNITION; PROBABILITY; TREES (MATHEMATICS);

APPROXIMATE ALGORITHMS; BIPARTITE MATCHING TECHNIQUES; EXACT ALGORITHMS; PROBABILISTIC HILL CLIMBING; UNORDERED TREE MATCHING;

ALGORITHMS;

EID: 0028406997     PISSN: 00189472     EISSN: 21682909     Source Type: Journal    
DOI: 10.1109/21.286387     Document Type: Article

References (39)

1. D. H. Ackley, G. E. Hinton, and T. J. Sejnowski, “A learning algorithm for boltzmann machines,” Cognitive Sci., vol. 9, pp. 147–169, 1985.
2. A. V. Aho, J. E. Hopcroft, and J. D. Ullman, The Design and Analysis of Computer Algorithms. Reading, MA: Addison Wesley, 1974.
3. S. Alluvia, H. Locker-Giladi, S. Koby, O. Ben-Nun, and A. B. Oppenheim, “RNase III stimulates the translations of the c III gene of bacteriophage lambda,” in Proc. Nat. Acad. Sci. U.S.A., 1987, pp. 1–5.
4. C. R. Aragon, D. S. Johnson, L. A. Megeoch, and C. Schevon, “Optimization by simulated annealing: An experimental evaluation,” Unpublished manuscript, Oct. 1984.
5. J. M. Brayer and K. S. Fu, “A note on the k-tail method of tree grammar inference,” IEEE Trans. Syst., Man, Cybern., vol. SMC-5, pp. 409–422, 1975.
6. Y. C. Cheng and S. Y. Lu, “Waveform correlation by tree matching,” IEEE Trans. Pattern Anal. Mach. Intell., vol. PAMI-7, pp. 299–305, May 1985.
7. I. C. Deckman and D. E. Draper, “S4-alpha mRNA translation regulation complex,” Mol. Biol., vol. 196, pp. 323–332, 1987.
8. N. Delihas and J. Anderson, “Generalized structures of 5s ribonsomal RNA’s,” Nucleic Acid Res., vol. 10, pp. 7323, 1982.
9. R. O. Duda and P. E. Hart, Pattern Classification and Scene Analysis. New York: Wiley, 1973.
10. R. W. Ehrich and J. P. Foith, “Representation of random waveforms by relational trees,” IEEE Trans. Comput., vol. C-25, pp. 725–736, 1976.
11. K. S. Fu, Syntactic Pattern Recognition and Applications. Englewood Cliffs, NJ: Prentice-Hall, 1982.
12. K. S. Fu and B. K. Bhargava, “Tree systems for syntactic pattern recognition,” IEEE Trans. Comput., vol. C-22, pp. 1087–1099, Dec. 1973.
13. K. S. Fu and T. L. Booth, “Grammatical inference: Introduction and survey —Part I,” IEEE Trans. Syst., Man, Cybern., vol. SMC-5, pp. 95–111, 1975.
14. Y. E. Ioannidis and Y. C. Kang, “Randomized algorithms for optimizing large join queries,” in Proc. ACM-SIGMOD Int. Conf. Management Data, 1990, pp. 312–321.
15. S. Kirkpatrick, C. D. Gelatt, Jr., and M. P. Vecchi, “Optimization by simulated annealing,” Science, vol. 220, pp. 671–680, May 1983.
16. H. W. Kuhn, “The Hungarian method for the assignment problem,” Naval Res. Logistics Quarterly, vol. 2, pp. 83–97, 1955.
17. S. Y. Lu, “A tree-matching algorithm based on node splitting and merging,” IEEE Trans. Pattern Anal. Machine Intell., vol. PAMI-6, pp. 249–256, Mar. 1984.
18. B. Moayer and K. S. Fu, “A tree system approach for fingerprint pattern recognition,” IEEE Trans. Pattern Anal. Mach. Intell., vol. PAMI-8, pp. 376–387, May 1986.
19. S. Nahar, S. Sahni, and E. Shragowitz, “Simulated annealing and combinatorial optimization,” in Proc. 23rd Design Automation Conf., 1986, pp. 293–299.
20. M. Neff and B. K. Boguraev, “Dictionaries, dictionary grammars and dictionary entry parsing,” in Proc. 27th Annual Meeting Asso. Computational Linguistics, June 1989.
21. C. H. Papadimitriou and K. Steiglitz, Combinatorial Optimization Algorithms and Complexity. Englewood Cliffs, NJ: Prentice-Hall, 1982.
22. F. Romeo and A. Sangiovanni-Vincentelli, “Probabilistic hill climbing algorithms: Properties and applications,” in Proc. 1985 IEEE Conf. on VLSI, 1985, pp. 393–417.
23. F. Romeo, A. Sangiovanni-Vincentelli, and C. Sechen, “Research on simulated annealing at Berkeley,” in Proc. 1984 IEEE Int. Conf. on Computer Design, Oct. 1984, pp. 652–657.
24. H. Samet, “Distance transform for images represented by quadtrees,” IEEE Trans. Pattern Anal. Mach. Intell, vol. PAMI-4, pp. 298–303, May 1982.
25. J. Serra, Image Analysis and Mathematical Morphology. New York: Academic Press, 1982.
26. B. A. Shapiro and K. Zhang, “Comparing multiple RNA secondary structures using tree comparisons,” Comput. Appl. Biosci., vol. 6, pp. 309–318, 1990.
27. D. Shasha, J. T. L. Wang, K. Zhang, and F. Y. Shih, “Exact and approximate algorithms for unordered tree matching,” Tech. Rep. CIS-92-07, 92–07, Dept. Computer and Information Science, New Jersey Institute of Technology, 1992.
28. D. Shasha and K. Zhang, “Fast algorithms for the unit cost editing distance between trees,” J. Algorithms, vol. 11, pp. 581–621, 1990.
29. F. Y. Shih, “Object representation and recognition using mathematical morphology model,” J. Systems Integration, vol. 1, pp. 235–256, Aug. 1991.
30. F. Y. Shih and O. R. Mitchell, “Threshold decomposition of grayscale morphology into binary morphology,” IEEE Trans. Pattern Anal. Mach. Intell., vol. PAMI-11, pp. 31–42, Jan. 1989.
31. K.-C. Tai, “The tree-to-tree correction problem,” J. ACM, vol. 26, pp. 422–433, 1979.
32. R. A. Wagner and M. J. Fischer, “The string-to-string correction problem,” J. ACM, vol. 21, pp. 168–173, Jan. 1974.
33. J. T. L. Wang, K. Zhang, K. Jeong, and D. Shasha, “A tool for tree pattern matching,” in Proc. 3rd IEEE Int. Conf. Tools for Artificial Intelligence, San Jose, CA, Nov. 1991, pp. 436-444.
34. J. T. L. Wang, K. Zhang, K. Jeong, and D. Shasha, “A system for approximate tree matching,” to appear in IEEE Trans. Knowledge Data Eng., 1994.
35. P. H. Winston, Artificial Intelligence. Reading, MA: Addison-Wesley, 1984.
36. K. Zhang and D. Shasha, “Simple fast algorithms for the editing distance between trees and related problems,” SIAM J. Comput., vol. 18, pp. 1245–1262, Dec. 1989.
37. K. Zhang, D. Shasha, and J. T. L. Wang, “Fast serial and parallel algorithms for approximate tree matching with VLDC’s,” in Proc. 3rd Annual Symp. Combinatorial Pattern Matching, Tucson, Arizona, April 1992, pp. 148–158.
38. K. Zhang, D. Shasha, and J. T. L. Wang, “Approximate tree matching in the presence of variable length don't cares,” J. Algorithms, vol. 16, pp. 33–66, 1994.
39. K. Zhang, R. Statman, and D. Shasha, “On the editing distance between unordered labeled trees,” Information Processing Letters, vol. 42, pp. 133–139, 1992.