Skip to main content
SpringerLink
Log in

On the Complexity of Finding a Largest Common Subtree of Bounded Degree

  • Conference paper
Fundamentals of Computation Theory (FCT 2013)

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

Included in the following conference series:

  • 761 Accesses

Abstract

The largest common subtree problem is to find a bijective mapping between subsets of nodes of two input rooted trees of maximum cardinality or weight that preserves labels and ancestry relationship. This problem is known to be NP-hard for unordered trees. In this paper, we consider a restricted unordered case in which the maximum outdegree of a common subtree is bounded by a constant D. We present an O(n D) time algorithm where n is the maximum size of two input trees, which improves a previous O(n 2D) time algorithm. We also prove that this restricted problem is W[1]-hard for parameter D.

This work was partially supported by the Collaborative Research Programs of National Institute of Informatics. T.A. and T.T. were partially supported by JSPS, Japan: Grant-in-Aid 22650045 and Grant-in-Aid 23700017, respectively.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

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.

References

  1. Akutsu, T., Fukagawa, D., Halldórsson, M.M., Takasu, A., Tanaka, K.: Approximation and parameterized algorithms for common subtrees and edit distance between unordered trees. Theoret. Comput. Sci. 470, 10–22 (2013)

    Article  MathSciNet  MATH  Google Scholar 

  2. Akutsu, T., Fukagawa, D., Takasu, A., Tamura, T.: Exact algorithms for computing tree edit distance between unordered trees. Theoret. Comput. Sci. 421, 352–364 (2011)

    Article  MathSciNet  Google Scholar 

  3. Akutsu, T., Tamura, T., Fukagawa, D., Takasu, A.: Efficient exponential time algorithms for edit distance between unordered trees. In: Kärkkäinen, J., Stoye, J. (eds.) CPM 2012. LNCS, vol. 7354, pp. 360–372. Springer, Heidelberg (2012)

    Chapter  Google Scholar 

  4. Aoki, K.F., Yamaguchi, A., Ueda, N., Akutsu, T., Mamitsuka, H., Goto, S., Kanehisa, M.: KCaM (KEGG Carbohydrate Matcher): A software tool for analyzing the structures of carbohydrate sugar chains. Nucl. Acids Res. 32, W267–W272(2004)

    Google Scholar 

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

    Google Scholar 

  6. Flum, J., Grohe, M.: Parameterized Complexity Theory. Springer, Berlin (2006)

    Google Scholar 

  7. Hirata, K., Yamamoto, Y., Kuboyama, T.: Improved MAX SNP-hard results for finding an edit distance between unordered trees. In: Giancarlo, R., Manzini, G. (eds.) CPM 2011. LNCS, vol. 6661, pp. 402–415. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

  8. Horesh, Y., Mehr, R., Unger, R.: Designing an A* algorithm for calculating edit distance between rooted-unordered trees. J. Comput. Biol. 6, 1165–1176 (2006)

    Article  MathSciNet  Google Scholar 

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

    MathSciNet  MATH  Google Scholar 

  10. Kilpeläinen, P., Mannila, H.: Ordered and unordered tree inclusion. SIAM J. Comput. 24, 340–356 (1995)

    Article  MathSciNet  MATH  Google Scholar 

  11. Milano, D., Scannapieco, M., Catarci, T.: Structure-aware XML object identification. Data Eng. Bulletin 29, 67–74 (2006)

    Google Scholar 

  12. Mori, T., Tamura, T., Fukagawa, D., Takasu, A., Tomita, E., Akutsu, T.: A clique-based method using dynamic programming for computing edit distance between unordered trees. J. Comput. Biol. 19, 1089–1104 (2012)

    Article  MathSciNet  Google Scholar 

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

    Article  MathSciNet  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  15. Valiente, G.: Algorithms on Trees and Graphs. Springer, Berlin (2002)

    Book  MATH  Google Scholar 

  16. Wang, K., Ming, Z., Chua, T.-S.: A syntactic tree matching approach to finding similar questions in community-based QA services. In: Proc. Int. ACM SIGIR Conf. Research and Development in Information Retrieval, pp. 187–194. ACM Press (2009)

    Google Scholar 

  17. Yu, K.-C., Ritman, E.L., Higgins, W.E.: System for the analysis and visualization of large 3D anatomical trees. Computers in Biology and Medicine 27, 1802–1830 (2007)

    Article  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Bioinformatics Center, Institute for Chemical Research, Kyoto University, Gokasho, Uji, Kyoto, 611-0011, Japan

    Tatsuya Akutsu & Takeyuki Tamura

  2. Ben-Gurion University of the Negev, Beer-Sheva, 84105, Israel

    Avraham A. Melkman

  3. National Institute of Informatics, Tokyo, 101-8430, Japan

    Atsuhiro Takasu

Authors
  1. Tatsuya Akutsu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Takeyuki Tamura
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Avraham A. Melkman
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Atsuhiro Takasu
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Computer Science, University of Liverpool, Ashton Street, L69 3BX, Liverpool, UK

    Leszek Gąsieniec

  2. Department of Computer Science, University of Liverpool, United Kingdom

    Frank Wolter

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Akutsu, T., Tamura, T., Melkman, A.A., Takasu, A. (2013). On the Complexity of Finding a Largest Common Subtree of Bounded Degree. In: Gąsieniec, L., Wolter, F. (eds) Fundamentals of Computation Theory. FCT 2013. Lecture Notes in Computer Science, vol 8070. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-40164-0_4

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-40164-0_4

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-40163-3

  • Online ISBN: 978-3-642-40164-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation