Cart (Loading....) | Create Account
Close category search window
 

Numerical similarity and dissimilarity measures between two trees

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Oommen, B.J. ; Sch. of Comput. Sci., Carleton Univ., Ottawa, Ont., Canada ; Zhang, K. ; Lee, W.

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, Ω(T1, T2), between two trees T1 and T2 presented in terms of a set of elementary intersymbol measures ω(.,.) and two abstract operators ⊕ and ⊗. By appropriately choosing the concrete values for these two operators and for ω(.,.), 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(T2|T1 ), the probability of receiving T2 given that T1 was transmitted across a channel causing independent substitution and deletion errors, and (4) the a posteriori probability of T1 being the transmitted tree given that T2 is the received tree containing independent substitution, insertion and deletion errors. The recursive properties of Ω(T1, T 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

Published in:

Computers, IEEE Transactions on  (Volume:45 ,  Issue: 12 )

Date of Publication:

Dec 1996

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.