{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,14]],"date-time":"2025-05-14T04:25:54Z","timestamp":1747196754103,"version":"3.40.5"},"publisher-location":"Cham","reference-count":22,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319135236"},{"type":"electronic","value":"9783319135243"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-13524-3_2","type":"book-chapter","created":{"date-parts":[[2014,12,2]],"date-time":"2014-12-02T17:51:38Z","timestamp":1417542698000},"page":"15-27","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["On the Parameterized Complexity of Associative and Commutative Unification"],"prefix":"10.1007","author":[{"given":"Tatsuya","family":"Akutsu","sequence":"first","affiliation":[]},{"given":"Jesper","family":"Jansson","sequence":"additional","affiliation":[]},{"given":"Atsuhiro","family":"Takasu","sequence":"additional","affiliation":[]},{"given":"Takeyuki","family":"Tamura","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2014,12,3]]},"reference":[{"key":"2_CR1","volume-title":"The Design and Analysis of Computer Algorithms","author":"AV Aho","year":"1974","unstructured":"Aho, A.V., Hopcroft, J.E., Ullman, J.D.: The Design and Analysis of Computer Algorithms. Addison-Wesley, Reading (1974)"},{"key":"2_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"346","DOI":"10.1007\/11496656_30","volume-title":"Combinatorial Pattern Matching","author":"K Aikou","year":"2005","unstructured":"Aikou, K., Suzuki, Y., Shoudai, T., Uchida, T., Miyahara, T.: A polynomial time matching algorithm of ordered tree patterns having height-constrained variables. In: Apostolico, A., Crochemore, M., Park, K. (eds.) CPM 2005. LNCS, vol. 3537, pp. 346\u2013357. Springer, Heidelberg (2005)"},{"key":"2_CR3","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1016\/0020-0190(95)00111-O","volume":"55","author":"T Akutsu","year":"1995","unstructured":"Akutsu, T.: Approximate string matching with don\u2019t care characters. Inf. Process. Lett. 55, 235\u2013239 (1995)","journal-title":"Inf. Process. Lett."},{"key":"2_CR4","first-page":"1353","volume":"E79\u2013D","author":"T Akutsu","year":"1996","unstructured":"Akutsu, T.: Approximate string matching with variable length don\u2019t care characters. IEICE Trans. Inf. Syst. E79\u2013D, 1353\u20131354 (1996)","journal-title":"IEICE Trans. Inf. Syst."},{"key":"2_CR5","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1016\/S0747-7171(87)80027-5","volume":"3","author":"D Benanav","year":"1987","unstructured":"Benanav, D., Kapur, D., Narendran, P.: Complexity of matching problems. J. Symbolic Comput. 3, 203\u2013216 (1987)","journal-title":"J. Symbolic Comput."},{"key":"2_CR6","first-page":"447","volume-title":"Handbook of Automated Reasoning","author":"F Baader","year":"2001","unstructured":"Baader, F., Snyder, W.: Unification theory. In: Robinson, J.A., Voronkov, A. (eds.) Handbook of Automated Reasoning, pp. 447\u2013533. Elsevier, Amsterdam (2001)"},{"key":"2_CR7","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1016\/j.tcs.2004.12.030","volume":"337","author":"P Bille","year":"2005","unstructured":"Bille, P.: A survey on tree edit distance and related problem. Theoret. Comput. Sci. 337, 217\u2013239 (2005)","journal-title":"Theoret. Comput. Sci."},{"key":"2_CR8","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1016\/0304-3975(94)00251-D","volume":"147","author":"HL Bodlaender","year":"1995","unstructured":"Bodlaender, H.L., Downey, R.G., Fellows, M.R., Wareham, H.T.: The parameterized complexity of sequence alignment and consensus. Theoret. Comput. Sci. 147, 31\u201354 (1995)","journal-title":"Theoret. Comput. Sci."},{"key":"2_CR9","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1016\/0022-0000(86)90003-6","volume":"32","author":"D de Champeaux","year":"1986","unstructured":"de Champeaux, D.: About the paterson-wegman linear unification algorithm. J. Comput. Syst. Sci. 32, 79\u201390 (1986)","journal-title":"J. Comput. Syst. Sci."},{"key":"2_CR10","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1023\/A:1020122610698","volume":"28","author":"S Eker","year":"2002","unstructured":"Eker, S.: Single elementary associative-commutative matching. J. Autom. Reasoning 28, 35\u201351 (2002)","journal-title":"J. Autom. Reasoning"},{"key":"2_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1007\/978-3-642-38905-4_10","volume-title":"Combinatorial Pattern Matching","author":"H Fernau","year":"2013","unstructured":"Fernau, H., Schmid, M.L.: Pattern matching with variables: A multivariate complexity analysis. In: Fischer, J., Sanders, P. (eds.) CPM 2013. LNCS, vol. 7922, pp. 83\u201394. Springer, Heidelberg (2013)"},{"key":"2_CR12","volume-title":"Parameterized Complexity Theory","author":"J Flum","year":"2006","unstructured":"Flum, J., Grohe, M.: Parameterized Complexity Theory. Springer, Berlin (2006)"},{"key":"2_CR13","doi-asserted-by":"crossref","unstructured":"Gilbert, D., Schroeder, M.: FURY: fuzzy unification and resolution based on edit distance. In: Proceedings of 1st IEEE International Symposium on Bioinformatics and Biomedical Engineering, pp. 330\u2013336 (2000)","DOI":"10.1109\/BIBE.2000.889625"},{"key":"2_CR14","doi-asserted-by":"crossref","unstructured":"Iranzo, P.J., Rubio-Manzano, C.: An efficient fuzzy unification method and its implementation into the Bousi$$\\sim $$Prolog system. In: Proceedings of 2010 IEEE International Conference on Fuzzy Systems, pp. 1\u20138 (2010)","DOI":"10.1109\/FUZZY.2010.5584193"},{"key":"2_CR15","volume-title":"An Introduction to Bioinformatics Algorithms","author":"NC Jones","year":"2004","unstructured":"Jones, N.C., Pevzner, P.A.: An Introduction to Bioinformatics Algorithms. MIT Press, Cambridge (2004)"},{"key":"2_CR16","doi-asserted-by":"crossref","unstructured":"Kamali, S., Tompa, F.W.: A new mathematics retrieval system. In: Proceedings of ACM Conference on Information and Knowledge Management, pp. 1413\u20131416 (2010)","DOI":"10.1145\/1871437.1871635"},{"key":"2_CR17","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1023\/A:1020122610698","volume":"28","author":"D Kapur","year":"2002","unstructured":"Kapur, D., Narendran, P.: Complexity of unification problems with associative-commutative operators. J. Autom. Reasoning 28, 35\u201351 (2002)","journal-title":"J. Autom. Reasoning"},{"key":"2_CR18","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1145\/62029.62030","volume":"21","author":"K Knight","year":"1989","unstructured":"Knight, K.: Unification: a multidisciplinary survey. ACM Comput. Surv. 21, 93\u2013124 (1989)","journal-title":"ACM Comput. Surv."},{"key":"2_CR19","doi-asserted-by":"crossref","unstructured":"Nguyen, T.T., Chang, K., Hui, S.C.: A math-aware search engine for math question answering system. In: Proceedings of ACM Conference on Information and Knowledge Management, pp. 724\u2013733 (2012)","DOI":"10.1145\/2396761.2396854"},{"key":"2_CR20","unstructured":"NTCIR: http:\/\/research.nii.ac.jp\/ntcir\/ntcir-10\/conference.html (2013)"},{"key":"2_CR21","doi-asserted-by":"publisher","first-page":"158","DOI":"10.1016\/0022-0000(78)90043-0","volume":"16","author":"MS Paterson","year":"1978","unstructured":"Paterson, M.S., Wegman, M.N.: Linear unification. J. Comput. Syst. Sci. 16, 158\u2013167 (1978)","journal-title":"J. Comput. Syst. Sci."},{"key":"2_CR22","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1145\/321250.321253","volume":"12","author":"JA Robinson","year":"1965","unstructured":"Robinson, J.A.: A machine-oriented logic based on the resolution principle. J. ACM 12, 23\u201341 (1965)","journal-title":"J. ACM"}],"container-title":["Lecture Notes in Computer Science","Parameterized and Exact Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-13524-3_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,13]],"date-time":"2025-05-13T22:34:29Z","timestamp":1747175669000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-13524-3_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319135236","9783319135243"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-13524-3_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]},"assertion":[{"value":"3 December 2014","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}