{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T17:13:18Z","timestamp":1760202798821,"version":"3.40.3"},"publisher-location":"Cham","reference-count":14,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030134341"},{"type":"electronic","value":"9783030134358"}],"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-13435-8_31","type":"book-chapter","created":{"date-parts":[[2019,2,13]],"date-time":"2019-02-13T15:18:36Z","timestamp":1550071116000},"page":"421-433","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Efficient Representation and Counting of Antipower Factors in Words"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2477-1702","authenticated-orcid":false,"given":"Tomasz","family":"Kociumaka","sequence":"first","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":[[2019,2,14]]},"reference":[{"key":"31_CR1","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). \n                      https:\/\/doi.org\/10.1016\/j.ipl.2018.05.003","journal-title":"Inf. Process. Lett."},{"issue":"5","key":"31_CR2","doi-asserted-by":"publisher","first-page":"1501","DOI":"10.1137\/15M1011032","volume":"46","author":"H Bannai","year":"2017","unstructured":"Bannai, H., I, T., Inenaga, S., Nakashima, Y., Takeda, M., Tsuruta, K.: The \u201cruns\u201d theorem. SIAM J. Comput. 46(5), 1501\u20131514 (2017). \n                      https:\/\/doi.org\/10.1137\/15M1011032","journal-title":"SIAM J. Comput."},{"issue":"2","key":"31_CR3","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1016\/j.jalgor.2005.08.001","volume":"57","author":"MA Bender","year":"2005","unstructured":"Bender, M.A., Farach-Colton, M., Pemmasani, G., Skiena, S., Sumazin, P.: Lowest common ancestors in trees and directed acyclic graphs. J. Algorithms 57(2), 75\u201394 (2005). \n                      https:\/\/doi.org\/10.1016\/j.jalgor.2005.08.001","journal-title":"J. Algorithms"},{"key":"31_CR4","unstructured":"Bentley, J.L.: Algorithms for Klee\u2019s rectangle problems. Unpublished notes, Computer Science Department, Carnegie Mellon University (1977)"},{"key":"31_CR5","volume-title":"Introduction to Algorithms","author":"TH Cormen","year":"2009","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, 3rd edn. MIT Press, Cambridge (2009)","edition":"3"},{"key":"31_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1007\/978-3-319-30000-9_19","volume-title":"Language and Automata Theory and Applications","author":"M Crochemore","year":"2016","unstructured":"Crochemore, M., Kolpakov, R., Kucherov, G.: Optimal bounds for computing \n                      \n                        \n                      \n                      $$\\alpha $$\n                    -gapped repeats. In: Dediu, A.-H., Janou\u0161ek, J., Mart\u00edn-Vide, C., Truthe, B. (eds.) LATA 2016. LNCS, vol. 9618, pp. 245\u2013255. Springer, Cham (2016). \n                      https:\/\/doi.org\/10.1007\/978-3-319-30000-9_19"},{"key":"31_CR7","doi-asserted-by":"publisher","unstructured":"Fici, G., Restivo, A., Silva, M., Zamboni, L.Q.: Anti-powers in infinite words. In: Chatzigiannakis, I., Mitzenmacher, M., Rabani, Y., Sangiorgi, D. (eds.) Automata, Languages and Programming, ICALP 2016. LIPIcs, vol. 55, pp. 124:1\u2013124:9. Schloss Dagstuhl-Leibniz-Zentrum f\u00fcr Informatik (2016). \n                      https:\/\/doi.org\/10.4230\/LIPIcs.ICALP.2016.124","DOI":"10.4230\/LIPIcs.ICALP.2016.124"},{"key":"31_CR8","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). \n                      https:\/\/doi.org\/10.1016\/j.jcta.2018.02.009","journal-title":"J. Comb. Theory Ser. A"},{"issue":"1","key":"31_CR9","doi-asserted-by":"publisher","first-page":"162","DOI":"10.1007\/s00224-017-9794-5","volume":"62","author":"P Gawrychowski","year":"2018","unstructured":"Gawrychowski, P., I, T., Inenaga, S., K\u00f6ppl, D., Manea, F.: Tighter bounds and optimal algorithms for all maximal \n                      \n                        \n                      \n                      $$\\alpha $$\n                    -gapped repeats and palindromes: finding all maximal \n                      \n                        \n                      \n                      $$\\alpha $$\n                    -gapped repeats and palindromes in optimal worst case time on integer alphabets. Theory Comput. Syst. 62(1), 162\u2013191 (2018). \n                      https:\/\/doi.org\/10.1007\/s00224-017-9794-5","journal-title":"Theory Comput. Syst."},{"key":"31_CR10","doi-asserted-by":"crossref","unstructured":"Kociumaka, T., Radoszewski, J., Rytter, W., Straszy\u0144ski, J., Wale\u0144, T., Zuba, W.: Efficient representation and counting of antipower factors in words. arXiv preprint \n                      arXiv:1812.08101\n                      \n                     (2018)","DOI":"10.1007\/978-3-030-13435-8_31"},{"key":"31_CR11","doi-asserted-by":"publisher","unstructured":"Kolpakov, R., Kucherov, G.: Finding maximal repetitions in a word in linear time. In: 40th Annual Symposium on Foundations of Computer Science, FOCS 1999, pp. 596\u2013604. IEEE Computer Society (1999). \n                      https:\/\/doi.org\/10.1109\/SFFCS.1999.814634","DOI":"10.1109\/SFFCS.1999.814634"},{"key":"31_CR12","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.jda.2017.10.004","volume":"46\u201347","author":"R Kolpakov","year":"2017","unstructured":"Kolpakov, R., Podolskiy, M., Posypkin, M., Khrapov, N.: Searching of gapped repeats and subrepetitions in a word. J. Discrete Algorithms 46\u201347, 1\u201315 (2017). \n                      https:\/\/doi.org\/10.1016\/j.jda.2017.10.004","journal-title":"J. Discrete Algorithms"},{"key":"31_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"290","DOI":"10.1007\/978-3-319-67428-5_25","volume-title":"String Processing and Information Retrieval","author":"M Rubinchik","year":"2017","unstructured":"Rubinchik, M., Shur, A.M.: Counting palindromes in substrings. In: Fici, G., Sciortino, M., Venturini, R. (eds.) SPIRE 2017. LNCS, vol. 10508, pp. 290\u2013303. Springer, Cham (2017). \n                      https:\/\/doi.org\/10.1007\/978-3-319-67428-5_25"},{"key":"31_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1007\/978-3-319-23826-5_13","volume-title":"String Processing and Information Retrieval","author":"Y Tanimura","year":"2015","unstructured":"Tanimura, Y., Fujishige, Y., I, T., Inenaga, S., Bannai, H., Takeda, M.: A faster algorithm for computing maximal \n                      \n                        \n                      \n                      $$\\alpha $$\n                    -gapped repeats in a string. In: Iliopoulos, C., Puglisi, S., Yilmaz, E. (eds.) SPIRE 2015. LNCS, vol. 9309, pp. 124\u2013136. Springer, Cham (2015). \n                      https:\/\/doi.org\/10.1007\/978-3-319-23826-5_13"}],"container-title":["Lecture Notes in Computer Science","Language and Automata Theory and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-13435-8_31","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,21]],"date-time":"2019-05-21T22:48:12Z","timestamp":1558478892000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-13435-8_31"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030134341","9783030134358"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-13435-8_31","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":"14 February 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"LATA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Language and Automata Theory and Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"St. Petersburg","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Russia","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":"26 March 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 March 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"lata2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/lata2019.irdta.eu\/","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"}},{"value":"Easychair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"98","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"31","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"5","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"32% - 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"}},{"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"}},{"value":"6-7","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}}]}}