{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T20:53:48Z","timestamp":1725742428764},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642401633"},{"type":"electronic","value":"9783642401640"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-40164-0_4","type":"book-chapter","created":{"date-parts":[[2013,7,22]],"date-time":"2013-07-22T01:01:30Z","timestamp":1374454890000},"page":"4-15","source":"Crossref","is-referenced-by-count":0,"title":["On the Complexity of Finding a Largest Common Subtree of Bounded Degree"],"prefix":"10.1007","author":[{"given":"Tatsuya","family":"Akutsu","sequence":"first","affiliation":[]},{"given":"Takeyuki","family":"Tamura","sequence":"additional","affiliation":[]},{"given":"Avraham A.","family":"Melkman","sequence":"additional","affiliation":[]},{"given":"Atsuhiro","family":"Takasu","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"4_CR1","doi-asserted-by":"publisher","first-page":"10","DOI":"10.1016\/j.tcs.2012.11.017","volume":"470","author":"T. Akutsu","year":"2013","unstructured":"Akutsu, T., Fukagawa, D., Halld\u00f3rsson, M.M., Takasu, A., Tanaka, K.: Approximation and parameterized algorithms for common subtrees and edit distance between unordered trees. Theoret. Comput. Sci.\u00a0470, 10\u201322 (2013)","journal-title":"Theoret. Comput. Sci."},{"key":"4_CR2","doi-asserted-by":"publisher","first-page":"352","DOI":"10.1016\/j.tcs.2010.10.002","volume":"421","author":"T. Akutsu","year":"2011","unstructured":"Akutsu, T., Fukagawa, D., Takasu, A., Tamura, T.: Exact algorithms for computing tree edit distance between unordered trees. Theoret. Comput. Sci.\u00a0421, 352\u2013364 (2011)","journal-title":"Theoret. Comput. Sci."},{"key":"4_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"360","DOI":"10.1007\/978-3-642-31265-6_29","volume-title":"Combinatorial Pattern Matching","author":"T. Akutsu","year":"2012","unstructured":"Akutsu, T., Tamura, T., Fukagawa, D., Takasu, A.: Efficient exponential time algorithms for edit distance between unordered trees. In: K\u00e4rkk\u00e4inen, J., Stoye, J. (eds.) CPM 2012. LNCS, vol.\u00a07354, pp. 360\u2013372. Springer, Heidelberg (2012)"},{"key":"4_CR4","doi-asserted-by":"crossref","first-page":"W267","DOI":"10.1093\/nar\/gkh473","volume":"32","author":"K.F. Aoki","year":"2004","unstructured":"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.\u00a032, W267\u2013W272(2004)","journal-title":"Nucl. Acids Res"},{"key":"4_CR5","doi-asserted-by":"crossref","unstructured":"Demaine, E.D., Mozes, S., Rossman, B., Weimann, O.: An optimal decomposition algorithm for tree edit distance. ACM Tran. Algorithms\u00a06(1) (2009)","DOI":"10.1145\/1644015.1644017"},{"key":"4_CR6","volume-title":"Parameterized Complexity Theory","author":"J. Flum","year":"2006","unstructured":"Flum, J., Grohe, M.: Parameterized Complexity Theory. Springer, Berlin (2006)"},{"key":"4_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"402","DOI":"10.1007\/978-3-642-21458-5_34","volume-title":"Combinatorial Pattern Matching","author":"K. Hirata","year":"2011","unstructured":"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.\u00a06661, pp. 402\u2013415. Springer, Heidelberg (2011)"},{"key":"4_CR8","doi-asserted-by":"publisher","first-page":"1165","DOI":"10.1089\/cmb.2006.13.1165","volume":"6","author":"Y. Horesh","year":"2006","unstructured":"Horesh, Y., Mehr, R., Unger, R.: Designing an A* algorithm for calculating edit distance between rooted-unordered trees. J. Comput. Biol.\u00a06, 1165\u20131176 (2006)","journal-title":"J. Comput. Biol."},{"key":"4_CR9","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1016\/0304-3975(95)80029-9","volume":"143","author":"T. Jiang","year":"1995","unstructured":"Jiang, T., Wang, L., Zhang, K.: Alignment of trees - an alternative to tree edit. Theoret. Comput. Sci.\u00a0143, 137\u2013148 (1995)","journal-title":"Theoret. Comput. Sci."},{"key":"4_CR10","doi-asserted-by":"publisher","first-page":"340","DOI":"10.1137\/S0097539791218202","volume":"24","author":"P. Kilpel\u00e4inen","year":"1995","unstructured":"Kilpel\u00e4inen, P., Mannila, H.: Ordered and unordered tree inclusion. SIAM J. Comput.\u00a024, 340\u2013356 (1995)","journal-title":"SIAM J. Comput."},{"key":"4_CR11","first-page":"67","volume":"29","author":"D. Milano","year":"2006","unstructured":"Milano, D., Scannapieco, M., Catarci, T.: Structure-aware XML object identification. Data Eng. Bulletin\u00a029, 67\u201374 (2006)","journal-title":"Data Eng. Bulletin"},{"key":"4_CR12","doi-asserted-by":"publisher","first-page":"1089","DOI":"10.1089\/cmb.2012.0133","volume":"19","author":"T. Mori","year":"2012","unstructured":"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.\u00a019, 1089\u20131104 (2012)","journal-title":"J. Comput. Biol."},{"key":"4_CR13","doi-asserted-by":"publisher","first-page":"668","DOI":"10.1109\/21.286387","volume":"24","author":"D. Shasha","year":"1994","unstructured":"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.\u00a024, 668\u2013678 (1994)","journal-title":"IEEE Trans. Syst., Man, and Cyber."},{"key":"4_CR14","doi-asserted-by":"publisher","first-page":"422","DOI":"10.1145\/322139.322143","volume":"26","author":"K.-C. Tai","year":"1979","unstructured":"Tai, K.-C.: The tree-to-tree correction problem. J. ACM\u00a026, 422\u2013433 (1979)","journal-title":"J. ACM"},{"key":"4_CR15","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-04921-1","volume-title":"Algorithms on Trees and Graphs","author":"G. Valiente","year":"2002","unstructured":"Valiente, G.: Algorithms on Trees and Graphs. Springer, Berlin (2002)"},{"key":"4_CR16","doi-asserted-by":"crossref","unstructured":"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\u2013194. ACM Press (2009)","DOI":"10.1145\/1571941.1571975"},{"key":"4_CR17","doi-asserted-by":"publisher","first-page":"1802","DOI":"10.1016\/j.compbiomed.2007.06.005","volume":"27","author":"K.-C. Yu","year":"2007","unstructured":"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\u00a027, 1802\u20131830 (2007)","journal-title":"Computers in Biology and Medicine"},{"key":"4_CR18","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1016\/0020-0190(94)90062-0","volume":"49","author":"K. Zhang","year":"1994","unstructured":"Zhang, K., Jiang, T.: Some MAX SNP-hard results concerning unordered labeled trees. Inform. Proc. Lett.\u00a049, 249\u2013254 (1994)","journal-title":"Inform. Proc. Lett."},{"key":"4_CR19","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1016\/0020-0190(92)90136-J","volume":"42","author":"K. Zhang","year":"1992","unstructured":"Zhang, K., Statman, R., Shasha, D.: On the editing distance between unordered labeled trees. Inform. Proc. Lett.\u00a042, 133\u2013139 (1992)","journal-title":"Inform. Proc. Lett."}],"container-title":["Lecture Notes in Computer Science","Fundamentals of Computation Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-40164-0_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,16]],"date-time":"2019-05-16T01:42:16Z","timestamp":1557970936000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-40164-0_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642401633","9783642401640"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-40164-0_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}