Abstract
Given two ordered, labeled trees β and α, to find the distance from tree β to tree α is an important problem in many fields, for example, the pattern recognition field. In this paper, a VLSI algorithm for calculating the tree to tree distance is presented. The computation structure of the algorithm is a 2-D Mesh with the sizem*n and the time isO(m+n), wherem,n are the numbers of nodes of the tree β and tree α, respectively.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Kuo-chung Tai, The tree-to-tree correction problem.J. Asso. Comput. Mach., 1979, 26, 422–433.
K. S. Fu, Pattern Recognition and Its Application. Science Press, China, 1983.
Kaizhong Zhang and Dennis Shasha. Simple fast algorithm for the editing distance between trees and related problems.SIAM. J. Comput., 1989, 18, 1245–1262.
H. T. Kung, Why systolic architectures?IEEE Computer, 1982, 15 (1), 37–46.
Sun-yuan Kunget al., Wavefront array processor: Language, architecture, and application.IEEE Trans. Comput., 1982, 11, 1054–1066.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Xu, M., Liu, X. A VLSI algorithm for calculating the tree to tree distance. J. of Comput. Sci. & Technol. 8, 68–76 (1993). https://doi.org/10.1007/BF02946587
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF02946587