Abstract
An ordered labeled tree is a tree in which the nodes are labeled and the left-to-right order among siblings is relevant. The edit distance between two ordered labeled trees is the minimum cost of transforming one tree into the other through a sequence of edit operations. We present techniques for speeding up the tree edit distance computation which are applicable to a family of algorithms based on closely related recursion strategies. These techniques aim to reduce repetitious steps in the original algorithms by exploring certain structural features in the tree. When these features exist in a large portion of the tree, the speedup due to our techniques would be significant. Viable examples for application include RNA secondary structure comparison and structured text comparison.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Aggarwal A, Klawe MM, Moran S, Shor P, Wilber R (1987) Geometric applications of a matrix-searching algorithm. Algorithmica 2:195–208
Apostolico A, Atallah MJ, Larmore LL, McFaddin HS (1990) Efficient parallel algorithms for string editing and related problems. SIAM J Comput 19(5):968–988
Bille P (2005) A survey on tree edit distance and related problems. Theor Comput Sci 337:217–239
Demaine ED, Mozes S, Rossman B, Weimann O (2009) An optimal decomposition algorithm for tree edit distance. ACM Trans Algorithms 6(1):2:1–2:19
Dulucq S, Touzet H (2005) Decomposition algorithms for the tree edit distance problem. J Discrete Algorithms 3:448–471
Harel D, Tarjan RE (1984) Fast algorithms for finding nearest common ancestors. SIAM J Comput 13(2):338–355
Klein PN (1998) Computing the edit-distance between unrooted ordered trees. In: Proceedings of the 6th European symposium on algorithms (ESA), pp 91–102
Moore PB (1999) Structural motifs in RNA. Annu Rev Biochem 68:287–300
Sleator DD, Tarjan RE (1983) A data structure for dynamic trees. J Comput Syst Sci 26:362–391
Tai K (1979) The tree-to-tree correction problem. J ACM 26(3):422–433
Wagner RA, Fischer MJ (1974) The string-to-string correction problem. J ACM 21(1):168–173
Zhang K, Shasha D (1989) Simple fast algorithms for the editing distance between trees and related problems. SIAM J Comput 18(6):1245–1262
Acknowledgements
We thank Zhifeng Lin for obtaining the experimental data. This research was supported by Natural Science and Engineering Research Council of Canada.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Chen, S., Zhang, K. An improved algorithm for tree edit distance with applications for RNA secondary structure comparison. J Comb Optim 27, 778–797 (2014). https://doi.org/10.1007/s10878-012-9552-1
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10878-012-9552-1