A Tree-Matching Algorithm Based on Node Splitting and Merging

IEEE Transactions on Pattern Analysis and Machine Intelligence

Volumn PAMI-6, Issue 2, 1984, Pages 249-256

  Lu, S Y ^a  

^a EXXONMOBIL UPSTREAM RESEARCH COMPANY   (United States)

Author keywords

Distance; divide and conquer; node merging; node splitting; pattern correlation; tree matching

Indexed keywords

COMPUTER PROGRAMMING - ALGORITHMS;

PATTERN RECOGNITION;

EID: 0021386438     PISSN: 01628828     EISSN: None     Source Type: Journal    
DOI: 10.1109/TPAMI.1984.4767511     Document Type: Article

References (12)

1. S. Y. Lu, “A tree-to-tree distance and its application to cluster analysis,” IEEE Trans. Pattern Anal. Machine Intell., vol. PAMI-1, Apr. 1979.
2. K. C. Tai, “The tree-to-tree correction problem,” J. Ass. Comput. Mach., vol. 26, July 1979.
3. K. S. Fu and S. Y. Lu, “A sentence-to-sentence clustering procedure for pattern analysis,” IEEE Trans. Syst., Man, Cybern., vol. SMC-8, May 1978.
4. L. G. Shapiro and R. M. Haralick, “Algorithms for inexact matching,” in Proc. 5th Int. Conf. Pattern Recognition, Miami Beach, FL, Dec. 1–4, 1980.
5. J. K. Cheng and T. S. Huang “A subgraph isomorphism algorithm using resolution,” Pattern Recognition, vol. 13, pp. 371–379, 1981.
6. L. R. Bah and F. Jelinek, “Decoding for channels with insertions, deletions, and substitutions with applications to speech recognition,” IEEE Trans. Inform. Theory, vol. IT-21, July 1975.
7. S. Y. Lu, “A string-to-string correlation algorithm for image skeletonization,” in Proc. 6th Int. Conf. Pattern Recognition, Munich, Oct. 19–22, 1982, pp. 178–190.
8. S. L. Horowitz, “A syntactic algorithm for peak detection in waveforms with application to cardiograph,” Commun. Ass. Comput. Mach., vol. 18, May 1975.
9. R. A. Wagner and M. J. Fisher “The string-to-string correction problem,” J. Ass. Comput. Mach., vol. 21, pp. 168–173, 1974.
10. D. E. Knuth, The Art of Computer Programming, vol. 1. Reading, MA: Addison-Wesley, 1967.
11. A. V. Aho, J. E. Hopcroft, and J. D. Ullman, The Design and Analysis of Computer Algorithms. Reading, MA: Addison-Wesley, Wesley, 1974.
12. R. W. Ehrich and J. P. Foith “Representation of random waveforms by relational trees,” IEEE Trans. Comput., vol. C-25, pp. 725–736, 1976.