A survey on tree edit distance and related problems

Untitled work

(1979) · Cited by 43,841 · see citing works

Introduction to Algorithms

Adhi Harmoko, S., M.Komp, Jacquard, J. M., Zuse, K., & Eniac (2005) · Cited by 18,035 · see citing works

Introduction to Algorithms

Rayward-Smith, V. J., Cormen, T. H., Leiserson, C. E., & Rivest, R. L. (1991) · Journal of the Operational Research Society · doi:10.2307/2583667 · Cited by 16,953 · see citing works

The Art of Computer Programming

Knuth, D. E. (1968) · Cited by 16,097 · see citing works

Randomized Algorithms

Motwani, R., & Raghavan, P. (1995) · Cambridge University Press eBooks · doi:10.1017/cbo9780511814075 · Cited by 5,098 · see citing works

Algorithms on strings, trees, and sequences computer science and computational biology

Gusfield, D. (1997) · Cited by 3,490 · see citing works

Algorithms on Strings, Trees and Sequences

Gusfield, D. (1997) · Cambridge University Press eBooks · doi:10.1017/cbo9780511574931 · Cited by 3,092 · see citing works

The String-to-String Correction Problem

Wagner, R. A., & Fischer, M. J. (1974) · Journal of the ACM · doi:10.1145/321796.321811 · Cited by 3,079 · see citing works

Storing and querying ordered XML using a relational database system

Tatarinov, I., Viglas, S. D., Beyer, K. S., Shanmugasundaram, J., Shekita, E. J., & Zhang, C. (2002) · ACM SIGMOD International Conference on Management of Data (SIGMOD) · doi:10.1145/564691.564715 · Cited by 2,236 · see citing works

Introduction to Algorithms, Second Edition

Rivest, R. L., Leiserson, C. E., Cormen, T. H., & Stein, C. (2001) · Cited by 1,984 · see citing works

Algorithms on strings, trees, and sequences

Gusfield, D. (1997) · Cited by 1,721 · see citing works

Simple Fast Algorithms for the Editing Distance between Trees and Related Problems

Zhang, K., & Shasha, D. E. (1989) · SIAM Journal on Computing · doi:10.1137/0218082 · Cited by 1,312 · see citing works

Fast Algorithms for Finding Nearest Common Ancestors

Harel, D., & Tarjan, R. E. (1984) · SIAM Journal on Computing · doi:10.1137/0213024 · Cited by 1,077 · see citing works

Introduction to Computational Biology

Waterman, M. S. (1995) · Springer eBooks · doi:10.1007/978-1-4899-6846-3 · Cited by 963 · see citing works

The Tree-to-Tree Correction Problem

Tai, K. (1979) · Journal of the ACM · doi:10.1145/322139.322143 · Cited by 870 · see citing works

Proof verification and hardness of approximation problems

Arora, S., Lund, C., Motwani, R., Sudan, M., & Szegedy, M. (1992) · Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1992.267823 · Cited by 740 · see citing works

Change detection in hierarchically structured information

Chawathe, S. S., Rajaraman, A., García-Molina, H., et al. (1996) · Proceedings - ACM-SIGMOD International Conference on Management of Data · doi:10.1145/233269.233366 · Cited by 488 · see citing works

Pattern Matching in Trees

Hoffmann, C. M., & O’Donnell, M. J. (1982) · Journal of the ACM · doi:10.1145/322290.322295 · Cited by 444 · see citing works

The tree-to-tree editing problem

Selkow, S. M. (1977) · Information Processing Letters · doi:10.1016/0020-0190(77)90064-3 · Cited by 428 · see citing works

Michael R.Garey/David S.Johnson 著, "COMPUTERS AND INTRACTABILITY A guide to the Theory of NP-Completeness", FREEMAN, A5判変形判, 338+xii, \5,217, 1979

室, 章. (1980) · 情報処理 · Cited by 411 · see citing works

Finding approximate patterns in strings

Ukkonen, E. (1985) · Journal of Algorithms · doi:10.1016/0196-6774(85)90023-9 · Cited by 385 · see citing works

Fast parallel and serial approximate string matching

Landau, G. M., & Vishkin, U. (1989) · Journal of Algorithms · doi:10.1016/0196-6774(89)90010-2 · Cited by 333 · see citing works

On the editing distance between unordered labeled trees

Zhang, K., Statman, R., & Shasha, D. E. (1992) · Information Processing Letters · doi:10.1016/0020-0190(92)90136-j · Cited by 324 · see citing works

Meaningful change detection in structured data

Chawathe, S. S., & García-Molina, H. (1997) · Proceedings - ACM-SIGMOD International Conference on Management of Data · doi:10.1145/253260.253266 · Cited by 284 · see citing works

The Association for Computing Machinery

Williams, S. B. (1954) · Journal of the ACM · doi:10.1145/320764.320765 · Cited by 268 · see citing works

Bounds on the Complexity of the Longest Common Subsequence Problem

Ullman, J. D., Aho, A. V., & Hirschberg, D. S. (1976) · Journal of the ACM · doi:10.1145/321921.321922 · Cited by 247 · see citing works

Computing the Edit-Distance Between Unrooted Ordered Trees

Klein, P. N. (1998) · Lecture notes in computer science · doi:10.1007/3-540-68530-8_8 · Cited by 246 · see citing works

Alignment of trees — an alternative to tree edit

Jiang, T. (1995) · Theoretical Computer Science · doi:10.1016/0304-3975(95)80015-8 · Cited by 241 · see citing works

Ordered and Unordered Tree Inclusion

Kilpeläinen, P., & Mannila, H. (1995) · SIAM Journal on Computing · doi:10.1137/s0097539791218202 · Cited by 203 · see citing works

A constrained edit distance between unordered labeled trees

Zhang, K. (1996) · Algorithmica · doi:10.1007/bf01975866 · Cited by 191 · see citing works

On the complexity of finding iso- and other morphisms for partial k-trees

Matoušek, J., & Thomas, R. (1992) · Discrete Mathematics · doi:10.1016/0012-365x(92)90687-b · Cited by 170 · see citing works

Tree Matching Problems with Applications to Structured Text Databases

Kilpeläinen, P. (1992) · Cited by 152 · see citing works

Some MAX SNP-hard results concerning unordered labeled trees

Zhang, K., & Jiang, T. (1994) · Information Processing Letters · doi:10.1016/0020-0190(94)90062-0 · Cited by 141 · see citing works

A system for approximate tree matching

Wang, J. T.-L., Zhang, K., Jeong, K., et al. (1994) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/69.298173 · Cited by 140 · see citing works

Alignment of trees — an alternative to tree edit

Jiang, T., Wang, L., & Zhang, K. (1995) · Theoretical Computer Science · doi:10.1016/0304-3975(95)80029-9 · Cited by 130 · see citing works

A Tree-to-Tree Distance and Its Application to Cluster Analysis

Lu, S.-Y. (1979) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.1979.6786615 · Cited by 121 · see citing works

Fast algorithms for the unit cost editing distance between trees

Shasha, D. E., & Zhang, K. (1990) · Journal of Algorithms · doi:10.1016/0196-6774(90)90011-3 · Cited by 119 · see citing works

Efficient tree pattern matching

Kosaraju, S. R. (1989) · Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1989.63475 · Cited by 119 · see citing works

Approximate tree pattern matching

Shasha, D. E., & Zhang, K. (1997) · Cited by 109 · see citing works

Algorithms for the constrained editing distance between ordered labeled trees and related problems

Zhang, K. (1995) · Pattern Recognition · doi:10.1016/0031-3203(94)00109-y · Cited by 108 · see citing works

New Algorithm for Ordered Tree-to-Tree Correction Problem

Chen, W. (2001) · Journal of Algorithms · doi:10.1006/jagm.2001.1170 · Cited by 90 · see citing works

Approximate Tree Matching in the Presence of Variable Length Don′t Cares

Zhang, K. Z., Shasha, D. E., & Wang, J. T.-L. (1994) · Journal of Algorithms · doi:10.1006/jagm.1994.1003 · Cited by 87 · see citing works

A tree-edit-distance algorithm for comparing simple, closed shapes

Klein, P. N., Tirthapura, S., Sharvit, D., et al. (2000) · doi:10.5555/338219.338628 · Cited by 83 · see citing works

On the approximation of largest common subtrees and largest common point sets

Akutsu, T., & Halldórsson, M. M. (2000) · Theoretical Computer Science · doi:10.1016/s0304-3975(97)00278-8 · Cited by 64 · see citing works

Finding Largest Subtrees and Smallest Supertrees

Gupta, A. K., & Nishimura, N. (1998) · Algorithmica · doi:10.1007/pl00009212 · Cited by 59 · see citing works

Authors'Reply

Hanson, A. R., Riseman, E. M., & Nagin, P. A. (1984) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.1984.4767510 · Cited by 57 · see citing works

Tree Pattern Matching

Zhang, K., & Shasha, D. E. (1997) · Oxford University Press eBooks · doi:10.1093/oso/9780195113679.003.0014 · Cited by 56 · see citing works

Nonlinear pattern matching in trees

Ramesh, R., & Ramakrishnan, I. V. (1992) · Journal of the ACM · doi:10.1145/128749.128752 · Cited by 52 · see citing works

THE TREE-TO-TREE EDITING PROBLEM

Tanaka, E., & TANAKA, K. (1988) · International Journal of Pattern Recognition and Artificial Intelligence · doi:10.1142/s0218001488000157 · Cited by 51 · see citing works

ATreeGrep: approximate searching in unordered trees

Shasha, D. E., Wang, J. T. L., Shan, H., et al. (2003) · International Conference on Scientific and Statistical Database Management · doi:10.1109/ssdm.2002.1029709 · Cited by 49 · see citing works

Fast comparison of evolutionary trees

Farach-Colton, M., & Thorup, M. (1994) · doi:10.5555/314464.314629 · Cited by 45 · see citing works

A Tree-Matching Algorithm Based on Node Splitting and Merging

Lu, S. Y. (1984) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.1984.4767511 · Cited by 45 · see citing works

Faster tree pattern matching

Dubiner, M., Galil, Z., & Magen, E. (2002) · Annual Symposium on Foundations of Computer Science · doi:10.1109/fscs.1990.89533 · Cited by 42 · see citing works

A Fast Algorithm for Optimal Alignment between Similar Ordered Trees

Jansson, J., & Lingas, A. (2001) · Lecture notes in computer science · doi:10.1007/3-540-48194-x_22 · Cited by 41 · see citing works

Indexing based on edit-distance matching of shape graphs

Tirthapura, S., Sharvit, D., Klein, P. N., et al. (1998) · Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE · doi:10.1117/12.325825 · Cited by 40 · see citing works

More Efficient Algorithm for Ordered Tree Inclusion

Chen, W. (1998) · Journal of Algorithms · doi:10.1006/jagm.1997.0899 · Cited by 38 · see citing works

Maximum agreement subtree in a set of evolutionary trees-metrics and efficient algorithms

Keselman, D., & Amir, A. (2002) · Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1994.365717 · Cited by 35 · see citing works

A New Measure of Edit Distance between Labeled Trees

Lu, C. L., Su, Z.-Y., & Tang, C. Y. (2001) · Lecture notes in computer science · doi:10.1007/3-540-44679-6_37 · Cited by 32 · see citing works

Lecture notes on approximation algorithms: Volume I

Motwani, R. (1993) · Cited by 32 · see citing works

A new algorithm for the ordered tree inclusion problem

Richter, T. (1997) · Lecture notes in computer science · doi:10.1007/3-540-63220-4_57 · Cited by 26 · see citing works

Pages 91-102

Palva, T., Ramsay, H., & Northrop, C. (2001) · KARGER eBooks · doi:10.1159/000062738 · Cited by 23 · see citing works

On the tree inclusion problem

Alonso, L., & Schott, R. (1993) · Lecture notes in computer science · doi:10.1007/3-540-57182-5_13 · Cited by 20 · see citing works

A New Measure of the Distance between Ordered Trees and its Applications

Richter, T. (1997) · Cited by 19 · see citing works

Approximation Algorithms for the Largest Common Subtree Problem.

Khanna, S., Motwani, R., & Yao, F. (1995) · Cited by 16 · see citing works

The editing distance between trees: algorithms and applications

Shasha, D. E., & Zhang, K. (1989) · Cited by 15 · see citing works

On the approximation of largest common subtrees and largest common point sets

Akutsu, T., & Halldórsson, M. M. (1994) · Lecture notes in computer science · doi:10.1007/3-540-58325-4_205 · Cited by 13 · see citing works

Efficient parallel algorithms for tree editing problems

Zhang, K. (1996) · Lecture notes in computer science · doi:10.1007/3-540-61258-0_26 · Cited by 13 · see citing works

FINDING SMALLEST SUPERTREES UNDER MINOR CONTAINMENT

Nishimura, N., Ragde, P. L., & Thilikos, D. M. (2000) · International Journal of Foundations of Computer Science · doi:10.1142/s0129054100000259 · Cited by 13 · see citing works

A NOTE ON A TREE-TO-TREE EDITING PROBLEM

TANAKA, E. (1995) · International Journal of Pattern Recognition and Artificial Intelligence · doi:10.1142/s0218001495000092 · Cited by 2 · see citing works

The impact of age on website usability

Wagner, N., Hassanein, K., & Head, M. (2014) · Computers in Human Behavior · doi:10.1016/j.chb.2014.05.003 · Cited by 109 · see citing works

Tree edit distance and common subtrees

Feruglio, V., & Alejandro, G. (2002) · Cited by 10 · see citing works

Bo-Tree: An Efficient Search Tree

Bhavani, Y., Bejjanki, K. K., Bhonagiri, J. K., et al. (2020) · IEEE India Council International Conference (INDICON) · doi:10.1109/indicon49873.2020.9342183

Brief Announcement: Graph-Based and Probabilistic Discrete Models Used in Detection of Malicious Attacks

Frenkel, S. L., & Zakharov, V. (2018) · Lecture notes in computer science · doi:10.1007/978-3-319-94147-9_15 · Cited by 1 · see citing works

Computing approximate tree edit distance using relaxation labeling

Torsello, A., & Hancock, E. R. (2003) · Pattern Recognition Letters · doi:10.1016/s0167-8655(02)00255-6 · Cited by 73 · see citing works

Delay Analysis of Multichannel Parallel Contention Tree Algorithms (MP-CTA)Preprint

Gursu, M., Alba, A. M., & Kellerer, W. (2017) · arXiv (Cornell University) · doi:10.48550/arxiv.1707.09754 · Cited by 6 · see citing works