A relation between edit distance for ordered trees and edit distance for Euler strings

Information Processing Letters

Volumn 100, Issue 3, 2006, Pages 105-109

  Akutsu, Tatsuya ^a  

^a KYOTO UNIVERSITY   (Japan)

Author keywords

Algorithms; Alignment; Edit distance; Euler string; Ordered trees

Indexed keywords

ALGORITHMS; ALIGNMENT; COSTS; MATHEMATICAL MODELS;

COST FUNCTIONS; EDIT DISTANCE; EULER STRINGS; ORDERED TREES;

TREES (MATHEMATICS);

EID: 33747143740     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ipl.2006.06.002     Document Type: Article

References (11)

1. Z. Bar-Yossef, Y.T.S. Jayram, R. Krauthgamer, R. Kumar, Approximating edit distance efficiently, in: Proc. 45th IEEE Symp. Foundations on Computer Science, 2004, pp. 550-559
2. Bille P. A survey on tree edit distance and related problem. Theoret. Comput. Sci. 337 (2005) 217-239
3. Chen W. New algorithm for ordered tree-to-tree correction problem. J. Algorithms 40 (2001) 135-158
4. Garofalakis M., and Kumar A. XML stream processing using tree-edit distance embedding. ACM Trans. Database Systems 30 1 (2005) 279-332
5. S. Guha, H.V. Jagadish, N. Koudas, D. Srivastava, T. Yu, Approximate XML joins, in: Proc. ACM SIGMOD, 2002, pp. 287-298
6. P.N. Klein, Computing the edit-distance between unrooted ordered trees, in: Proc. 6th European Symp. Algorithms, 1998, pp. 91-102
7. R. Ostrovsky, Y. Rabani, Low distortion embeddings for edit distance, in: Proc. 37th ACM Symp. Theory of Computing, 2005, pp. 218-224
8. Shasha D., and Zhang K. Fast algorithms for the unit cost editing distance between trees. J. Algorithms 11 (1990) 581-621
9. Tai K.-C. The tree-to-tree correction problem. J. ACM 26 (1979) 422-433
10. R. Yang, P. Kalnis, A.K.H. Tang, Similarity evaluation on tree-structured data, in: Proc. ACM SIGMOD, 2005, pp. 754-765
11. Zhang K., and Shasha D. Simple fast algorithms for the editing distance between trees and related problems. SIAM J. Computing 18 (1989) 1245-1262