{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,8]],"date-time":"2026-02-08T14:45:43Z","timestamp":1770561943996,"version":"3.49.0"},"publisher-location":"Cham","reference-count":24,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030592110","type":"print"},{"value":"9783030592127","type":"electronic"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-59212-7_19","type":"book-chapter","created":{"date-parts":[[2020,9,16]],"date-time":"2020-09-16T10:05:34Z","timestamp":1600250734000},"page":"265-273","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Lyndon Words, the Three Squares Lemma, and Primitive Squares"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6856-5185","authenticated-orcid":false,"given":"Hideo","family":"Bannai","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2922-9434","authenticated-orcid":false,"given":"Takuya","family":"Mieno","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"}]}],"member":"297","published-online":{"date-parts":[[2020,9,17]]},"reference":[{"key":"19_CR1","doi-asserted-by":"publisher","unstructured":"Bannai, H., Tomohiro, I., Inenaga, S., Nakashima, Y., Takeda, M., Tsuruta, K.: A new characterization of maximal repetitions by Lyndon trees. In: Indyk, P. (ed.) Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2015), San Diego, CA, USA, 4\u20136 January 2015, pp. 562\u2013571. SIAM (2015). \nhttps:\/\/doi.org\/10.1137\/1.9781611973730.38","DOI":"10.1137\/1.9781611973730.38"},{"issue":"5","key":"19_CR2","doi-asserted-by":"publisher","first-page":"1501","DOI":"10.1137\/15M1011032","volume":"46","author":"H Bannai","year":"2017","unstructured":"Bannai, H., Tomohiro, I., Inenaga, S., Nakashima, Y., Takeda, M., Tsuruta, K.: The \u201cruns\u201d theorem. SIAM J. Comput. 46(5), 1501\u20131514 (2017). \nhttps:\/\/doi.org\/10.1137\/15M1011032","journal-title":"SIAM J. Comput."},{"issue":"1","key":"19_CR3","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1016\/0097-3165(90)90050-7","volume":"55","author":"H Barcelo","year":"1990","unstructured":"Barcelo, H.: On the action of the symmetric group on the free Lie algebra and the partition lattice. J. Comb. Theory Ser. A 55(1), 93\u2013129 (1990). \nhttps:\/\/doi.org\/10.1016\/0097-3165(90)90050-7","journal-title":"J. Comb. Theory Ser. A"},{"issue":"3","key":"19_CR4","doi-asserted-by":"publisher","first-page":"996","DOI":"10.1016\/j.ejc.2005.07.019","volume":"28","author":"J Berstel","year":"2007","unstructured":"Berstel, J., Perrin, D.: The origins of combinatorics on words. Eur. J. Comb. 28(3), 996\u20131022 (2007). \nhttps:\/\/doi.org\/10.1016\/j.ejc.2005.07.019","journal-title":"Eur. J. Comb."},{"issue":"1","key":"19_CR5","doi-asserted-by":"publisher","first-page":"81","DOI":"10.2307\/1970044","volume":"68","author":"KT Chen","year":"1958","unstructured":"Chen, K.T., Fox, R.H., Lyndon, R.C.: Free differential calculus, IV. The quotient groups of the lower central series. Ann. Math. 68(1), 81\u201395 (1958). \nhttps:\/\/doi.org\/10.2307\/1970044","journal-title":"Ann. Math."},{"issue":"5","key":"19_CR6","doi-asserted-by":"publisher","first-page":"796","DOI":"10.1016\/j.jcss.2007.09.003","volume":"74","author":"M Crochemore","year":"2008","unstructured":"Crochemore, M., Ilie, L.: Maximal repetitions in strings. J. Comput. Syst. Sci. 74(5), 796\u2013807 (2008). \nhttps:\/\/doi.org\/10.1016\/j.jcss.2007.09.003","journal-title":"J. Comput. Syst. Sci."},{"key":"19_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1007\/978-3-319-46049-9_3","volume-title":"String Processing and Information Retrieval","author":"M Crochemore","year":"2016","unstructured":"Crochemore, M., et al.: Near-optimal computation of runs over general alphabet via non-crossing LCE queries. In: Inenaga, S., Sadakane, K., Sakai, T. (eds.) SPIRE 2016. LNCS, vol. 9954, pp. 22\u201334. Springer, Cham (2016). \nhttps:\/\/doi.org\/10.1007\/978-3-319-46049-9_3"},{"key":"19_CR8","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1016\/j.tcs.2013.11.018","volume":"521","author":"M Crochemore","year":"2014","unstructured":"Crochemore, M., Iliopoulos, C.S., Kubica, M., Radoszewski, J., Rytter, W., Walen, T.: Extracting powers and periods in a word from its runs structure. Theor. Comput. Sci. 521, 29\u201341 (2014). \nhttps:\/\/doi.org\/10.1016\/j.tcs.2013.11.018","journal-title":"Theor. Comput. Sci."},{"issue":"5","key":"19_CR9","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1007\/BF01190846","volume":"13","author":"M Crochemore","year":"1995","unstructured":"Crochemore, M., Rytter, W.: Squares, cubes, and time-space efficient string searching. Algorithmica 13(5), 405\u2013425 (1995). \nhttps:\/\/doi.org\/10.1007\/BF01190846","journal-title":"Algorithmica"},{"key":"19_CR10","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1016\/j.dam.2014.08.016","volume":"180","author":"A Deza","year":"2015","unstructured":"Deza, A., Franek, F., Thierry, A.: How many double squares can a string contain? Discrete Appl. Math. 180, 52\u201369 (2015). \nhttps:\/\/doi.org\/10.1016\/j.dam.2014.08.016","journal-title":"Discrete Appl. Math."},{"issue":"1","key":"19_CR11","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). \nhttps:\/\/doi.org\/10.1090\/S0002-9939-1965-0174934-9","journal-title":"Proc. Am. Math. Soc."},{"key":"19_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1007\/978-3-319-23826-5_27","volume-title":"String Processing and Information Retrieval","author":"J Fischer","year":"2015","unstructured":"Fischer, J., Holub, \u0160., I, T., Lewenstein, M.: Beyond the runs theorem. In: Iliopoulos, C., Puglisi, S., Yilmaz, E. (eds.) SPIRE 2015. LNCS, vol. 9309, pp. 277\u2013286. Springer, Cham (2015). \nhttps:\/\/doi.org\/10.1007\/978-3-319-23826-5_27"},{"issue":"1","key":"19_CR13","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. Theory Ser. A 82(1), 112\u2013120 (1998). \nhttps:\/\/doi.org\/10.1006\/jcta.1997.2843","journal-title":"J. Comb. Theory Ser. A"},{"issue":"1","key":"19_CR14","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1016\/S0304-3975(98)00252-7","volume":"218","author":"AS Fraenkel","year":"1999","unstructured":"Fraenkel, A.S., Simpson, J.: The exact number of squares in Fibonacci words. Theor. Comput. Sci. 218(1), 95\u2013106 (1999). \nhttps:\/\/doi.org\/10.1016\/S0304-3975(98)00252-7","journal-title":"Theor. Comput. Sci."},{"key":"19_CR15","doi-asserted-by":"publisher","unstructured":"Gawrychowski, P., Kociumaka, T., Rytter, W., Walen, T.: Faster longest common extension queries in strings over general alphabets. In: Grossi, R., Lewenstein, M. (eds.) 27th Annual Symposium on Combinatorial Pattern Matching (CPM 2016), 27\u201329 June 2016, Tel Aviv, Israel. LIPIcs, vol. 54, pp. 5:1\u20135:13. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2016). \nhttps:\/\/doi.org\/10.4230\/LIPIcs.CPM.2016.5","DOI":"10.4230\/LIPIcs.CPM.2016.5"},{"issue":"3","key":"19_CR16","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1016\/j.tcs.2007.03.025","volume":"380","author":"L Ilie","year":"2007","unstructured":"Ilie, L.: A note on the number of squares in a word. Theor. Comput. Sci. 380(3), 373\u2013376 (2007). \nhttps:\/\/doi.org\/10.1016\/j.tcs.2007.03.025\n\n. (Combinatorics on Words)","journal-title":"Theor. Comput. Sci."},{"key":"19_CR17","doi-asserted-by":"publisher","unstructured":"Kempa, D., Kociumaka, T.: String synchronizing sets: sublinear-time BWT construction and optimal LCE data structure. In: Charikar, M., Cohen, E. (eds.) Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing (STOC 2019), Phoenix, AZ, USA, 23\u201326 June 2019, pp. 756\u2013767. ACM (2019). \nhttps:\/\/doi.org\/10.1145\/3313276.3316368","DOI":"10.1145\/3313276.3316368"},{"issue":"2","key":"19_CR18","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1137\/0206024","volume":"6","author":"DE Knuth","year":"1977","unstructured":"Knuth, D.E., Morris Jr., J.H., Pratt, V.R.: Fast pattern matching in strings. SIAM J. Comput. 6(2), 323\u2013350 (1977). \nhttps:\/\/doi.org\/10.1137\/0206024","journal-title":"SIAM J. Comput."},{"key":"19_CR19","doi-asserted-by":"publisher","unstructured":"Kolpakov, R.M., Kucherov, G.: Finding maximal repetitions in a word in linear time. In: 40th Annual Symposium on Foundations of Computer Science (FOCS 1099), 17\u201318 October 1999, New York, NY, USA, pp. 596\u2013604. IEEE Computer Society (1999). \nhttps:\/\/doi.org\/10.1109\/SFFCS.1999.814634","DOI":"10.1109\/SFFCS.1999.814634"},{"issue":"3","key":"19_CR20","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1016\/j.ipl.2015.11.016","volume":"116","author":"D Kosolobov","year":"2016","unstructured":"Kosolobov, D.: Computing runs on a general alphabet. Inf. Proc. Lett. 116(3), 241\u2013244 (2016). \nhttps:\/\/doi.org\/10.1016\/j.ipl.2015.11.016","journal-title":"Inf. Proc. Lett."},{"key":"19_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1007\/978-3-030-28796-2_9","volume-title":"Combinatorics on Words","author":"A Carpi","year":"2019","unstructured":"Carpi, A., D\u2019Alessandro, F.: On the commutative equivalence of bounded semi-linear codes. In: Merca\u015f, R., Reidenbach, D. (eds.) WORDS 2019. LNCS, vol. 11682, pp. 119\u2013132. Springer, Cham (2019). \nhttps:\/\/doi.org\/10.1007\/978-3-030-28796-2_9"},{"issue":"2","key":"19_CR22","doi-asserted-by":"publisher","first-page":"202","DOI":"10.2307\/1990868","volume":"77","author":"RC Lyndon","year":"1954","unstructured":"Lyndon, R.C.: On Burnside\u2019s problem. Trans. Am. Math. Soc. 77(2), 202\u2013202 (1954). \nhttps:\/\/doi.org\/10.2307\/1990868","journal-title":"Trans. Am. Math. Soc."},{"issue":"1","key":"19_CR23","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1016\/j.tcs.2008.04.020","volume":"401","author":"SJ Puglisi","year":"2008","unstructured":"Puglisi, S.J., Simpson, J., Smyth, W.: How many runs can a string contain? Theor. Comput. Sci. 401(1), 165\u2013171 (2008). \nhttps:\/\/doi.org\/10.1016\/j.tcs.2008.04.020","journal-title":"Theor. Comput. Sci."},{"key":"19_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"184","DOI":"10.1007\/11672142_14","volume-title":"STACS 2006","author":"W Rytter","year":"2006","unstructured":"Rytter, W.: The number of runs in a string: improved analysis of the linear upper bound. In: Durand, B., Thomas, W. (eds.) STACS 2006. LNCS, vol. 3884, pp. 184\u2013195. Springer, Heidelberg (2006). \nhttps:\/\/doi.org\/10.1007\/11672142_14"}],"container-title":["Lecture Notes in Computer Science","String Processing and Information Retrieval"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-59212-7_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,9,16]],"date-time":"2020-09-16T10:10:05Z","timestamp":1600251005000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-59212-7_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030592110","9783030592127"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-59212-7_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"17 September 2020","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":"Orlando, FL","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 October 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 October 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"spire2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.cs.ucf.edu\/spire2020\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Easychair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"32","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"17","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"4","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"53% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"4","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}