A survey on tree edit distance and related problems

Theoretical Computer Science

Volumn 337, Issue 1-3, 2005, Pages 217-239

  Bille, Philip ^a  

^a IT UNIVERSITY OF COPENHAGEN   (Denmark)

Author keywords

Tree alignment; Tree edit distance; Tree inclusion; Tree matching

Indexed keywords

ALGORITHMS; GENETIC ENGINEERING; PROBLEM SOLVING; SOCIAL ASPECTS; TREES (MATHEMATICS);

TREE ALIGNMENT; TREE EDIT DISTANCE; TREE INCLUSION; TREE MATCHING;

COMPUTER SCIENCE;

EID: 18444373554     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2004.12.030     Document Type: Article

References (58)

1. A.V. Aho, J.D. Ullman, D.S. Aho, and J.D. Hirschberg Bounds on the complexity of the longest common subsequence problem J. ACM 1 23 1976 1 12
2. T. Akutsu, M.M. Halldórsson. On the approximation of largest common point sets and largest common subtrees, in: Proc. 5th Ann. Internat. Symp. on Algorithms and Computation, Lecture Notes in Computer Science (LNCS), Vol. 834. Springer, Berlin, 1994, pp. 405-413.
3. L. Alonso, R. Schott, and 1993. On the tree inclusion problem Proc. Mathematical Foundations of Computer Science 1993 211 221
4. A. Arora, C. Lund, R. Motwani, M. Sudan, and M. Szegedy Proof verification and hardness of approximation problems Proc. 33rd IEEE Symp. on the Foundations of Computer Science (FOCS) 1992 14 23
5. S. Chawathe, and H. Garcia-Molina Meaningful change detection in structured data Proc. ACM SIGMOD International Conference on Management of Data 1997 Tuscon Arizona 26 37
6. S.S. Chawathe, A. Rajaraman, H. Garcia-Molina, J. Widom, Change detection in hierarchically structured information, in: Proc. ACM SIGMOD Internat. Conf. on Management of Data, Montréal, Québec, June 1996, pp. 493-504.
7. W. Chen More efficient algorithm for ordered tree inclusion J. Algorithms 26 1998 370 385
8. W. Chen New algorithm for ordered tree-to-tree correction problem J. Algorithms 40 2001 135 158
9. T.H. Cormen, C.E. Leiserson, R.L. Rivest, and C. Stein Introduction to Algorithms second ed. 2001 MIT Press Cambridge, MA
10. M. Dubiner, Z. Galil, and E. Magen Faster tree pattern matching Proc. 31st IEEE Symp. on the Foundations of Computer Science (FOCS) 1990 145 150
11. M. Farach, and M. Thorup Fast comparison of evolutionary trees Proc. 5th Ann. ACM-SIAM Symp. on Discrete Algorithms 1994 481 488
12. M.J. Garey, and D.S. Johnson Computers and Intractability A Guide to the Theory of NP-completeness 1979 Freeman New York
13. A. Gupta, and N. Nishimura Finding largest subtrees and smallest supertrees Algorithmica 21 1998 183 210
14. D. Gusfield Algorithms on Strings, Trees, and Sequences 1997 Cambridge University Press Cambridge
15. D. Harel, and R.E. Tarjan Fast algorithms for finding nearest common ancestors SIAM J. Comput. 13 2 1984 338 355
16. C.M. Hoffmann, and M.J. O'Donnell Pattern matching in trees J. ACM 29 1 1982 68 95
17. J. Jansson, A. Lingas, A fast algorithm for optimal alignment between similar ordered trees, in: Proc. 12th Ann. Symp. Combinatorial Pattern Matching (CPM), Lecture Notes of Computer Science (LNCS). Vol. 2089, Springer, Berlin, 2001.
18. T. Jiang, L. Wang, and K. Zhang Alignment of trees - an alternative to tree edit Theoret. Comput. Sci. 143 1995
19. D. Keselman, and A. Amir Maximum agreement subtree in a set of evolutionary trees - metrics and efficient algorithms Proc. 35th Ann. Symp. on Foundations of Computer Science (FOCS) 1994 758 769
20. S. Khanna, R. Motwani, F.F. Yao, Approximation algorithms for the largest common subtree problem, Technical Report, Stanford University, 1995.
21. P. Kilpeläinen, Tree matching problems with applications to structured text databases, Ph.D. Thesis, Department of Computer Science, University of Helsinki, November 1992.
22. P. Kilpeläinen, and H. Mannila Ordered and unordered tree inclusion SIAM J. Comput. 24 1995 340 356
23. P. Klein, 2002. Personal communication.
24. P. Klein, S. Tirthapura, D. Sharvit, and B. Kimia A tree-edit-distance algorithm for comparing simple, closed shapes Proc. 11th Ann. ACM-SIAM Symp. on Discrete Algorithms (SODA) 2000 696 704
25. P.N. Klein Computing the edit-distance between unrooted ordered trees Proc. 6th Ann. European Symp. on Algorithms (ESA) 1998 Springer Berlin 91 102
26. D.E. Knuth, The Art of Computer Programming, Vol. 1, Addison-Wesley, Reading, MA, 1969.
27. S.R. Kosaraju Efficient tree pattern matching Proc. 30th IEEE Symp. on the Foundations of Computer Science (FOCS) 1989 178 183
28. G.M. Landau, and U. Vishkin Fast parallel and serial approximate string matching J. Algorithms 10 1989 157 169
29. S.Y. Lu A tree-to-tree distance and its application to cluster analysis IEEE Trans. Pattern Anal. Mach. Intell. 1 1979 219 224
30. S.Y. Lu A tree-matching algorithm based on node splitting and merging IEEE Trans. Pattern Anal. Mach. Intell. 6 2 1984 249 256
31. C.L. Lu, Z.-Y. Su, C.Y., Tang, A new measure of edit distance between labeled trees, in: Proc. 7th Ann. Internat. Conf. on Computing and Combinatorics (COCOON), Lecture Notes in Computer Science (LNCS). Vol. 2108, Springer, Berlin, 2001.
32. J. Matoušek, and R. Thomas On the complexity of finding iso- and other morphisms for partial k -trees Discrete Math. 108 1992 343 364
33. R. Motwani, Lecture Notes on Approximation Algorithms, Vol. 1. Technical Report STAN-CS-92-1435, Department of Computer Science, Stanford University, 1992.
34. N. Nishimura, P. Ragde, and D.M. Thilikos Finding smallest supertrees under minor containment Internat. J. Found. Comput. Sci. 11 3 2000 445 465
35. R. Ramesh, and I.V. Ramakrishnan Nonlinear pattern matching in trees J. ACM 39 2 1992 295 316
36. T. Richter, A new algorithm for the ordered tree inclusion problem, in: Proc. 8th Ann. Symp. on Combinatorial Pattern Matching (CPM), Lecture Notes of Computer Science (LNCS), Vol. 1264, Springer, Berlin, 1997, pp. 150-166.
37. T. Richter, A new measure of the distance between ordered trees and its applications, Technical Report 85166-cs. Department of Computer Science, University of Bonn, 1997.
38. S.M. Selkow The tree-to-tree editing problem Inform. Process. Lett. 6 6 1977 184 186
39. J. Setubal, and J. Meidanis Introduction to Computational Biology 1997 PWS Publishing Company MA
40. D. Shasha, J.T.-L. Wang, H. Shan, and K. Zhang Atreegrep approximate searching in unordered trees Proc. 14th Internat. Conf. on Scientific and Statistical Database Management 2002 89 98
41. D. Shasha, and K. Zhang Fast algorithms for the unit cost editing distance between trees J. Algorithms 11 1990 581 621
42. D. Shasha, and K. Zhang Approximate tree pattern matching Pattern Matching in String, Trees and Arrays 1997 Oxford University Oxford 341 371
43. K.-C. Tai The tree-to-tree correction problem J. ACM 26 1979 422 433
44. E. Tanaka A note on a tree-to-tree editing problem Internat. J. Pattern Recogn. Artif. Intell. 9 1 1995 167 172
45. E. Tanaka, and K. Tanaka The tree-to-tree editing problem Internat. J. Pattern Recogn. Artif. Intell. 2 2 1988 221 240
46. S. Tirthapura, D. Sharvit, P. Klein, and B.B. Kimia Indexing based on edit-distance matching of shape graphs Proc. SPIE Internat. Symp. Voice, Video and Data Communications 1998 91 102
47. E. Ukkonen Finding approximate patterns in strings J. Algorithms 6 1985 132 137
48. R.A. Wagner, and M.J. Fischer The string-to-string correction problem J. ACM 21 1974 168 173
49. J.T.-L. Wang, K. Zhang, K. Jeong, and D. Shasha A system for approximate tree matching IEEE Trans. Knowl. Data Eng. 6 4 1994 559 571
50. K. Zhang, The Editing Distance Between Trees: Algorithms and Applications, Ph.D. Thesis, Department of Computer Science, Courant Institute, 1989.
51. K. Zhang Algorithms for the constrained editing problem between ordered labeled trees and related problems Pattern Recognition 28 1995 463 474
52. K. Zhang A constrained edit distance between unordered labeled trees Algorithmica 15 3 1996 205 222
53. K. Zhang, Efficient parallel algorithms for tree editing problems, in: Proc. 7th Ann. Symp. Combinatorial Pattern Matching (CPM), Lecture Notes in Computer Science, Vol. 1075, 1996, pp. 361-372.
54. K. Zhang, and T. Jiang Some MAX SNP-hard results concerning unordered labeled trees Inform. Process. Lett. 49 1994 249 254
55. K. Zhang, and D. Shasha Simple fast algorithms for the editing distance between trees and related problems SIAM J. Comput. 18 1989 1245 1262
56. K. Zhang, D. Shasha, and J.T.L. Wang Approximate tree matching in the presence of variable length don't cares J. Algorithms 16 1 1994 33 66
57. K. Zhang, R. Statman, D. Shasha, On the editing distance between unordered labeled trees, Technical Report 289, Department of Computer Science, The University of Western Ontario, 1991.
58. K. Zhang, R. Statman, and D. Shasha On the editing distance between unordered labeled trees Inform. Process. Lett. 42 1992 133 139