
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
E. Tanaka, "A Metric Between Unrooted and Unordered Trees and its BottomUp Computing Method," IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 16, no. 12, pp. 12331238, December, 1994.  
BibTex  x  
@article{ 10.1109/34.387483, author = {E. Tanaka}, title = {A Metric Between Unrooted and Unordered Trees and its BottomUp Computing Method}, journal ={IEEE Transactions on Pattern Analysis and Machine Intelligence}, volume = {16}, number = {12}, issn = {01628828}, year = {1994}, pages = {12331238}, doi = {http://doi.ieeecomputersociety.org/10.1109/34.387483}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Pattern Analysis and Machine Intelligence TI  A Metric Between Unrooted and Unordered Trees and its BottomUp Computing Method IS  12 SN  01628828 SP1233 EP1238 EPD  12331238 A1  E. Tanaka, PY  1994 KW  trees (mathematics); computational complexity; dynamic programming; pattern matching; distance metric; unrooted trees; unordered trees; bottomup computing method; strongly structurepreserving mapping; vertex correspondences; similar substructures; time complexity; maximum degrees; space complexity; dynamic programming; pattern matching; pattern recognition; similar structure search; similarity VL  16 JA  IEEE Transactions on Pattern Analysis and Machine Intelligence ER   
Proposes a distance measure between unrooted and unordered trees based on the strongly structurepreserving mapping (SSPM). SSPM can make correspondences between the vertices of similar substructures of given structures more strictly than previously proposed mappings. The time complexity of computing the distance between trees T/sub a/ and T/sub b/ is O(m/sub bsup 3/N/sub a/N/sub b/), where N/sub a/ and N/sub b/ are the number of vertices in trees T/sub a/ and T/sub b/, respectively; m/sub a/ and m/sub b/ are the maximum degrees of a vertex in T/sub a/ and T/sub b/, respectively; and m/sub aspl les/m/sub b/ is assumed. The space complexity of the method is O(N/sub a/N/sub b/).
[1] S. M. Selkow, "Treetotree editing problem,"Inf. Process. Lett., vol. 6, pp. 184186, 1977.
[2] K. C. Tai, "The treetotree correcting problem,"J. ACM, vol. 26, pp. 422433, 1979.
[3] S. Y. Lu, "A treeto tree distance and its application to cluster analysis,"IEEE Trans. Pattern Anal. Machine Intell., vol. PAMII, pp. 219224, 1979.
[4] (a) E. Tanaka and K. Tanaka, "A metric on trees and its computing method,"Trans. IECE, vol. J65D, pp. 511518, 1982. (b) Correction to "A metric on trees and its computing method,"Trans. IEICE, vol. J76DI, p. 635, 1993.
[5] D. Shasha and K. Zhang, "Fast algorithms for the unit cost editing distance between trees,"J. Algorithms, vol. 11, pp. 581621, 1990.
[6] S. Y. Lu, "A treematching algorithm based on node splitting and merging,"IEEE Trans. Pattern Anal. Machine Intell., vol, PAMI 6, pp. 249256, 1984.
[7] K. Zhang, R. Statman, and S. Shasha, "On the editing distance between unordered labeled trees,"Inf. Process. Lett., vol. 42, pp. 133139, 1992.
[8] W. H. Tsai and K. S. Fu, "Errorcorrecting isomorphisms of attributed relational graphs for pattern analysis,"IEEE Trans. Syst., Man, Cybern., vol. SMC12, pp. 757768, 1979.
[9] L. G. Shapiro and R. M. Haralick, "Structural descriptions and inexact matching,"IEEE Trans. Pattern Anal. Machine Intell., vol. 3, pp. 504519, 1981.
[10] A. K. Wong, M. You, and S. C. Chang, "An algorithm for graph optimal monomorphism,"IEEE Trans. Syst., Man, Cybern., vol. 20, pp. 628639, 1990.
[11] P. Willett,Similarity and Clustering in Chemical Information Systems, Research Studies Press, 1987.
[12] M. A. Johnson, "A review and examination of the mathematical spaces underlying molecurlar similarity analysis,"J. Math. Chem., vol. 3, pp. 117145, 1989.
[13] E. Sussenguth, "A graphtheoretic algorithm for matching chemical structures,"J. Chem. Doc., vol. 5, pp. 3644, 1965.
[14] Y. Takahashi, Y. Satoh, H. Suzuki, and S. Sasaki, "Recongition of largest common structural fragment among a variety of chemical structures,"Analytical Sciences, vol. 3, pp. 2328, 1987.
[15] M. G. Hicks and C. Jochum, "Substructure search system. 1. Performance comparison of the MACCS, DARC, HTSS, CAS registry MVSSS, and S4 substructure search systems,"J. Chem. Inf. Comput. Sci., vol. 30, pp. 191199, 1990.
[16] E. Tanaka, "The metric between trees based on the strongly structure preserving mapping and its computing method,"Trans. IECE, vol. J67D, pp. 722723, 1984.
[17] E. L. Lawler,Combinatorial Optimization Networks and Matriods. New York: Holt Rinehart and Winston, 1976.
[18] T. Muguruma, E. Tanaka, and S. Masuda, "A metric between unrooted and unordered trees and its topdown computing method,"Trans. IEICE, vol. E77D, pp. 555566, 1994.