Constant factor approximation of edit distance of bounded height unordered trees

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5721 LNCS, Issue , 2009, Pages 7-17

  Fukagawa, Daiji ^a   Akutsu, Tatsuya ^b   Takasu, Atsuhiro ^a  

^a NATIONAL INSTITUTE OF INFORMATICS   (Japan)

^b KYOTO UNIVERSITY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION RATIOS; CONSTANT FACTOR APPROXIMATION; DIMENSION REDUCTION; EDIT DISTANCE; EFFICIENT IMPLEMENTATION; MAX SNP-HARD; TREE EDIT DISTANCE; UNIT COST; UNORDERED TREES;

INFORMATION RETRIEVAL; INFORMATION SERVICES; TOWERS;

APPROXIMATION ALGORITHMS;

EID: 70350633191     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-03784-9_2     Document Type: Conference Paper

References (21)

1. Aho, A.V., Hopcroft, J.E., Ullman, J.D.: The Design and Analysis of Computer Algorithms. Addison-Wesley Longman Publishing Co., Inc., Boston (1974)
2. Akutsu, T.: A relation between edit distance for ordered trees and edit distance for euler strings. Inf. Proc. Lett. 100, 105-109 (2006)
3. Akutsu, T., Fukagawa, D., Takasu, A.: Improved approximation of the largest common sub-tree of two unordered trees of bounded height. Inf. Proc. Lett. 109, 165-170 (2008)
4. Bille, P.: A survey on tree edit distance and related problems. Theor. Comput. Sci. 337, 217-239 (2005)
5. Collins, M., Duffy, N.: Convolution Kernels for Natural Language. In: Proc. NIPS, pp. 625-632 (2001)
6. Demaine, E.D., Mozes, S., Rossman, B., Weimann, O.: An optimal decomposition algorithm for tree edit distance. In: Arge, L., Cachin, C., Jurdziński, T., Tarlecki, A. (eds.) ICALP 2007. LNCS, vol. 4596, pp. 146-157. Springer, Heidelberg (2007)
7. Garofalakis, M.N., Kumar, A.: XML stream processing using tree-edit distance embeddings. ACM Trans. Database System 30, 279-332 (2005)
8. Guha, S., Jagadish, H.V., Koudas, N., Srivastava, D., Yu, T.: Approximate XML joins. In: SIGMOD 2002 (2002)
9. Halldórsson, M.M., Tanaka, K.: Approximation and special cases of common subtrees and editing distance. In: Nagamochi, H., Suri, S., Igarashi, Y., Miyano, S., Asano, T. (eds.) ISAAC 1996. LNCS, vol. 1178, pp. 75-84. Springer, Heidelberg (1996)
10. Karp, R.M., Rabin, M.O.: Efficient randomized pattern-matching algorithms. IBM Journal of Research and Development 31, 249-260 (1987)
11. Klein, P.N.: Computing the edit-distance between unrooted ordered trees. In: Bilardi, G., Pietracaprina, A., Italiano, G.F., Pucci, G. (eds.) ESA 1998. LNCS, vol. 1461, pp. 91-102. Springer, Heidelberg (1998)
12. Knuth, D.E.: The Art of Computer Programming. Fascicle 4: Generating All Trees, vol. 4. Addison-Wesley Professional, Reading (2006)
13. Motwani, R., Raghavan, P.: Randomized Algorithms. Cambridge University Press, New York (1995)
14. Müller-Molina, A.J., Hirata, K., Shinohara, T.: A tree distance function based on multi-sets. In: ALSIP 2008, PAKDD Workshops, pp. 90-100 (2008)
15. Tai, K.-C.: The tree-to-tree correction problem. J. ACM 26, 422-433 (1979)
16. Valiente, G.: An Efficient Bottom-Up Distance between Trees. In: Proc. Eighth Int'l Symp. String Processing Information Retrieval, pp. 212-219 (2001)
17. Vishwanathan, S.V.N., Smola, A.J.: Fast Kernels for String and Tree Matching. In: NIPS, pp. 569-576 (2002)
18. Yang, R., Kalnis, P., Tung, A.K.H.: Similarity evaluation on tree-structured data. In: SIGMOD (2005)
19. Zhang, K.: A constrained edit distance between unordered labeled trees. Algorithmica 15, 205-222 (1996)
20. Zhang, K., Jiang, T.: Some MAX SNP-hard results concerning unordered labeled trees. Inf. Proc. Lett. 49, 249-254 (1994)
21. Zhang, K., Shasha, D.: Simple fast algorithms for the editing distance between trees and related problems. SIAM J. Computing 18, 1245-1262 (1989)