{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,9]],"date-time":"2025-09-09T21:40:44Z","timestamp":1757454044389,"version":"3.40.3"},"publisher-location":"Cham","reference-count":29,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030326852"},{"type":"electronic","value":"9783030326869"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"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":[[2019]]},"DOI":"10.1007\/978-3-030-32686-9_13","type":"book-chapter","created":{"date-parts":[[2019,10,4]],"date-time":"2019-10-04T22:02:27Z","timestamp":1570226547000},"page":"175-188","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Online Algorithms on Antipowers and Antiperiods"],"prefix":"10.1007","author":[{"given":"Mai","family":"Alzamel","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alessio","family":"Conte","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Daniele","family":"Greco","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Veronica","family":"Guerrini","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Costas","family":"Iliopoulos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nadia","family":"Pisanti","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nicola","family":"Prezza","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Giulia","family":"Punzi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Giovanna","family":"Rosone","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,10,3]]},"reference":[{"key":"13_CR1","unstructured":"Alamro, H., Badkobeh, G., Belazzougui, D., Iliopoulos, C.S., Puglisi, S.J.: Computing the Antiperiod(s) of a string. In: 30th Annual Symposium on Combinatorial Pattern Matching (CPM). LIPIcs (2019, to appear)"},{"key":"13_CR2","unstructured":"Alzamel, M., et al.: Quasi-linear-time algorithm for longest common circular factor. In: 30th Annual Symposium on Combinatorial Pattern Matching (CPM). LIPIcs (2019, to appear)"},{"key":"13_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"42","DOI":"10.1007\/978-3-030-00479-8_4","volume-title":"String Processing and Information Retrieval","author":"LAK Ayad","year":"2018","unstructured":"Ayad, L.A.K., et al.: Longest property-preserved common factor. In: Gagie, T., Moffat, A., Navarro, G., Cuadros-Vargas, E. (eds.) SPIRE 2018. LNCS, vol. 11147, pp. 42\u201349. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-030-00479-8_4"},{"key":"13_CR4","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1016\/j.ipl.2018.05.003","volume":"137","author":"G Badkobeh","year":"2018","unstructured":"Badkobeh, G., Fici, G., Puglisi, S.J.: Algorithms for anti-powers in strings. Inf. Process. Lett. 137, 57\u201360 (2018)","journal-title":"Inf. Process. Lett."},{"key":"13_CR5","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1016\/j.tcs.2017.02.018","volume":"710","author":"SW Bae","year":"2018","unstructured":"Bae, S.W., Lee, I.: On finding a longest common palindromic subsequence. Theor. Comput. Sci. 710, 29\u201334 (2018)","journal-title":"Theor. Comput. Sci."},{"key":"13_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1007\/978-3-319-19929-0_6","volume-title":"Combinatorial Pattern Matching","author":"P Bille","year":"2015","unstructured":"Bille, P., G\u00f8rtz, I.L., Knudsen, M.B.T., Lewenstein, M., Vildh\u00f8j, H.W.: Longest common extensions in sublinear space. In: Cicalese, F., Porat, E., Vaccaro, U. (eds.) CPM 2015. LNCS, vol. 9133, pp. 65\u201376. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-19929-0_6"},{"key":"13_CR7","doi-asserted-by":"crossref","unstructured":"Burcroff, A.: ( $$k$$ , $$\\lambda $$ )-anti-powers and other patterns in words. Electron. J. Comb. 25, P4.41 (2018)","DOI":"10.37236\/8032"},{"key":"13_CR8","unstructured":"Chowdhury, S., Hasanl, M., Iqbal, S., Rahman, M.: Computing a longest common palindromic subsequence. Fundam. Inform. 129(4), 329\u2013340 (2014)"},{"issue":"50","key":"13_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(50), 5227\u20135235 (2009). Mathematical Foundations of Computer Science (MFCS 2007)","journal-title":"Theor. Comput. Sci."},{"key":"13_CR10","doi-asserted-by":"publisher","DOI":"10.1142\/4838","volume-title":"Jewels of Stringology","author":"M Crochemore","year":"2002","unstructured":"Crochemore, M., Rytter, W.: Jewels of Stringology. World Scientific, Singapore (2002)"},{"key":"13_CR11","doi-asserted-by":"crossref","unstructured":"Defant, C.: Anti-power prefixes of the Thue-Morse word. Electron. J. Comb. 24, P1.32 (2017)","DOI":"10.37236\/6321"},{"key":"13_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"6","DOI":"10.1007\/BFb0032018","volume-title":"Automata, Languages and Programming","author":"M Dietzfelbinger","year":"1990","unstructured":"Dietzfelbinger, M., Meyer auf der Heide, F.: A new universal class of hash functions and dynamic hashing in real time. In: Paterson, M.S. (ed.) ICALP 1990. LNCS, vol. 443, pp. 6\u201319. Springer, Heidelberg (1990). https:\/\/doi.org\/10.1007\/BFb0032018"},{"key":"13_CR13","doi-asserted-by":"crossref","unstructured":"Dietzfelbinger, M., Karlin, A., Mehlhorn, K., Meyer auF der Heide, F., Rohnert, H., Tarjan, R.E.: Dynamic perfect hashing: upper and lower bounds. SIAM J. Comput. 23(4), 738\u2013761 (1994)","DOI":"10.1137\/S0097539791194094"},{"key":"13_CR14","unstructured":"Fici, G., Restivo, A., Silva, M., Zamboni, L.Q.: Anti-powers in infinite words. In: ICALP 2016. Leibniz International Proceedings in Informatics (LIPIcs), vol. 55, pp. 124:1\u2013124:9. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik, Dagstuhl, Germany (2016)"},{"key":"13_CR15","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1016\/j.jcta.2018.02.009","volume":"157","author":"G Fici","year":"2018","unstructured":"Fici, G., Restivo, A., Silva, M., Zamboni, L.Q.: Anti-powers in infinite words. J. Comb. Theory Ser. A 157, 109\u2013119 (2018)","journal-title":"J. Comb. Theory Ser. A"},{"issue":"2","key":"13_CR16","doi-asserted-by":"publisher","first-page":"465","DOI":"10.1137\/090779759","volume":"40","author":"J Fischer","year":"2011","unstructured":"Fischer, J., Heun, V.: Space-efficient preprocessing schemes for range minimum queries on static arrays. SIAM J. Comput. 40(2), 465\u2013492 (2011)","journal-title":"SIAM J. Comput."},{"key":"13_CR17","doi-asserted-by":"crossref","unstructured":"Gawrychowski, P., Karczmarz, A., Kociumaka, T., \u0141acki, J., Sankowski, P.: Optimal dynamic strings. In: Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2018, pp. 1509\u20131528. Society for Industrial and Applied Mathematics (2018)","DOI":"10.1137\/1.9781611975031.99"},{"key":"13_CR18","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1016\/j.ipl.2017.08.006","volume":"129","author":"S Inenaga","year":"2018","unstructured":"Inenaga, S., Hyyr\u00f6, H.: A hardness result and new algorithm for the longest common palindromic subsequence problem. Inf. Process. Lett. 129, 11\u201315 (2018)","journal-title":"Inf. Process. Lett."},{"key":"13_CR19","unstructured":"Inoue, T., Inenaga, S., Hyyr\u00f6, H., Bannai, H., Takeda, M.: Computing longest common square subsequences. In: 29th Symposium on Combinatorial Pattern Matching (CPM). LIPIcs, vol. 105, pp. 15:1\u201315:13 (2018)"},{"issue":"2","key":"13_CR20","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1147\/rd.312.0249","volume":"31","author":"RM Karp","year":"1987","unstructured":"Karp, R.M., Rabin, M.O.: Efficient randomized pattern-matching algorithms. IBM J. Res. Dev. 31(2), 249\u2013260 (1987)","journal-title":"IBM J. Res. Dev."},{"key":"13_CR21","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). https:\/\/doi.org\/10.1007\/978-3-030-13435-8_31"},{"issue":"13","key":"13_CR22","doi-asserted-by":"publisher","first-page":"3672","DOI":"10.1093\/nar\/gkg617","volume":"31","author":"R Kolpakov","year":"2003","unstructured":"Kolpakov, R., Bana, G., Kucherov, G.: mreps: efficient and flexible detection of tandem repeats in DNA. Nucl. Acids Res. 31(13), 3672\u20133678 (2003). https:\/\/doi.org\/10.1093\/nar\/gkg617","journal-title":"Nucl. Acids Res."},{"issue":"3","key":"13_CR23","doi-asserted-by":"publisher","first-page":"483","DOI":"10.1090\/S0894-0347-1992-1137100-0","volume":"5","author":"HW Lenstra","year":"1992","unstructured":"Lenstra, H.W., Pomerance, C.: A rigorous time bound for factoring integers. J. Am. Math. Soc. 5(3), 483\u2013516 (1992)","journal-title":"J. Am. Math. Soc."},{"issue":"3","key":"13_CR24","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1093\/bioinformatics\/btg404","volume":"20","author":"L Li","year":"2004","unstructured":"Li, L., Jin, R., Kok, P.L., Wan, H.: Pseudo-periodic partitions of biological sequences. Bioinformatics 20(3), 295\u2013306 (2004)","journal-title":"Bioinformatics"},{"key":"13_CR25","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)"},{"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. Cambridge University Press, Cambridge (2002)"},{"key":"13_CR27","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"},{"issue":"3","key":"13_CR28","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1145\/1412700.1412706","volume":"39","author":"M Lothaire","year":"2008","unstructured":"Lothaire, M.: Review of applied combinatorics on words. SIGACT News 39(3), 28\u201330 (2008)","journal-title":"SIGACT News"},{"key":"13_CR29","unstructured":"Thue, A.: Uber unendliche zeichenreihen. Norske Vid Selsk. Skr. I Mat-Nat Kl. (Christiana) 7, 1\u201322 (1906)"}],"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-32686-9_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,1,24]],"date-time":"2021-01-24T05:50:30Z","timestamp":1611467430000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-32686-9_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030326852","9783030326869"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-32686-9_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"3 October 2019","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":"Segovia","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Spain","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 October 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 October 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"spire2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/spire19.lbd.org.es\/","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":"59","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":"28","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":"8","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":"47% - 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":"1","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)"}}]}}