{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T00:02:04Z","timestamp":1743033724306,"version":"3.40.3"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031721991"},{"type":"electronic","value":"9783031722004"}],"license":[{"start":{"date-parts":[[2024,9,19]],"date-time":"2024-09-19T00:00:00Z","timestamp":1726704000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,9,19]],"date-time":"2024-09-19T00:00:00Z","timestamp":1726704000000},"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":[[2025]]},"DOI":"10.1007\/978-3-031-72200-4_13","type":"book-chapter","created":{"date-parts":[[2024,9,18]],"date-time":"2024-09-18T19:01:50Z","timestamp":1726686110000},"page":"174-183","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["On the\u00a0Number of\u00a0Non-equivalent Parameterized Squares in\u00a0a\u00a0String"],"prefix":"10.1007","author":[{"given":"Rikuya","family":"Hamai","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kazushi","family":"Taketsugu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6269-9353","authenticated-orcid":false,"given":"Yuto","family":"Nakashima","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1833-010X","authenticated-orcid":false,"given":"Shunsuke","family":"Inenaga","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6856-5185","authenticated-orcid":false,"given":"Hideo","family":"Bannai","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,9,19]]},"reference":[{"issue":"3","key":"13_CR1","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1016\/0020-0190(94)90086-8","volume":"49","author":"A Amir","year":"1994","unstructured":"Amir, A., Farach, M., Muthukrishnan, S.: Alphabet dependence in parameterized matching. Inf. Process. Lett. 49(3), 111\u2013115 (1994)","journal-title":"Inf. Process. Lett."},{"key":"13_CR2","doi-asserted-by":"crossref","unstructured":"Apostolico, A., Giancarlo, R.: Periodicity and repetitions in parameterized strings. Discrete Appl. Math. 156(9), 1389\u20131398 (2008). general Theory of Information Transfer and Combinatorics","DOI":"10.1016\/j.dam.2006.11.017"},{"issue":"1","key":"13_CR3","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1006\/jcss.1996.0003","volume":"52","author":"BS Baker","year":"1996","unstructured":"Baker, B.S.: Parameterized pattern matching: algorithms and applications. J. Comput. Syst. Sci. 52(1), 28\u201342 (1996)","journal-title":"J. Comput. Syst. Sci."},{"key":"13_CR4","unstructured":"Brlek, S., Li, S.: On the number of squares in a finite word (2022). arXiv preprint arXiv:2204.10204"},{"key":"13_CR5","unstructured":"Deguchi, S., Higashijima, F., Bannai, H., Inenaga, S., Takeda, M.: Parameterized suffix arrays for binary strings. In: PSC 2008, pp. 84\u201394 (2008). http:\/\/www.stringology.org\/event\/2008\/p08.html"},{"issue":"1","key":"13_CR6","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1090\/S0002-9939-1965-0174934-9","volume":"16","author":"NJ Fine","year":"1965","unstructured":"Fine, N.J., Wilf, H.S.: Uniqueness theorems for periodic functions. Proc. Am. Math. Soc. 16(1), 109\u2013114 (1965)","journal-title":"Proc. Am. Math. Soc."},{"issue":"1","key":"13_CR7","doi-asserted-by":"publisher","first-page":"112","DOI":"10.1006\/jcta.1997.2843","volume":"82","author":"AS Fraenkel","year":"1998","unstructured":"Fraenkel, A.S., Simpson, J.: How many squares can a string contain? J. Comb. Theor. Ser. A 82(1), 112\u2013120 (1998)","journal-title":"J. Comb. Theor. Ser. A"},{"key":"13_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"382","DOI":"10.1007\/978-3-030-32686-9_27","volume-title":"String Processing and Information Retrieval","author":"N Fujisato","year":"2019","unstructured":"Fujisato, N., Nakashima, Y., Inenaga, S., Bannai, H., Takeda, M.: Direct linear time construction of parameterized suffix and LCP arrays for constant alphabets. In: Brisaboa, N.R., Puglisi, S.J. (eds.) SPIRE 2019. LNCS, vol. 11811, pp. 382\u2013391. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-32686-9_27"},{"key":"13_CR9","doi-asserted-by":"publisher","unstructured":"Ganguly, A., Shah, R., Thankachan, S.V.: pBWT: achieving succinct data structures for parameterized pattern matching and related problems. In: SODA 2017, pp. 397\u2013407 (2017). https:\/\/doi.org\/10.1137\/1.9781611974782.25","DOI":"10.1137\/1.9781611974782.25"},{"key":"13_CR10","unstructured":"Gawrychowski, P., Ghazawi, S., Landau, G.M.: Order-preserving squares in strings (2023). arXiv preprint arXiv:2302.00724"},{"key":"13_CR11","doi-asserted-by":"crossref","unstructured":"Ideguchi, H., Hendrian, D., Yoshinaka, R., Shinohara, A.: Efficient parameterized pattern matching in sublinear space. In: International Symposium on String Processing and Information Retrieval, pp. 1389\u20131398 (2023)","DOI":"10.1007\/978-3-031-43980-3_22"},{"issue":"2","key":"13_CR12","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1016\/0304-3975(94)00270-3","volume":"154","author":"RM Idury","year":"1996","unstructured":"Idury, R.M., Sch\u00e4ffer, A.A.: Multiple matching of parametrized patterns. Theor. Comput. Sci. 154(2), 203\u2013224 (1996). https:\/\/doi.org\/10.1016\/0304-3975(94)00270-3","journal-title":"Theor. Comput. Sci."},{"key":"13_CR13","doi-asserted-by":"publisher","unstructured":"Iseri, K., I, T., Hendrian, D., K\u00f6ppl, D., Yoshinaka, R., Shinohara, A.: Breaking a barrier in constructing compact indexes for parameterized pattern matching. In: ICALP 2024. LIPIcs, vol.\u00a0297, pp. 89:1\u201389:19 (2024). https:\/\/doi.org\/10.4230\/LIPICS.ICALP.2024.89","DOI":"10.4230\/LIPICS.ICALP.2024.89"},{"key":"13_CR14","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1016\/j.tcs.2013.10.006","volume":"525","author":"J Kim","year":"2014","unstructured":"Kim, J., et al.: Order-preserving matching. Theoret. Comput. Sci. 525, 68\u201379 (2014)","journal-title":"Theoret. Comput. Sci."},{"key":"13_CR15","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1016\/j.tcs.2016.08.010","volume":"648","author":"T Kociumaka","year":"2016","unstructured":"Kociumaka, T., Radoszewski, J., Rytter, W., Wale\u0144, T.: Maximum number of distinct and nonequivalent nonstandard squares in a word. Theoret. Comput. Sci. 648, 84\u201395 (2016)","journal-title":"Theoret. Comput. Sci."},{"key":"13_CR16","doi-asserted-by":"publisher","unstructured":"Lewenstein, M.: Parameterized pattern matching. In: Encyclopedia of Algorithms, pp. 1525\u20131530. Springer (2016). https:\/\/doi.org\/10.1007\/978-1-4939-2864-4_282","DOI":"10.1007\/978-1-4939-2864-4_282"},{"issue":"4","key":"13_CR17","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1307\/mmj\/1028998766","volume":"9","author":"RC Lyndon","year":"1962","unstructured":"Lyndon, R.C., Sch\u00fctzenberger, M.P., et al.: The equation $$a^m = b^n c^p$$ in a free group. Michigan Math. J 9(4), 289\u2013298 (1962)","journal-title":"Michigan Math. J"},{"key":"13_CR18","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1016\/J.TCS.2016.02.017","volume":"656","author":"Y Matsuoka","year":"2016","unstructured":"Matsuoka, Y., Aoki, T., Inenaga, S., Bannai, H., Takeda, M.: Generalized pattern matching and periodicity under substring consistent equivalence relations. Theor. Comput. Sci. 656, 225\u2013233 (2016). https:\/\/doi.org\/10.1016\/J.TCS.2016.02.017","journal-title":"Theor. Comput. Sci."},{"key":"13_CR19","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1016\/J.TCS.2022.09.008","volume":"933","author":"K Nakashima","year":"2022","unstructured":"Nakashima, K., et al.: Parameterized dawgs: efficient constructions and bidirectional pattern searches. Theor. Comput. Sci. 933, 21\u201342 (2022). https:\/\/doi.org\/10.1016\/J.TCS.2022.09.008","journal-title":"Theor. Comput. Sci."},{"key":"13_CR20","doi-asserted-by":"publisher","unstructured":"Osterkamp, E.M., K\u00f6ppl, D.: Extending the parameterized burrows-wheeler transform. In: DCC 2024, pp. 143\u2013152 (2024). https:\/\/doi.org\/10.1109\/DCC58796.2024.00022","DOI":"10.1109\/DCC58796.2024.00022"}],"container-title":["Lecture Notes in Computer Science","String Processing and Information Retrieval"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-72200-4_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,18]],"date-time":"2024-09-18T19:02:40Z","timestamp":1726686160000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-72200-4_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,9,19]]},"ISBN":["9783031721991","9783031722004"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-72200-4_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024,9,19]]},"assertion":[{"value":"19 September 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SPIRE","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on String Processing and Information Retrieval","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Puerto Vallarta","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Mexico","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23 September 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 September 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"spire2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/computo.fismat.umich.mx\/spire2024\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}