{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,8]],"date-time":"2026-02-08T15:58:03Z","timestamp":1770566283085,"version":"3.49.0"},"publisher-location":"Cham","reference-count":25,"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_5","type":"book-chapter","created":{"date-parts":[[2020,9,16]],"date-time":"2020-09-16T10:05:34Z","timestamp":1600250734000},"page":"60-75","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Internal Quasiperiod Queries"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6024-1557","authenticated-orcid":false,"given":"Maxime","family":"Crochemore","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2477-1702","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,9,17]]},"reference":[{"issue":"2","key":"5_CR1","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1145\/1240233.1240242","volume":"3","author":"A Amir","year":"2007","unstructured":"Amir, A., Landau, G.M., Lewenstein, M., Sokol, D.: Dynamic text and static pattern matching. ACM Trans. Algorithms 3(2), 19 (2007). \nhttps:\/\/doi.org\/10.1145\/1240233.1240242","journal-title":"ACM Trans. Algorithms"},{"issue":"1","key":"5_CR2","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":"5_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."},{"key":"5_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1007\/10719839_9","volume-title":"LATIN 2000: Theoretical Informatics","author":"MA Bender","year":"2000","unstructured":"Bender, M.A., Farach-Colton, M.: The LCA problem revisited. In: Gonnet, G.H., Viola, A. (eds.) LATIN 2000. LNCS, vol. 1776, pp. 88\u201394. Springer, Heidelberg (2000). \nhttps:\/\/doi.org\/10.1007\/10719839_9"},{"issue":"1","key":"5_CR5","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1006\/inco.1995.1162","volume":"123","author":"O Berkman","year":"1995","unstructured":"Berkman, O., Iliopoulos, C.S., Park, K.: The subtree max gap problem with application to parallel string covering. Inf. Comput. 123(1), 127\u2013137 (1995). \nhttps:\/\/doi.org\/10.1006\/inco.1995.1162","journal-title":"Inf. Comput."},{"issue":"6","key":"5_CR6","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."},{"issue":"5","key":"5_CR7","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1016\/0020-0190(94)90060-4","volume":"49","author":"D Breslauer","year":"1994","unstructured":"Breslauer, D.: Testing string superprimitivity in parallel. Inf. Process. Lett. 49(5), 235\u2013241 (1994). \nhttps:\/\/doi.org\/10.1016\/0020-0190(94)90060-4","journal-title":"Inf. Process. Lett."},{"key":"5_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1007\/978-3-642-31265-6_3","volume-title":"Combinatorial Pattern Matching","author":"M Crochemore","year":"2012","unstructured":"Crochemore, M., et al.: The maximum number of squares in a tree. In: K\u00e4rkk\u00e4inen, J., Stoye, J. (eds.) CPM 2012. LNCS, vol. 7354, pp. 27\u201340. Springer, Heidelberg (2012). \nhttps:\/\/doi.org\/10.1007\/978-3-642-31265-6_3"},{"key":"5_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"258","DOI":"10.1007\/978-3-642-16321-0_27","volume-title":"String Processing and Information Retrieval","author":"M Crochemore","year":"2010","unstructured":"Crochemore, M., Iliopoulos, C., Kubica, M., Radoszewski, J., Rytter, W., Wale\u0144, T.: Extracting powers and periods in a string from its runs structure. In: Chavez, E., Lonardi, S. (eds.) SPIRE 2010. LNCS, vol. 6393, pp. 258\u2013269. Springer, Heidelberg (2010). \nhttps:\/\/doi.org\/10.1007\/978-3-642-16321-0_27"},{"key":"5_CR10","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."},{"key":"5_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1007\/978-3-030-39881-1_7","volume-title":"WALCOM: Algorithms and Computation","author":"M Crochemore","year":"2020","unstructured":"Crochemore, M., et al.: Shortest covers of all cyclic shifts of a string. In: Rahman, M.S., Sadakane, K., Sung, W.-K. (eds.) WALCOM 2020. LNCS, vol. 12049, pp. 69\u201380. Springer, Cham (2020). \nhttps:\/\/doi.org\/10.1007\/978-3-030-39881-1_7"},{"key":"5_CR12","unstructured":"Czajka, P., Radoszewski, J.: Experimental evaluation of algorithms for computing quasiperiods. CoRR abs\/1909.11336 (2019). \nhttp:\/\/arxiv.org\/abs\/1909.11336"},{"key":"5_CR13","doi-asserted-by":"publisher","unstructured":"Gawrychowski, P., Radoszewski, J., Starikovskaya, T.: Quasi-periodicity in streams. In: Pisanti, N., Pissis, S.P. (eds.) 30th Annual Symposium on Combinatorial Pattern Matching, CPM 2019. LIPIcs, Pisa, Italy, 18\u201320 June 2019, vol. 128, pp. 22:1\u201322:14. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2019). \nhttps:\/\/doi.org\/10.4230\/LIPIcs.CPM.2019.22","DOI":"10.4230\/LIPIcs.CPM.2019.22"},{"issue":"3","key":"5_CR14","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":"6","key":"5_CR15","doi-asserted-by":"publisher","first-page":"918","DOI":"10.1145\/1217856.1217858","volume":"53","author":"J K\u00e4rkk\u00e4inen","year":"2006","unstructured":"K\u00e4rkk\u00e4inen, J., Sanders, P., Burkhardt, S.: Linear work suffix array construction. J. ACM 53(6), 918\u2013936 (2006). \nhttps:\/\/doi.org\/10.1145\/1217856.1217858","journal-title":"J. ACM"},{"key":"5_CR16","unstructured":"Kociumaka, T.: Efficient data structures for internal queries in texts. Ph.D. thesis, University of Warsaw (2018). \nhttps:\/\/mimuw.edu.pl\/~kociumaka\/files\/phd.pdf"},{"key":"5_CR17","doi-asserted-by":"publisher","unstructured":"Kociumaka, T., Kubica, M., Radoszewski, J., Rytter, W., Wale\u0144, T.: A linear-time algorithm for seeds computation. ACM Trans. Algorithms 16(2) (2020). \nhttps:\/\/doi.org\/10.1145\/3386369","DOI":"10.1145\/3386369"},{"key":"5_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"421","DOI":"10.1007\/978-3-030-13435-8_31","volume-title":"Language and Automata Theory and Applications","author":"T Kociumaka","year":"2019","unstructured":"Kociumaka, T., Radoszewski, J., Rytter, W., Straszy\u0144ski, J., Wale\u0144, T., Zuba, W.: Efficient representation and counting of antipower factors in words. In: Mart\u00edn-Vide, C., Okhotin, A., Shapira, D. (eds.) LATA 2019. LNCS, vol. 11417, pp. 421\u2013433. Springer, Cham (2019). \nhttps:\/\/doi.org\/10.1007\/978-3-030-13435-8_31"},{"key":"5_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"284","DOI":"10.1007\/978-3-642-34109-0_30","volume-title":"String Processing and Information Retrieval","author":"T Kociumaka","year":"2012","unstructured":"Kociumaka, T., Radoszewski, J., Rytter, W., Wale\u0144, T.: Efficient data structures for the factor periodicity problem. In: Calder\u00f3n-Benavides, L., Gonz\u00e1lez-Caro, C., Ch\u00e1vez, E., Ziviani, N. (eds.) SPIRE 2012. LNCS, vol. 7608, pp. 284\u2013294. Springer, Heidelberg (2012). \nhttps:\/\/doi.org\/10.1007\/978-3-642-34109-0_30"},{"key":"5_CR20","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"},{"key":"5_CR21","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 1999, New York, NY, USA, 17\u201318 October 1999, pp. 596\u2013604. IEEE Computer Society (1999). \nhttps:\/\/doi.org\/10.1109\/SFFCS.1999.814634","DOI":"10.1109\/SFFCS.1999.814634"},{"issue":"1","key":"5_CR22","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":"5_CR23","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":"5_CR24","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":"5_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1007\/978-3-540-70575-8_8","volume-title":"Automata, Languages and Programming","author":"M Ru\u017ei\u0107","year":"2008","unstructured":"Ru\u017ei\u0107, M.: Constructing efficient dictionaries in close to sorting time. In: Aceto, L., Damg\u00e5rd, I., Goldberg, L.A., Halld\u00f3rsson, M.M., Ing\u00f3lfsd\u00f3ttir, A., Walukiewicz, I. (eds.) ICALP 2008. LNCS, vol. 5125, pp. 84\u201395. Springer, Heidelberg (2008). \nhttps:\/\/doi.org\/10.1007\/978-3-540-70575-8_8"}],"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_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,9,16]],"date-time":"2020-09-16T10:06:13Z","timestamp":1600250773000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-59212-7_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030592110","9783030592127"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-59212-7_5","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)"}}]}}