
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
B.j. Oommen, K. Zhang, W. Lee, "Numerical Similarity and Dissimilarity Measures Between Two Trees," IEEE Transactions on Computers, vol. 45, no. 12, pp. 14261434, December, 1996.  
BibTex  x  
@article{ 10.1109/12.545972, author = {B.j. Oommen and K. Zhang and W. Lee}, title = {Numerical Similarity and Dissimilarity Measures Between Two Trees}, journal ={IEEE Transactions on Computers}, volume = {45}, number = {12}, issn = {00189340}, year = {1996}, pages = {14261434}, doi = {http://doi.ieeecomputersociety.org/10.1109/12.545972}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Computers TI  Numerical Similarity and Dissimilarity Measures Between Two Trees IS  12 SN  00189340 SP1426 EP1434 EPD  14261434 A1  B.j. Oommen, A1  K. Zhang, A1  W. Lee, PY  1996 KW  Tree comparison metrics KW  tree comparison algorithms KW  algorithms for structure comparison KW  generic strategies for tree comparisons. VL  45 JA  IEEE Transactions on Computers ER   
Abstract—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, Ω(T_{1}, T_{2}), between two trees T_{1} and T_{2} presented in terms of a set of elementary intersymbol measures ω(., .) and two abstract operators
[1] A.V. Aho,J.E. Hopcroft, and J.D. Ullman,The Design and Analysis of Computer Algorithms.Reading, Mass.: AddisonWesley, 1974.
[2] A.V. Aho, D.S. Hirschberg, and J.D. Ullman, "Bounds on the Complexity of the Longest Common Subsequence Problem," J. ACM, vol. 23, pp. 112, Jan. 1976.
[3] C.N. Albegra, "String Similarity and Misspellings," Comm. ACM, vol. 10, pp. 302313, May 1967.
[4] Y.C. Cheng and S.Y. Lu, "Waveform Correlation by Tree Matching," IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 7, pp. 299305, 1985.
[5] P.A.V. Hall and G.R. Dowling, "Approximate String Matching," Computing Surveys, vol. 12, no. 4, pp. 381402, 1980.
[6] D.S. Hirschberg, "A Linear Space Algorithm for Computing Maximal Common Subsequences," Comm. Assoc. Comput. Mach., vol. 18, pp. 341343, 1975.
[7] D.S. Hirschberg, “Algorithms for the Longest Common Sequence Problem,” J. ACM, vol. 24, no. 4, pp. 664675, Oct. 1977.
[8] D.S. Hirschberg, "An InformationTheoretic Lower Bound for the Longest Common Subsequence Problem," Information Processing Letters, vol. 7, pp. 4041, Jan. 1978.
[9] J.W. Hunt and T.G. Szymanski, “A Fast Algorithm for Computing Longest Common Subsequences,” Comm. ACM, vol. 20, no. 5, pp. 350353, 1977.
[10] R.L. Kashyap and B.J. Oommen, "A Common Basis for Similarity Measures Involving Two Strings," Int'l J. Computer Math., vol. 13, pp. 1740, 1983.
[11] R.L. Kashyap and B.J. Oommen, "The Noisy Substring Matching Problem," IEEE Trans. Software Eng., pp. 365370, May 1983.
[12] R.L. Kashyap and B.J. Oommen, "Spelling Correction Using Probabilistic Methods," Pattern Recognition Letters, vol. 2, pp. 147154, 1984.
[13] M. Kunze and G. Thierrin, "Maximal Common Subsequences of Pairs of Strings," Congressus Numerantium, vol. 34, pp. 299311, 1982.
[14] S.Y. Le, J. Owens, R. Nussinov, J.H. Chen, B. Shapiro, and J.V. Maizel, "RNA Secondary Structures: Comparison and Determination of Frequently Recurring Substructures by Consensus," Computer Applications to Bioscience, vol. 5, pp. 205210, 1989.
[15] R. Lowrance and R.A. Wagner, "An Extension of the StringtoString Correction Problem," J. ACM, vol. 22, pp. 177183, Apr. 1975.
[16] S.Y. Lu, "A TreetoTree Distance and Its Application to Cluster Analysis," IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 1, no. 2, pp. 219224, Apr. 1979.
[17] S.Y. Lu, "A TreeMatching Algorithm Based on Node Splitting and Merging," IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 6, no. 2, pp. 249256, 1984.
[18] D. Maier, "The Complexity of Some Problems on Subsequences and Supersequences," J. ACM, vol. 25, pp. 322336, Apr. 1978.
[19] W.J. Masek and M.S. Paterson, "A Faster Algorithm Computing String Edit Distances," J. Computing and Systems Science, vol. 20, pp. 1831, 1980.
[20] B.J. Oommen, “Recognition of Noisy Subsequences Using Constrained Edit Distances,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 9, no. 5, pp. 676685, May 1987.
[21] B.J. Oommen, K. Zhang, and W. Lee, "Numeric Similarity and Dissimilarity Measures Between Two Trees," Technical Report TR203, School of Computer Science, Carleton Univ., Ottawa, Canada.
[22] S.M. Selkow, "The TreetoTree Editing Problem," Information Processing Letters, vol. 6, no. 6, pp. 184186, Dec. 1977.
[23] B.A. Shapiro, "An Algorithm for Comparing Multiple RNA Secondary Structures," Computer Applications in Bioscience, vol. 4, pp. 387393, 1988.
[24] D. Sankoff and J.B. Kruskal, Time Warps, String Edits, and Macromolecules: The Theory and Practice of Sequence Comparison. AddisonWesley, 1983.
[25] B. Shapiro and K. Zhang, "Comparing Multiple RNA Secondary Structures Using Tree Comparisons," Computer Applications in Bioscience, vol. 6, no. 4, pp. 309318, 1990.
[26] KC Tai, "The TreetoTree Correction Problem," J. ACM, vol. 26, no. 3, pp. 422433, 1979.
[27] E. Tanaka and K. Tanaka, "The TreetoTree Editing Problem," Int'l J. Pattern Recognition, vol. 2, no. 2, pp. 221240, 1988.
[28] R.A. Wagner and M.J. Fischer, "The StringtoString Correction Problem," J. ACM, vol. 21, no. 1, pp. 16878, 1974.
[29] K. Zhang and D. Shasha, "Simple Fast Algorithms for the Editing Distance Between Trees and Related Problems," Siam J. Computing, vol. 18, no. 6, pp. 1,2451,262, 1989.