{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T02:16:29Z","timestamp":1743041789208,"version":"3.40.3"},"publisher-location":"Cham","reference-count":22,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030398804"},{"type":"electronic","value":"9783030398811"}],"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"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-39881-1_7","type":"book-chapter","created":{"date-parts":[[2020,1,27]],"date-time":"2020-01-27T03:02:33Z","timestamp":1580094153000},"page":"69-80","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Shortest Covers of All Cyclic Shifts of a String"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1087-1419","authenticated-orcid":false,"given":"Maxime","family":"Crochemore","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3909-0077","authenticated-orcid":false,"given":"Costas S.","family":"Iliopoulos","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0067-6401","authenticated-orcid":false,"given":"Jakub","family":"Radoszewski","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9162-6724","authenticated-orcid":false,"given":"Wojciech","family":"Rytter","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2207-0053","authenticated-orcid":false,"given":"Juliusz","family":"Straszy\u0144ski","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7369-3309","authenticated-orcid":false,"given":"Tomasz","family":"Wale\u0144","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1988-3507","authenticated-orcid":false,"given":"Wiktor","family":"Zuba","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,2,20]]},"reference":[{"issue":"1","key":"7_CR1","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1016\/0020-0190(91)90056-N","volume":"39","author":"A Apostolico","year":"1991","unstructured":"Apostolico, A., Farach, M., Iliopoulos, C.S.: Optimal superprimitivity testing for strings. Inf. Process. Lett. 39(1), 17\u201320 (1991). \nhttps:\/\/doi.org\/10.1016\/0020-0190(91)90056-N","journal-title":"Inf. Process. Lett."},{"issue":"5","key":"7_CR2","doi-asserted-by":"publisher","first-page":"481","DOI":"10.1007\/BF01955046","volume":"15","author":"A Apostolico","year":"1996","unstructured":"Apostolico, A., Preparata, F.P.: Data structures and algorithms for the string statistics problem. Algorithmica 15(5), 481\u2013494 (1996). \nhttps:\/\/doi.org\/10.1007\/BF01955046","journal-title":"Algorithmica"},{"issue":"5","key":"7_CR3","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":"6","key":"7_CR4","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1016\/0020-0190(92)90111-8","volume":"44","author":"D Breslauer","year":"1992","unstructured":"Breslauer, D.: An on-line string superprimitivity test. Inf. Process. Lett. 44(6), 345\u2013347 (1992). \nhttps:\/\/doi.org\/10.1016\/0020-0190(92)90111-8","journal-title":"Inf. Process. Lett."},{"key":"7_CR5","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1016\/j.jda.2012.10.004","volume":"17","author":"M Christou","year":"2012","unstructured":"Christou, M., Crochemore, M., Guth, O., Iliopoulos, C.S., Pissis, S.P.: On left and right seeds of a string. J. Discrete Algorithms 17, 31\u201344 (2012). \nhttps:\/\/doi.org\/10.1016\/j.jda.2012.10.004","journal-title":"J. Discrete Algorithms"},{"key":"7_CR6","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1016\/j.tcs.2011.12.078","volume":"483","author":"M Christou","year":"2013","unstructured":"Christou, M., et al.: Efficient seed computation revisited. Theor. Comput. Sci. 483, 171\u2013181 (2013). \nhttps:\/\/doi.org\/10.1016\/j.tcs.2011.12.078","journal-title":"Theor. Comput. Sci."},{"key":"7_CR7","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., Wale\u0144, 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":"7_CR8","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":"7_CR9","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."},{"key":"7_CR10","doi-asserted-by":"publisher","unstructured":"Farach, M.: Optimal suffix tree construction with large alphabets. In: 38th Annual Symposium on Foundations of Computer Science, FOCS 1997, Miami Beach, Florida, USA, 19\u201322 October 1997, pp. 137\u2013143. IEEE Computer Society (1997). \nhttps:\/\/doi.org\/10.1109\/SFCS.1997.646102","DOI":"10.1109\/SFCS.1997.646102"},{"issue":"1","key":"7_CR11","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":"4","key":"7_CR12","doi-asserted-by":"publisher","first-page":"525","DOI":"10.1016\/j.jcss.2004.03.004","volume":"69","author":"D Gusfield","year":"2004","unstructured":"Gusfield, D., Stoye, J.: Linear time algorithms for finding and representing all the tandem repeats in a string. J. Comput. Syst. Sci. 69(4), 525\u2013546 (2004). \nhttps:\/\/doi.org\/10.1016\/j.jcss.2004.03.004","journal-title":"J. Comput. Syst. Sci."},{"issue":"3","key":"7_CR13","doi-asserted-by":"publisher","first-page":"288","DOI":"10.1007\/BF01955677","volume":"16","author":"CS Iliopoulos","year":"1996","unstructured":"Iliopoulos, C.S., Moore, D.W.G., Park, K.: Covering a string. Algorithmica 16(3), 288\u2013297 (1996). \nhttps:\/\/doi.org\/10.1007\/BF01955677","journal-title":"Algorithmica"},{"issue":"1\u20132","key":"7_CR14","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1016\/S0304-3975(96)00141-7","volume":"172","author":"CS Iliopoulos","year":"1997","unstructured":"Iliopoulos, C.S., Moore, D.W.G., Smyth, W.F.: A characterization of the squares in a Fibonacci string. Theor. Comput. Sci. 172(1\u20132), 281\u2013291 (1997). \nhttps:\/\/doi.org\/10.1016\/S0304-3975(96)00141-7","journal-title":"Theor. Comput. Sci."},{"key":"7_CR15","first-page":"227","volume":"26","author":"CS Iliopoulos","year":"1998","unstructured":"Iliopoulos, C.S., Moore, D.W.G., Smyth, W.F.: The covers of a circular Fibonacci string. J. Comb. Math. Comb. Comput. 26, 227\u2013236 (1998)","journal-title":"J. Comb. Math. Comb. Comput."},{"key":"7_CR16","doi-asserted-by":"publisher","unstructured":"Kociumaka, T., Kubica, M., Radoszewski, J., Rytter, W., Wale\u0144, T.: A linear time algorithm for seeds computation. In: Rabani, Y. (ed.) Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2012, Kyoto, Japan, 17\u201319 January 2012, pp. 1095\u20131112. SIAM (2012). \nhttps:\/\/doi.org\/10.1137\/1.9781611973099.86","DOI":"10.1137\/1.9781611973099.86"},{"key":"7_CR17","unstructured":"Kociumaka, T., Kubica, M., Radoszewski, J., Rytter, W., Wale\u0144, T.: A linear time algorithm for seeds computation. CoRR abs\/1107.2422v2 (2019). \nhttp:\/\/arxiv.org\/abs\/1107.2422v2"},{"key":"7_CR18","doi-asserted-by":"publisher","unstructured":"Kociumaka, T., Radoszewski, J., Rytter, W., Wale\u0144, T.: Internal pattern matching queries in a text and applications. 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. 532\u2013551. SIAM (2015). \nhttps:\/\/doi.org\/10.1137\/1.9781611973730.36","DOI":"10.1137\/1.9781611973730.36"},{"issue":"1","key":"7_CR19","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1007\/s00453-001-0062-2","volume":"32","author":"Y Li","year":"2002","unstructured":"Li, Y., Smyth, W.F.: Computing the cover array in linear time. Algorithmica 32(1), 95\u2013106 (2002). \nhttps:\/\/doi.org\/10.1007\/s00453-001-0062-2","journal-title":"Algorithmica"},{"issue":"5","key":"7_CR20","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1016\/0020-0190(94)00045-X","volume":"50","author":"DWG Moore","year":"1994","unstructured":"Moore, D.W.G., Smyth, W.F.: An optimal algorithm to compute all the covers of a string. Inf. Process. Lett. 50(5), 239\u2013246 (1994). \nhttps:\/\/doi.org\/10.1016\/0020-0190(94)00045-X","journal-title":"Inf. Process. Lett."},{"issue":"2","key":"7_CR21","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1016\/0020-0190(94)00235-Q","volume":"54","author":"DWG Moore","year":"1995","unstructured":"Moore, D.W.G., Smyth, W.F.: A correction to \u201can optimal algorithm to compute all the covers of a string\u201d. Inf. Process. Lett. 54(2), 101\u2013103 (1995). \nhttps:\/\/doi.org\/10.1016\/0020-0190(94)00235-Q","journal-title":"Inf. Process. Lett."},{"key":"7_CR22","unstructured":"S\u00e9\u00e9bold, P.: Propri\u00e9t\u00e9s combinatoires des mots infinis engendr\u00e9s par certains morphismes. Report no. 85-16, LITP, Paris (1985)"}],"container-title":["Lecture Notes in Computer Science","WALCOM: Algorithms and Computation"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-39881-1_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,2,19]],"date-time":"2020-02-19T19:04:59Z","timestamp":1582139099000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-39881-1_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030398804","9783030398811"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-39881-1_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"20 February 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WALCOM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Algorithms and Computation","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Singapore","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Singapore","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":"31 March 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2 April 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"walcom2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.comp.nus.edu.sg\/~walcom20\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}