Space Efficient Algorithms for Ordered Tree Comparison | Algorithmica Skip to main content
Springer Nature Link
Log in

Space Efficient Algorithms for Ordered Tree Comparison

  • Published:
Algorithmica Aims and scope Submit manuscript

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 article

Log in via an institution

Subscribe and save

Springer+ Basic
¥17,985 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price includes VAT (Japan)

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Bille, P.: A survey on tree edit distance and related problems. Theor. Comput. Sci. 337, 217–239 (2005)

    Article  MATH  MathSciNet  Google Scholar 

  2. Chodorow, M., Klavans, J.L.: Locating syntactic patterns in text corpora. Manuscript, Lexical systems, IBM Research, T.J. Watson Research Center, Yorktown Heights, New York (1990)

  3. Dulucq, S., Touzet, H.: Decomposition algorithm for tree editing distance. J. Discrete Algorithms (2004)

  4. Hirschberg, D.S.: A linear space algorithm for computing maximal common subsequences. Commun. ACM 18, 341–343 (1975)

    Article  MATH  MathSciNet  Google Scholar 

  5. Jiang, T., Wang, L., Zhang, K.: Alignment of trees—an alternative to tree edit. Theor. Comput. Sci. 143(1), 137–148 (1995)

    Article  MATH  MathSciNet  Google Scholar 

  6. Klein, P.: Computing the edit-distance between unrooted ordered trees. In: Proceedings of 6th European Symposium on Algorithms, pp. 91–102 (1998)

  7. 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)

  8. Shapiro, B., Zhang, K.: Comparing multiple RNA secondary structures using tree comparisons. Comput. Appl. Biosci. 6(4), 309–318 (1990)

    Google Scholar 

  9. Selkow, S.M.: The tree-to-tree editing problem. Inf. Process. Lett. 6, 184–186 (1977)

    Article  MATH  MathSciNet  Google Scholar 

  10. Tai, K.C.: The tree-to-tree correction problem. J. ACM 26, 422–433 (1979)

    Article  MATH  MathSciNet  Google Scholar 

  11. Wang, L., Zhao, J.: Parametric alignment of ordered trees. Bioinformatics 19, 2237–2245 (2003)

    Article  Google Scholar 

  12. Zhang, K.: Algorithms for the constrained editing distance between ordered labeled trees and related problems. Pattern Recognit. 28(3), 463–474 (1995)

    Article  Google Scholar 

  13. Zhang, K.: Efficient parallel algorithms for tree editing problems. In: Proceedings of the Seventh Symposium on Combinatorial Pattern Matching, Laguna Beach, California, June 1996. Lecture Notes in Computer Science, vol. 1075, pp. 361–372. Springer, Berlin (1996)

    Google Scholar 

  14. Zhang, K.: Computing similarity between RNA secondary structures. In: Proceedings of IEEE International Joint Symposia on Intelligence and Systems, Rockville, Maryland, pp. 126–132 (May 1998)

  15. Zhang, K., Shasha, D.: Simple fast algorithms for the editing distance between trees and related problems. SIAM J. Comput. 18(6), 1245–1262 (1989)

    Article  MATH  MathSciNet  Google Scholar 

  16. Zhang, K., Wang, J.T.L., Shasha, D.: On the editing distance between undirected acyclic graphs. Int. J. Found. Comput. Sci. 7(1), 43–57 (1996)

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dept. of Computer Science, City University of Hong Kong, 83 Tat Chee Avenue, Kowloon, Hong Kong

    Lusheng Wang

  2. Dept. of Computer Science, University of Western Ontario, London, ON, N6A 5B7, Canada

    Kaizhong Zhang

Authors
  1. Lusheng Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Kaizhong Zhang
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Lusheng Wang.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Wang, L., Zhang, K. Space Efficient Algorithms for Ordered Tree Comparison. Algorithmica 51, 283–297 (2008). https://doi.org/10.1007/s00453-007-9100-z

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00453-007-9100-z

Keywords

Search

Navigation