Abstract
In this paper, we give an approximation of the tree edit distance through the string edit distance for binary tree codes, instead of one for Euler strings introduced by Akutsu (2006). Here, a binary tree code is a string obtained by traversing a binary tree representation with two kinds of dummy nodes of a tree in preorder. Then, we show that σ/2 ≤ τ ≤ (h + 1)σ + h, where τ is the tree edit distance between trees, σ is the string edit distance between their binary tree codes and h is the minimum height of the trees.
This work is partially supported by Grand-in-Aid for Scientific Research 19300046 and 20500126 from the Ministry of Education, Culture, Sports, Science and Technology, Japan.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Akutsu, T.: A relationship between edit distance for ordered trees and edit distance for Euler strings. Inform. Proc. Let. 100, 105–109 (2006)
Akutsu, T., Fukagawa, D., Takasu, A.: Approximating tree edit distance through string edit distance. In: Asano, T. (ed.) ISAAC 2006. LNCS, vol. 4288, pp. 90–99. Springer, Heidelberg (2006)
Aratsu, T., Hirata, K., Kuboyama, T.: Sibling distance for rooted ordered trees. In: Proc. ALSIP 2008, Working Notes of PAKDD Workshops, pp. 101–112 (2008)
Bille, P.: A survey on tree edit distance and related problems. Theoret. Comput. Sci. 337, 217–239 (2005)
Demaine, E.D., Mozes, S., Rossman, B., Weimann, O.: An optimal decomposition algorithm for tree edit distance. In: Arge, L., Cachin, C., Jurdziński, T., Tarlecki, A. (eds.) ICALP 2007. LNCS, vol. 4596, pp. 146–157. Springer, Heidelberg (2007)
Garofalakis, M., Kumar, A.: XML stream processing using tree-edit distance embedding. ACM Trans. Database System 30, 279–332 (2006)
Kailing, K., Kriegel, H.-P., Schönauer, S., Seidl, T.: Efficient similarity search for hierarchical data in large databases. In: Bertino, E., Christodoulakis, S., Plexousakis, D., Christophides, V., Koubarakis, M., Böhm, K., Ferrari, E. (eds.) EDBT 2004. LNCS, vol. 2992, pp. 676–693. Springer, Heidelberg (2004)
Knuth, D.E.: The art of computer programing, 3rd edn. Fundamental algorithms, vol. 1. Addison-Wesley, Reading (1997)
Magniez, F., de Rougemont, M.: Property testing of regular tree languages. Algorithmica 42, 127–146 (2007)
Valiente, G.: An efficient bottom-up distance between trees. In: Proc. SPIRE 2001, pp. 212–219 (2001)
Yang, R., Kalnis, P., Tung, A.K.H.: Similarity evaluation on tree-structed data. In: Proc. SIGMOD 2005, pp. 754–765 (2005)
Zhang, K., Shasha, D.: Simple fast algorithms for the editing distance between trees and related problems. SIAM J. Comput. 18, 1245–1262 (1989)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Aratsu, T., Hirata, K., Kuboyama, T. (2009). Approximating Tree Edit Distance through String Edit Distance for Binary Tree Codes. In: Nielsen, M., Kučera, A., Miltersen, P.B., Palamidessi, C., Tůma, P., Valencia, F. (eds) SOFSEM 2009: Theory and Practice of Computer Science. SOFSEM 2009. Lecture Notes in Computer Science, vol 5404. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-95891-8_12
Download citation
DOI: https://doi.org/10.1007/978-3-540-95891-8_12
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-95890-1
Online ISBN: 978-3-540-95891-8
eBook Packages: Computer ScienceComputer Science (R0)