RTED: A robust algorithm for the tree edit distance

Proceedings of the VLDB Endowment

Volumn 5, Issue 4, 2011, Pages 334-345

  Pawlik, Mateusz ^a   Augsten, Nikolaus ^a  

^a FREE UNIVERSITY OF BOZEN BOLZANO   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

FORESTRY; OPTIMIZATION; XML;

ASYMPTOTIC COMPLEXITY; MINIMUM COST; ORDERED LABELED TREES; ROBUST ALGORITHM; RUN TIME COMPLEXITY; STATE OF THE ART; TREE EDIT DISTANCE; WORST-CASE COMPLEXITY;

TREES (MATHEMATICS);

ALGORITHMS; AUTOMATIC CONTROL; DATA PROCESSING; EXPERIMENTATION; OPTIMIZATION; PROGRAMING LANGUAGES;

EID: 84863761505     PISSN: None     EISSN: 21508097     Source Type: Conference Proceeding    
DOI: 10.14778/2095686.2095692     Document Type: Article

References (32)

1. T. Akutsu. Tree edit distance problems: Algorithms and applications to bioinformatics. IEICE Trans., 93-D(2):208-218, 2010.
2. N. Augsten, D. Barbosa, M. Böhlen, and T. Palpanas TASM: Top-k approximate subtree matching. In ICDE, pages 353-364, 2010
3. N. Augsten, M. Böohlen, C. Dyreson, and J. Gamper. Approximate joins for data-centric XML. In ICDE, pages 814-823, 2008.
4. N. Augsten, M. Böhlen, and J. Gamper. An incrementally maintainable index for approximate lookups in hierarchical data. In VLDB, pages 247-258, 2006.
5. N. Augsten, M. Böhlen, and J. Gamper. The pq-gram distance between ordered labeled trees. ACM Trans. on Database Syst., 35(1), 2010.
6. J. Bellando and R. Kothari. Region-based modeling and tree edit distance as a basis for gesture recognition. In Int. Conf. on Image Analysis and Processing (ICIAP), pages 698-703, 1999.
7. P. Bille. A survey on tree edit distance and related problems. Theor. Comput. Sci., 337(1-3):217-239, 2005.
8. S. S. Chawathe. Comparing hierarchical data in external memory. In VLDB, pages 90-101, 1999.
9. S. S. Chawathe, A. Rajaraman, H. Garcia-Molina, and J. Widom. Change detection in hierarchically structured information. In SIGMOD, pages 493-504, 1996.
10. S. Chen and K. Zhang. An improved algorithm for tree edit distance incorporating structural linearity. In Int. Conf. on Computing and Combinatorics, (COCOON), pages 482-492, 2007.
11. W. Chen. New algorithm for ordered tree-to-tree correction problem. J. Algorithms, 40(2):135-158, 2001.
12. G. Cobena, S. Abiteboul, and A. Marian. Detecting changes in XML documents. In ICDE, pages 41-52, 2002.
13. T. Dalamagas, T. Cheng, K.-J. Winkel, and T. K. Sellis. A methodology for clustering XML documents by structure. Inf. Syst., 31(3):187-228, 2006.
14. D. de Castro Reis, P. B. Golgher, A. S. da Silva, and A. H. F. Laender Automatic Web news extraction using tree edit distance. In WWW, pages 502-511, 2004.
15. E. D. Demaine, S. Mozes, B. Rossman, and O. Weimann. An optimal decomposition algorithm for tree edit distance. ACM Trans. on Alg., 6(1), 2009.
16. S. Dulucq and H. Touzet. Decomposition algorithms for the tree edit distance problem. J. Discrete Alg., 3(2-4):448-471, 2005.
17. M. Garofalakis and A. Kumar. XML stream processing using tree-edit distance embeddings. ACM Trans. on Database Syst., 30(1):279-332, 2005.
18. S. Guha, H. V. Jagadish, N. Koudas, D. Srivastava, and T. Yu. Approximate XML joins. In SIGMOD, pages 287-298, 2002.
19. A. Habrard, J. M. I. Quereda, D. Rizo, and M. Sebban. Melody recognition with learned edit distances. In Joint IAPR International Workshop on Structural, Syntactic, and Statistical Pattern Recognition (SSPR/SPR), pages 86-96, 2008.
20. H. Heumann and G. Wittum. The tree-edit-distance, a measure for quantifying neuronal morphology. BMC Neuroscience, 10(Suppl 1):P89, 2009.
21. Y. Kim, J. Park, T. Kim, and J. Choi. Web information extraction by HTML tree edit distance matching. In Int. Conf. on Convergence Information Technology (ICCIT), pages 2455-2460, 2007.
22. P. N. Klein. Computing the edit-distance between unrooted ordered trees. In European Symposium on Algorithms (ESA), pages 91-102, 1998.
23. P. N. Klein, S. Tirthapura, D. Sharvit, and B. B. Kimia. A tree-edit-distance algorithm for comparing simple, closed shapes. In ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 696-704, 2000.
24. K.-H. Lee, Y.-C. Choy, and S.-B. Cho. An ecient algorithm to compute di erences between structured documents. IEEE Trans. Knowl. Data Eng., 16(8):965-979, 2004.
25. Z. Lin, H. Wang, and S. I. McClean. Measuring tree similarity for natural language processing based information retrieval. In Int. Conf. on Applications of Natural Language to Information Systems (NLDB), pages 13-23, 2010.
26. B. Ma, L. Wang, and K. Zhang. Computing similarity between RNA structures. Theor. Comput. Sci., 276(1-2):111-132, 2002.
27. D. D. Sleator and R. E. Tarjan. A data structure for dynamic trees. J. Comput. Syst. Sci., 26(3):362-391, 1983.
28. K.-C. Tai. The tree-to-tree correction problem. J. ACM, 26(3):422-433, 1979.
29. Y. Wang, D. J. DeWitt, and J. Yi Cai. X-di: An effective change detection algorithm for XML documents. In ICDE, pages 519-530, 2003.
30. R. Yang, P. Kalnis, and A. K. H. Tung. Similarity evaluation on tree-structured data. In SIGMOD, pages 754-765, 2005.
31. K. Zhang and D. Shasha. Simple fast algorithms for the editing distance between trees and related problems. SIAM J. Comput., 18(6):1245-1262, 1989.
32. K. Zhang, R. Statman, and D. Shasha. On the editing distance between unordered labeled trees. Information Processing Letters, 42(3):133-139, 1992.