Approximating tree edit distance through string edit distance

Algorithmica (New York)

Volumn 57, Issue 2, 2010, Pages 325-348

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

^a KYOTO UNIVERSITY   (Japan)

^b NATIONAL INSTITUTE OF INFORMATICS   (Japan)

Author keywords

Approximation algorithms; Embedding; Euler string; String matching; Tree edit distance

Indexed keywords

BOUNDED DEGREE; EDIT DISTANCE; EULER STRING; ROOTED TREES; STRING ALIGNMENT; STRING MATCHING; SUBTREES; TREE EDIT DISTANCE; TREE MAPPING; UNIT COST;

LABELS;

APPROXIMATION ALGORITHMS;

ALGORITHMS; LABELS; TREES;

EID: 77949266100     PISSN: 01784617     EISSN: 14320541     Source Type: Journal    
DOI: 10.1007/s00453-008-9213-z     Document Type: Article

References (21)

1. T. Akutsu 2006 A relation between edit distance for ordered trees and edit distance for Euler strings Inf. Process. Lett. 100 105 109 05664700 10.1016/j.ipl.2006.06.002 2254200 (Pubitemid 44223483)
2. Bar-Yossef, Z., Jayram, T., Krauthgamer, R., Kumar, R.: Approximating edit distance efficiently. In: Proc. 45th IEEE Symp. Foundations on Computer Science, pp. 550-559 (2004)
3. Batu, T., Ergun, F., Sahinalp, S.C.: Oblivious string embeddings and edit distance approximations. In: Proc. 17th ACM-SIAM Symp. Discrete Algorithms, pp. 792-801 (2006)
4. P. Bille 2005 A survey on tree edit distance and related problem Theor. Comput. Sci. 337 217 239 1078.68152 10.1016/j.tcs.2004.12.030 2141222
5. W. Chen 2001 New algorithm for ordered tree-to-tree correction problem J. Algorithms 40 135 158 0980.68142 10.1006/jagm.2001.1170 1844445
6. Cormode, G., Muthukrishnan, S.: The string edit distance matching problem with moves. In: Proc. 13th ACM-SIAM Symp. Discrete Algorithms, pp. 667-676 (2002)
7. Cormode, G., Paterson, M., Sahinalp, S.C., Vishkin, U.: Communication complexity of document exchange. In: Proc. 11st ACM-SIAM Symp. Discrete Algorithms, pp. 197-206 (2000)
8. Czumaj, A., Gasieniec, L.: On the complexity of determining the period of a string. In: Proc. 11th Symp. Combinatorial Pattern Matching, pp. 412-422 (2000)
9. Demaine, E., Mozes, S., Rossman, B., Weimann, O.: An optimal decomposition algorithm for tree edit distance. In: Proc. 34th International Colloquium on Automata, Languages and Programming, pp. 146-157 (2007)
10. M. Garofalakis A. Kumar 2005 XML stream processing using tree-edit distance embedding ACM Trans. Database Syst. 30 279 332 10.1145/1061318.1061326 (Pubitemid 41201817)
11. R. Grossi 1993 On finding common subtrees Theor. Comput. Sci. 108 345 256 0777.68046 10.1016/0304-3975(93)90198-3 1202025 (Pubitemid 23660755)
12. Guha, S., Jagadish, H.V., Koudas, N., Srivastava, D., Yu, T.: Approximate XML joins. In: Proc. ACM SIGMOD, pp. 287-298 (2002)
13. Khot, S., Naor, A.: Nonembeddability theorems via Fourier analysis. In: Proc. 46th IEEE Symp. Foundations on Computer Science, pp. 101-110 (2005)
14. Klein, P.N.: Computing the edit-distance between unrooted ordered trees. In: Proc. 6th European Symp. Algorithms, pp. 91-102 (1998)
15. 1. In: Proc. 17th ACM-SIAM Symp. Discrete Algorithms, pp. 1010-1017 (2006)
16. Muthukrishnan, S., Sahinalp, S.C.: Approximate nearest neighbors and sequence comparison with block operations. In: Proc. 32nd ACM Symp. Theory of Computing, pp. 412-416 (2000)
17. Ostrovsky, R., Rabani, Y.: Low distortion embeddings for edit distance. In: Proc. 37th ACM Symp. Theory of Computing, pp. 218-224 (2005)
18. K.-C. Tai 1979 The tree-to-tree correction problem J. ACM 26 422 433 0409.68040 535263
19. Valiente, G.: Algorithms on Trees and Graphs. Springer, Berlin (2002)
20. Yang, R., Kalnis, P., Tung, A.K.H.: Similarity evaluation on tree-structured data. In: Proc. ACM SIGMOD, pp. 754-765 (2005)
21. K. Zhang D. Shasha 1989 Simple fast algorithms for the editing distance between trees and related problems SIAM J. Comput. 18 1245 1262 0692.68047 10.1137/0218082 1025472