Abstract
In this paper we present techniques to significantly improve the space complexity of several ordered tree comparison algorithms without sacrificing the corresponding time complexity. We present new algorithms for computing the constrained ordered tree edit distance and the alignment of (ordered) trees. The techniques can also be applied to other related problems.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bille, P.: A survey on tree edit distance and related problems. Theoretical Computer Science (337), 217–239 (2005)
Cheng, Y.C., Lu, S.Y.: Waveform correlation by tree matching. IEEE Trans. PAMI 7, 299–305 (1985)
Dulucq, S., Touzet, H.: Decomposition algorithm for tree editing distance. Journal of Discrete Algorithms (2004)
Hirschberg, D.S.: A linear space algorithm for computing maximal common subsequences. Communications of the ACM (18), 341–343 (1975)
Jiang, T., Wang, L., Zhang, K.: Alignment of trees - an alternative to tree edit. Theoretical Computer Science 143(1), 137–148 (1995)
Klein, P.: Computing the edit-distance between unrooted ordered trees. In: Bilardi, G., Pietracaprina, A., Italiano, G.F., Pucci, G. (eds.) ESA 1998. LNCS, vol. 1461, pp. 91–102. Springer, Heidelberg (1998)
Richter, T.: A new measure of the distance between ordered trees and its applications. Technical Report 85166-cs, Department of Computer Science, University of Bonn (1997)
Shapiro, B., Zhang, K.: Comparing multiple RNA secondary structures using tree comparisons. Comput. Appl. Biosci. 6(4), 309–318 (1990)
Selkow, S.M.: The tree-to-tree editing problem. Information Processing Letters 6, 184–186 (1977)
Tai, K.C.: The tree-to-tree correction problem. J. ACM 26, 422–433 (1979)
Wang, L., Zhao, J.: Parametric alignment of ordered trees. Bioinformatics 19, 2237–2245 (2003)
Zhang, K.: Algorithms for the constrained editing distance between ordered labeled trees and related problems. Pattern Recognition 28(3), 463–474 (1995)
Zhang, K.: Efficient parallel algorithms for tree editing problems. In: Hirschberg, D.S., Meyers, G. (eds.) CPM 1996. LNCS, vol. 1075, pp. 361–372. Springer, Heidelberg (1996)
Zhang, K., Shasha, D.: Simple fast algorithms for the editing distance between trees and related problems. SIAM J. Computing 18(6), 1245–1262 (1989)
Zhang, K., Wang, L., Ma, B.: Computing similarity between RNA structures. In: Crochemore, M., Paterson, M. (eds.) CPM 1999. LNCS, vol. 1645, pp. 281–293. Springer, Heidelberg (1999)
Zhang, K., Wang, J.T.L., Shasha, D.: On the editing distance between undirected acyclic graphs. International Journal of Foundations of Computer Science 7(1), 43–57 (1996)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Wang, L., Zhang, K. (2005). Space Efficient Algorithms for Ordered Tree Comparison. In: Deng, X., Du, DZ. (eds) Algorithms and Computation. ISAAC 2005. Lecture Notes in Computer Science, vol 3827. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11602613_39
Download citation
DOI: https://doi.org/10.1007/11602613_39
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-30935-2
Online ISBN: 978-3-540-32426-3
eBook Packages: Computer ScienceComputer Science (R0)