Skip to main content
Springer Nature Link
Log in

Improved MAX SNP-Hard Results for Finding an Edit Distance between Unordered Trees

  • Conference paper
Combinatorial Pattern Matching (CPM 2011)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 6661))

Included in the following conference series:

Abstract

Zhang and Jiang (1994) have shown that the problem of finding an edit distance between unordered trees is MAX SNP-hard. In this paper, we show that this problem is MAX SNP-hard, even if (1) the height of trees is 2, (2) the degree of trees is 2, (3) the height of trees is 3 under a unit cost, and (4) the degree of trees is 2 under a unit cost.

This work is partially supported by Grand-in-Aid for Scientific Research 20500126, 20240014, 21500145 and 22240010 from the Ministry of Education, Culture, Sports, Science and Technology, Japan.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

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

    Article  MathSciNet  MATH  Google Scholar 

  2. Demaine, E.D., Mozes, S., Rossman, B., Weimann, O.: An optimal decomposition algorithm for tree edit distance. ACM Trans. Algorithms 6 (2009)

    Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  4. Kann, V.: Maximum bounded 3-demensional matching is MAX SNP-complete. Inform. Process. Let. 37, 27–35 (1991)

    Article  MathSciNet  MATH  Google Scholar 

  5. Papadimitriou, C.H., Yannakakis, M.: Optimization, approximation and complexity. J. Comput. System Sci. 43, 425–440 (1991)

    Article  MathSciNet  MATH  Google Scholar 

  6. Shasha, D., Wang, J.T.-L., Zhang, K., Shih, F.Y.: Exact and approximate algorithms for unordered tree matching. IEEE Trans. Sys. Man. and Cybernet. 24, 668–678 (1994)

    Article  MathSciNet  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  8. Zhang, K., Jiang, T.: Some MAX SNP-hard results concerning unordered labeled trees. Inform. Process. Let. 49, 249–254 (1994)

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  10. Zhang, K., Statman, R., Shasha, D.: On the editing distance between unordered labeled trees. Inform. Process. Let. 42, 133–139 (1992)

    Article  MathSciNet  MATH  Google Scholar 

  11. Zhang, K., Wang, J., Shasha, D.: On the editing distance between undirected acyclic graphs. Int. J. Found. Comput. Sci. 7, 43–58 (1995)

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Artificial Intelligence, Kyushu Institute of Technology, Kawazu 680-4, Iizuka, 820-8502, Japan

    Kouichi Hirata

  2. Graduate School of Computer Science and Systems Engineering, Kyushu Institute of Technology, Kawazu 680-4, Iizuka, 820-8502, Japan

    Yoshiyuki Yamamoto

  3. Computer Center, Gakushuin University, Mejiro 1-5-1, Toshima, Tokyo, 171-8588, Japan

    Tetsuji Kuboyama

Authors
  1. Kouichi Hirata
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Yoshiyuki Yamamoto
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Tetsuji Kuboyama
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Mathematics, Università degli Studi di Palermo, Via Archirafi 34, 90123, Palermo, Italy

    Raffaele Giancarlo

  2. Department of Computer Science, University of ’Piemonte Orientale’, Viale T. Michel 11, 15121, Alessandria, Italy

    Giovanni Manzini

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Hirata, K., Yamamoto, Y., Kuboyama, T. (2011). Improved MAX SNP-Hard Results for Finding an Edit Distance between Unordered Trees. In: Giancarlo, R., Manzini, G. (eds) Combinatorial Pattern Matching. CPM 2011. Lecture Notes in Computer Science, vol 6661. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-21458-5_34

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-21458-5_34

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-21457-8

  • Online ISBN: 978-3-642-21458-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics