摘要 : Quantifying the measure of similarity between two trees is a problem of intrinsic importance in the study of algorithms and data structures and has applications in computational molecular biology, structural/syntactic pattern reco... 展开 Quantifying the measure of similarity between two trees is a problem of intrinsic importance in the study of algorithms and data structures and has applications in computational molecular biology, structural/syntactic pattern recognition and in data management. In this paper we define and formulate an abstract measure of comparison, /spl Omega/(T/sub 1/, T/sub 2/), between two trees T/sub 1/ and T/sub 2/ presented in terms of a set of elementary intersymbol measures /spl omega/(.,.) and two abstract operators /spl oplus/ and /spl otimes/. By appropriately choosing the concrete values for these two operators and for /spl omega/(.,.), this measure can be used to define various quantities including: (1) the edit distance between two trees, (2) the size of their largest common subtree, (3) Prob(T/sub 2/|T/sub 1/), the probability of receiving T/sub 2/ given that T/sub 1/ was transmitted across a channel causing independent substitution and deletion errors, and (4) the a posteriori probability of T/sub 1/ being the transmitted tree given that T/sub 2/ is the received tree containing independent substitution, insertion and deletion errors. The recursive properties of /spl Omega/(T/sub 1/, T/sub 2/) have been derived and a single generic iterative dynamic programming scheme to compute all the above quantities has been developed. The time and space complexities of the algorithm have been analyzed and the implications of our results in both theoretical and applied fields has been discussed. 收起