{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,29]],"date-time":"2025-05-29T04:05:07Z","timestamp":1748491507421,"version":"3.41.0"},"publisher-location":"Cham","reference-count":17,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319193144"},{"type":"electronic","value":"9783319193151"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"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":[[2015]]},"DOI":"10.1007\/978-3-319-19315-1_8","type":"book-chapter","created":{"date-parts":[[2015,6,6]],"date-time":"2015-06-06T10:42:08Z","timestamp":1433587328000},"page":"86-97","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Computing Primitively-Rooted Squares and Runs in Partial Words"],"prefix":"10.1007","author":[{"given":"Francine","family":"Blanchet-Sadri","sequence":"first","affiliation":[]},{"given":"Jordan","family":"Nikkel","sequence":"additional","affiliation":[]},{"given":"J. D.","family":"Quigley","sequence":"additional","affiliation":[]},{"given":"Xufan","family":"Zhang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,6,7]]},"reference":[{"issue":"6","key":"8_CR1","doi-asserted-by":"publisher","first-page":"1039","DOI":"10.1137\/0216067","volume":"16","author":"K Abrahamson","year":"1987","unstructured":"Abrahamson, K.: Generalized string matching. SIAM J. Comput. 16(6), 1039\u20131051 (1987)","journal-title":"SIAM J. Comput."},{"issue":"3","key":"8_CR2","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1016\/0304-3975(83)90109-3","volume":"22","author":"A Apostolico","year":"1983","unstructured":"Apostolico, A., Preparata, F.P.: Optimal off-line detection of repetitions in a string. Theor. Comput. Sci. 22(3), 297\u2013315 (1983)","journal-title":"Theor. Comput. Sci."},{"key":"8_CR3","series-title":"Efficient Algorithms","volume-title":"Algorithmic Number Theory","author":"E Bach","year":"1996","unstructured":"Bach, E., Shallit, J.: Algorithmic Number Theory. Efficient Algorithms, vol. 1. MIT Press, Cambridge (1996)"},{"key":"8_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1007\/978-3-642-37064-9_15","volume-title":"Language and Automata Theory and Applications","author":"F Blanchet-Sadri","year":"2013","unstructured":"Blanchet-Sadri, F., Bodnar, M., Fox, N., Hidakatsu, J.: A graph polynomial approach to primitivity. In: Dediu, A.-H., Mart\u00edn-Vide, C., Truthe, B. (eds.) LATA 2013. LNCS, vol. 7810, pp. 153\u2013164. Springer, Heidelberg (2013)"},{"key":"8_CR5","doi-asserted-by":"publisher","first-page":"42","DOI":"10.1016\/j.tcs.2014.02.023","volume":"530","author":"F Blanchet-Sadri","year":"2014","unstructured":"Blanchet-Sadri, F., Jiao, Y., Machacek, J.M., Quigley, J.D., Zhang, X.: Squares in partial words. Theor. Comput. Sci. 530, 42\u201357 (2014)","journal-title":"Theor. Comput. Sci."},{"key":"8_CR6","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1016\/j.tcs.2012.03.034","volume":"443","author":"F Blanchet-Sadri","year":"2012","unstructured":"Blanchet-Sadri, F., Merca\u015f, R., Rashin, A., Willett, E.: Periodicity algorithms and a conjecture on overlaps in partial words. Theor. Comput. Sci. 443, 35\u201345 (2012)","journal-title":"Theor. Comput. Sci."},{"issue":"5","key":"8_CR7","doi-asserted-by":"publisher","first-page":"244","DOI":"10.1016\/0020-0190(81)90024-7","volume":"12","author":"M Crochemore","year":"1981","unstructured":"Crochemore, M.: An optimal algorithm for computing the repetitions in a string. Inf. Process. Lett. 12(5), 244\u2013250 (1981)","journal-title":"Inf. Process. Lett."},{"key":"8_CR8","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511546853","volume-title":"Algorithms on Strings","author":"M Crochemore","year":"2007","unstructured":"Crochemore, M., Hancart, C., Lecroq, T.: Algorithms on Strings. Cambridge University Press, New York (2007)"},{"key":"8_CR9","doi-asserted-by":"publisher","first-page":"5227","DOI":"10.1016\/j.tcs.2009.08.024","volume":"410","author":"M Crochemore","year":"2009","unstructured":"Crochemore, M., Ilie, L., Rytter, W.: Repetitions in strings: Algorithms and combinatorics. Theor. Comput. Sci. 410, 5227\u20135235 (2009)","journal-title":"Theor. Comput. Sci."},{"key":"8_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1007\/978-3-642-03409-1_10","volume-title":"Fundamentals of Computation Theory","author":"A Diaconu","year":"2009","unstructured":"Diaconu, A., Manea, F., Tiseanu, C.: Combinatorial queries and updates on partial words. In: Kuty\u0142owski, M., Charatonik, W., G\u0119bala, M. (eds.) FCT 2009. LNCS, vol. 5699, pp. 96\u2013108. Springer, Heidelberg (2009)"},{"key":"8_CR11","unstructured":"Fischer, M., Paterson, M.: String matching and other products. In: Karp, R. (ed.) 7th SIAM-AMS Complexity of Computation, pp. 113\u2013125 (1974)"},{"issue":"1","key":"8_CR12","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1051\/ita\/2010008","volume":"44","author":"V Halava","year":"2010","unstructured":"Halava, V., Harju, T., K\u00e4rki, T.: On the number of squares in partial words. RAIRO-Theor. Inf. Appl. 44(1), 125\u2013138 (2010)","journal-title":"RAIRO-Theor. Inf. Appl."},{"key":"8_CR13","doi-asserted-by":"crossref","DOI":"10.1093\/oso\/9780199219858.001.0001","volume-title":"An Introduction to the Theory of Numbers","author":"GH Hardy","year":"2008","unstructured":"Hardy, G.H., Wright, E.M.: An Introduction to the Theory of Numbers. Oxford University Press, London (2008)"},{"key":"8_CR14","doi-asserted-by":"crossref","unstructured":"Kolpakov, R., Kucherov, G.: Finding maximal repetitions in a string in linear time. In: FOCS 1999, pp. 596\u2013604. IEEE Computer Society Press, Los Alamitos (1999)","DOI":"10.1109\/SFFCS.1999.814634"},{"key":"8_CR15","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511566097","volume-title":"Combinatorics on Words","author":"M Lothaire","year":"1997","unstructured":"Lothaire, M.: Combinatorics on Words. Cambridge University Press, Cambridge (1997)"},{"issue":"3","key":"8_CR16","doi-asserted-by":"publisher","first-page":"422","DOI":"10.1016\/0196-6774(84)90021-X","volume":"5","author":"MG Main","year":"1984","unstructured":"Main, M.G., Lorentz, R.J.: An O(nlog n) algorithm for finding all repetitions in a string. J. Algorithms 5(3), 422\u2013432 (1984)","journal-title":"J. Algorithms"},{"key":"8_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"472","DOI":"10.1007\/978-3-642-22993-0_43","volume-title":"Mathematical Foundations of Computer Science 2011","author":"F Manea","year":"2011","unstructured":"Manea, F., Merca\u015f, R., Tiseanu, C.: Periodicity algorithms for partial words. In: Murlak, F., Sankowski, P. (eds.) MFCS 2011. LNCS, vol. 6907, pp. 472\u2013484. Springer, Heidelberg (2011)"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-19315-1_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,28]],"date-time":"2025-05-28T11:46:24Z","timestamp":1748432784000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-19315-1_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319193144","9783319193151"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-19315-1_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"7 June 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}