{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T06:50:56Z","timestamp":1742971856048,"version":"3.40.3"},"publisher-location":"Cham","reference-count":17,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031341700"},{"type":"electronic","value":"9783031341717"}],"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-34171-7_29","type":"book-chapter","created":{"date-parts":[[2023,6,1]],"date-time":"2023-06-01T04:02:35Z","timestamp":1685592155000},"page":"359-368","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Local Maximal Equality-Free Periodicities"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0862-7452","authenticated-orcid":false,"given":"Mai","family":"Alzamel","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1123-8703","authenticated-orcid":false,"given":"Jacqueline W.","family":"Daykin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6111-9465","authenticated-orcid":false,"given":"Christopher","family":"Hampson","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3909-0077","authenticated-orcid":false,"given":"Costas S.","family":"Iliopoulos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6528-6060","authenticated-orcid":false,"given":"Zara","family":"Lim","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"W. F.","family":"Smyth","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,6,2]]},"reference":[{"key":"29_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 2019). Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik (2019)"},{"key":"29_CR2","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.) String Processing and Information Retrieval, pp. 175\u2013188. Springer International Publishing, Cham (2019)"},{"key":"29_CR3","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":"29_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/978-3-319-21500-6_6","volume-title":"Developments in Language Theory","author":"H Bannai","year":"2015","unstructured":"Bannai, H., et al.: Diverse palindromic factorization is NP-complete. In: Potapov, I. (ed.) DLT 2015. LNCS, vol. 9168, pp. 85\u201396. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-21500-6_6"},{"key":"29_CR5","unstructured":"Bulteau, L., et al.: Multivariate algorithmics for NP-hard string problems. Bulletin of EATCS 3(114) (2014)"},{"key":"29_CR6","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":"29_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1007\/978-3-540-69733-6_27","volume-title":"Computing and Combinatorics","author":"A Condon","year":"2008","unstructured":"Condon, A., Ma\u0148uch, J., Thachuk, C.: Complexity of a collision-aware string partition problem and its relation to oligo design for gene synthesis. In: Hu, X., Wang, J. (eds.) COCOON 2008. LNCS, vol. 5092, pp. 265\u2013275. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-69733-6_27"},{"key":"29_CR8","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1016\/j.jda.2014.11.002","volume":"32","author":"A Condon","year":"2015","unstructured":"Condon, A., Ma\u0148uch, J., Thachuk, C.: The complexity of string partitioning. J. Discrete Algorithms 32, 24\u201343 (2015)","journal-title":"J. Discrete Algorithms"},{"issue":"3","key":"29_CR9","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1110\/ps.062591607","volume":"16","author":"JC Cox","year":"2007","unstructured":"Cox, J.C., Lape, J., Sayed, M.A., Hellinga, H.W.: Protein fabrication automation. Protein Sci. 16(3), 379\u2013390 (2007)","journal-title":"Protein Sci."},{"key":"29_CR10","doi-asserted-by":"crossref","unstructured":"Defant, C.: Anti-power prefixes of the Thue-Morse word. Electron. J. Comb. 24 (2017)","DOI":"10.37236\/6321"},{"key":"29_CR11","doi-asserted-by":"crossref","unstructured":"Farach, M.: Optimal suffix tree construction with large alphabets. In: Foundations of Computer Science, 1997. Proceedings., 38th Annual Symposium on, pp. 137\u2013143. IEEE (1997)","DOI":"10.1109\/SFCS.1997.646102"},{"key":"29_CR12","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"},{"key":"29_CR13","doi-asserted-by":"crossref","unstructured":"Gaetz, M.: Anti-power $$ j $$-fixes of the thue-morse word. Discrete Math. Theoretical Comput. Sci. 23 (2021)","DOI":"10.46298\/dmtcs.5483"},{"key":"29_CR14","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 Twenty-third Annual ACM-SIAM Symposium on Discrete algorithms, pp. 1095\u20131112. SIAM (2012)","DOI":"10.1137\/1.9781611973099.86"},{"key":"29_CR15","doi-asserted-by":"publisher","DOI":"10.1016\/j.ic.2021.104779","volume":"286","author":"T Kociumaka","year":"2022","unstructured":"Kociumaka, T., Radoszewski, J., Rytter, W., Straszy\u0144ski, J., Wale\u0144, T., Zuba, W.: Efficient representation and counting of antipower factors in words. Inf. Comput. 286, 104779 (2022)","journal-title":"Inf. Comput."},{"issue":"1","key":"29_CR16","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1016\/0378-1119(95)00511-4","volume":"164","author":"WP Stemmer","year":"1995","unstructured":"Stemmer, W.P., Crameri, A., Ha, K.D., Brennan, T.M., Heyneker, H.L.: Single-step assembly of a gene and entire plasmid from large numbers of oligodeoxyribonucleotides. Gene 164(1), 49\u201353 (1995)","journal-title":"Gene"},{"key":"29_CR17","unstructured":"Thue, A.: Uber unendliche zeichenreihen. Norske Vid Selsk. Skr. I Mat-Nat Kl. (Christiana) 7, 1\u201322 (1906)"}],"container-title":["IFIP Advances in Information and Communication Technology","Artificial Intelligence Applications and Innovations. AIAI 2023 IFIP WG 12.5 International Workshops"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-34171-7_29","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,21]],"date-time":"2024-10-21T16:25:25Z","timestamp":1729527925000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-34171-7_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031341700","9783031341717"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-34171-7_29","relation":{},"ISSN":["1868-4238","1868-422X"],"issn-type":[{"type":"print","value":"1868-4238"},{"type":"electronic","value":"1868-422X"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"2 June 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"AIAI","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"IFIP International Conference on Artificial Intelligence Applications and Innovations","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Le\u00f3n","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":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 June 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 June 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"aiai2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/ifipaiai.org\/2023\/","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":"185","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":"75","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":"17","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":"41% - 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":"2,8","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":"3,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":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"This event was held in hybrid mode.","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)"}}]}}