{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,5]],"date-time":"2026-02-05T06:55:23Z","timestamp":1770274523372,"version":"3.49.0"},"publisher-location":"Cham","reference-count":35,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031270505","type":"print"},{"value":"9783031270512","type":"electronic"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"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":[[2023]]},"DOI":"10.1007\/978-3-031-27051-2_13","type":"book-chapter","created":{"date-parts":[[2023,3,13]],"date-time":"2023-03-13T00:03:35Z","timestamp":1678665815000},"page":"139-150","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Finding the\u00a0Cyclic Covers of\u00a0a\u00a0String"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7985-4222","authenticated-orcid":false,"given":"Roberto","family":"Grossi","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-0001-6859-8932","authenticated-orcid":false,"given":"Jesper","family":"Jansson","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6528-6060","authenticated-orcid":false,"given":"Zara","family":"Lim","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7806-7086","authenticated-orcid":false,"given":"Wing-Kin","family":"Sung","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":[[2023,3,13]]},"reference":[{"key":"13_CR1","unstructured":"Alzamel, M., et al.: Finding the anticover of a string. In: 31st Annual Symposium on Combinatorial Pattern Matching (CPM 2020), vol. 161 (2020)"},{"key":"13_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1007\/978-3-030-32686-9_13","volume-title":"String Processing and Information Retrieval","author":"M Alzamel","year":"2019","unstructured":"Alzamel, M., et al.: Online algorithms on antipowers and antiperiods. In: Brisaboa, N.R., Puglisi, S.J. (eds.) SPIRE 2019. LNCS, vol. 11811, pp. 175\u2013188. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-32686-9_13"},{"key":"13_CR3","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1016\/j.tcs.2019.05.020","volume":"793","author":"A Amir","year":"2019","unstructured":"Amir, A., Levy, A., Lubin, R., Porat, E.: Approximate cover of strings. Theor. Comput. Sci. 793, 59\u201369 (2019). https:\/\/doi.org\/10.1016\/j.tcs.2019.05.020","journal-title":"Theor. Comput. Sci."},{"issue":"2","key":"13_CR4","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1007\/BF01191471","volume":"28","author":"A Apostolico","year":"1995","unstructured":"Apostolico, A., Crochemore, M.: Fast parallel Lyndon factorization with applications. Math. Syst. Theor. 28(2), 89\u2013108 (1995). https:\/\/doi.org\/10.1007\/BF01191471","journal-title":"Math. Syst. Theor."},{"issue":"2","key":"13_CR5","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1016\/0304-3975(93)90159-Q","volume":"119","author":"A Apostolico","year":"1993","unstructured":"Apostolico, A., Ehrenfeucht, A.: Efficient detection of quasiperiodicities in strings. Theor. Comput. Sci. 119(2), 247\u2013265 (1993)","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"13_CR6","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)","journal-title":"Inf. Process. Lett."},{"issue":"4\u20135","key":"13_CR7","doi-asserted-by":"publisher","first-page":"240","DOI":"10.1016\/0020-0190(80)90149-0","volume":"10","author":"KS Booth","year":"1980","unstructured":"Booth, K.S.: Lexicographically least circular substrings. Inf. Process. Lett. 10(4\u20135), 240\u2013242 (1980)","journal-title":"Inf. Process. Lett."},{"issue":"6","key":"13_CR8","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)","journal-title":"Inf. Process. Lett."},{"issue":"4","key":"13_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2635814","volume":"10","author":"D Breslauer","year":"2014","unstructured":"Breslauer, D., Galil, Z.: Real-time streaming string-matching. ACM Trans. Algorithms 10(4), 1\u201312 (2014). https:\/\/doi.org\/10.1145\/2635814","journal-title":"ACM Trans. Algorithms"},{"key":"13_CR10","doi-asserted-by":"publisher","first-page":"17","DOI":"10.46298\/dmtcs.296","volume":"5","author":"A \u010cern\u1ef3","year":"2002","unstructured":"\u010cern\u1ef3, A.: Lyndon factorization of generalized words of Thue. Discrete Math. Theor. Comput. Sci. 5, 17\u201346 (2002)","journal-title":"Discrete Math. Theor. Comput. Sci."},{"key":"13_CR11","doi-asserted-by":"publisher","first-page":"104464","DOI":"10.1016\/j.ic.2019.104464","volume":"270","author":"A Conte","year":"2020","unstructured":"Conte, A., Grossi, R., Marino, A.: Large-scale clique cover of real-world networks. Inf. Comput. 270, 104464 (2020)","journal-title":"Inf. Comput."},{"key":"13_CR12","doi-asserted-by":"crossref","unstructured":"Crochemore, M., et al.: Shortest covers of all cyclic shifts of a string. Theor. Comput. Sci. 866, 70\u201381 (2021)","DOI":"10.1016\/j.tcs.2021.03.011"},{"key":"13_CR13","doi-asserted-by":"publisher","DOI":"10.1142\/4838","volume-title":"Jewels of Stringology: Text Algorithms","author":"M Crochemore","year":"2002","unstructured":"Crochemore, M., Rytter, W.: Jewels of Stringology: Text Algorithms. World Scientific, Singapore (2002)"},{"issue":"4","key":"13_CR14","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1016\/0196-6774(83)90017-2","volume":"4","author":"JP Duval","year":"1983","unstructured":"Duval, J.P.: Factorizing words over an ordered alphabet. J. Algorithms 4(4), 363\u2013381 (1983)","journal-title":"J. Algorithms"},{"issue":"1","key":"13_CR15","doi-asserted-by":"publisher","first-page":"109","DOI":"10.2307\/2034009","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). https:\/\/doi.org\/10.2307\/2034009","journal-title":"Proc. Am. Math. Soc."},{"issue":"3","key":"13_CR16","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1016\/0012-365X(78)90002-X","volume":"23","author":"H Fredricksen","year":"1978","unstructured":"Fredricksen, H., Maiorana, J.: Necklaces of beads in $$k$$ colors and $$k$$-ary de Bruijn sequences. Discret. Math. 23(3), 207\u2013210 (1978)","journal-title":"Discret. Math."},{"issue":"1\u20133","key":"13_CR17","doi-asserted-by":"publisher","first-page":"144","DOI":"10.1016\/S0019-9958(85)80031-0","volume":"67","author":"Z Galil","year":"1985","unstructured":"Galil, Z.: Optimal parallel algorithms for string matching. Inf. Control. 67(1\u20133), 144\u2013157 (1985). https:\/\/doi.org\/10.1016\/S0019-9958(85)80031-0","journal-title":"Inf. Control."},{"issue":"4","key":"13_CR18","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1145\/270563.571472","volume":"28","author":"D Gusfield","year":"1997","unstructured":"Gusfield, D.: Algorithms on strings, trees, and sequences: computer science and computational biology. ACM Sigact News 28(4), 41\u201360 (1997)","journal-title":"ACM Sigact News"},{"key":"13_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"943","DOI":"10.1007\/3-540-45061-0_73","volume-title":"Automata, Languages and Programming","author":"J K\u00e4rkk\u00e4inen","year":"2003","unstructured":"K\u00e4rkk\u00e4inen, J., Sanders, P.: Simple linear work suffix array construction. In: Baeten, J.C.M., Lenstra, J.K., Parrow, J., Woeginger, G.J. (eds.) ICALP 2003. LNCS, vol. 2719, pp. 943\u2013955. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/3-540-45061-0_73"},{"key":"13_CR20","unstructured":"Kociumaka, T.: Efficient data structures for internal queries in texts. Ph.D. thesis, University of Warsaw, October 2018 (2018). https:\/\/www.mimuw.edu.pl\/kociumaka\/files\/phd.pdf"},{"key":"13_CR21","doi-asserted-by":"crossref","unstructured":"Kociumaka, T., Kubica, M., Radoszewski, J., Rytter, W., Wale\u0144, T.: A linear time algorithm for seeds computation. In: Proceedings of the 23rd Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 1095\u20131112. SIAM (2012)","DOI":"10.1137\/1.9781611973099.86"},{"issue":"1","key":"13_CR22","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1007\/s00453-014-9915-3","volume":"73","author":"T Kociumaka","year":"2014","unstructured":"Kociumaka, T., Pissis, S.P., Radoszewski, J., Rytter, W., Wale\u0144, T.: Fast algorithm for partial covers in words. Algorithmica 73(1), 217\u2013233 (2014). https:\/\/doi.org\/10.1007\/s00453-014-9915-3","journal-title":"Algorithmica"},{"key":"13_CR23","doi-asserted-by":"crossref","unstructured":"Kociumaka, T., Radoszewski, J., Rytter, W., Wale\u0144, T.: Internal pattern matching queries in a text and applications. In: Proceedings of the 26th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 532\u2013551. SIAM (2014)","DOI":"10.1137\/1.9781611973730.36"},{"issue":"1","key":"13_CR24","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). https:\/\/doi.org\/10.1007\/s00453-001-0062-2","journal-title":"Algorithmica"},{"key":"13_CR25","doi-asserted-by":"publisher","unstructured":"Lothaire, M.: Applied combinatorics on words. Encyclopedia of Mathematics and its Applications, Cambridge University Press (2005). https:\/\/doi.org\/10.1017\/CBO9781107341005","DOI":"10.1017\/CBO9781107341005"},{"key":"13_CR26","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781107326019","volume-title":"Algebraic Combinatorics on Words","author":"M Lothaire","year":"2002","unstructured":"Lothaire, M.: Algebraic Combinatorics on Words, vol. 90. Cambridge University Press, New York (2002)"},{"key":"13_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1007\/3-540-60922-9_13","volume-title":"STACS 96","author":"G Melan\u00e7on","year":"1996","unstructured":"Melan\u00e7on, G.: Lyndon factorization of infinite words. In: Puech, C., Reischuk, R. (eds.) STACS 1996. LNCS, vol. 1046, pp. 147\u2013154. Springer, Heidelberg (1996). https:\/\/doi.org\/10.1007\/3-540-60922-9_13"},{"issue":"1\u20133","key":"13_CR28","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1016\/S0012-365X(99)00123-5","volume":"210","author":"G Melan\u00e7on","year":"2000","unstructured":"Melan\u00e7on, G.: Lyndon factorization of Sturmian words. Discret. Math. 210(1\u20133), 137\u2013149 (2000)","journal-title":"Discret. Math."},{"key":"13_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-63220-4_45","volume-title":"Combinatorial Pattern Matching","author":"M Miyazaki","year":"1997","unstructured":"Miyazaki, M., Shinohara, A., Takeda, M.: An improved pattern matching algorithm for strings in terms of straight-line programs. In: Apostolico, A., Hein, J. (eds.) CPM 1997. LNCS, vol. 1264, pp. 1\u201311. Springer, Heidelberg (1997). https:\/\/doi.org\/10.1007\/3-540-63220-4_45"},{"key":"13_CR30","unstructured":"Moore, D., Smyth, W.F.: Computing the covers of a string in linear time. In: Proceedings of the 5th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 511\u2013515. SODA\u201994, Society for Industrial and Applied Mathematics, USA (1994)"},{"issue":"2","key":"13_CR31","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1090\/S0002-9939-1959-0106853-5","volume":"10","author":"RZ Norman","year":"1959","unstructured":"Norman, R.Z., Rabin, M.O.: An algorithm for a minimum cover of a graph. Proc. Am. Math. Soc. 10(2), 315\u2013319 (1959)","journal-title":"Proc. Am. Math. Soc."},{"key":"13_CR32","first-page":"187","volume":"63","author":"G Robin","year":"1984","unstructured":"Robin, G.: Grandes valeurs de la fonction somme des diviseurs et hypothese de Riemann. J. Math. Pures Appl. 63, 187\u2013213 (1984)","journal-title":"J. Math. Pures Appl."},{"issue":"2","key":"13_CR33","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1016\/0196-6774(81)90013-4","volume":"2","author":"Y Shiloach","year":"1981","unstructured":"Shiloach, Y.: Fast canonization of circular strings. J. Algorithms 2(2), 107\u2013121 (1981)","journal-title":"J. Algorithms"},{"key":"13_CR34","doi-asserted-by":"publisher","first-page":"e51971","DOI":"10.7554\/eLife.51971","volume":"9","author":"MJ Tisza","year":"2020","unstructured":"Tisza, M.J., et al.: Discovery of several thousand highly diverse circular DNA viruses. Elife 9, e51971 (2020)","journal-title":"Elife"},{"key":"13_CR35","unstructured":"Wagner, E.K., Hewlett, M.J., Bloom, D.C., Camerini, D.: Basic Virology, vol. 3. Blackwell Science, Malden, MA (1999)"}],"container-title":["Lecture Notes in Computer Science","WALCOM: Algorithms and Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-27051-2_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,3,13]],"date-time":"2023-03-13T00:05:09Z","timestamp":1678665909000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-27051-2_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031270505","9783031270512"],"references-count":35,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-27051-2_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"13 March 2023","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 Conference and Workshops on Algorithms and Computation","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Hsinchu","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Taiwan","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 March 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 March 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"walcom2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.walcom2023.conf.nycu.edu.tw\/","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":"Easy Chair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"75","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":"30","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":"0","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":"40% - 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":"3","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":"10","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)"}},{"value":"This proceeding includes 2 invited papers.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}