{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T10:25:46Z","timestamp":1743071146988,"version":"3.40.3"},"publisher-location":"Cham","reference-count":31,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030592110"},{"type":"electronic","value":"9783030592127"}],"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_18","type":"book-chapter","created":{"date-parts":[[2020,9,16]],"date-time":"2020-09-16T10:05:34Z","timestamp":1600250734000},"page":"247-261","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Efficient Enumeration of Distinct Factors Using Package Representations"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6024-1557","authenticated-orcid":false,"given":"Panagiotis","family":"Charalampopoulos","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2477-1702","authenticated-orcid":false,"given":"Tomasz","family":"Kociumaka","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-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":[{"key":"18_CR1","doi-asserted-by":"publisher","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). LIPIcs, vol. 128, pp. 32:1\u201332:11. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2019). \nhttps:\/\/doi.org\/10.4230\/LIPIcs.CPM.2019.32","DOI":"10.4230\/LIPIcs.CPM.2019.32"},{"key":"18_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). \nhttps:\/\/doi.org\/10.1007\/978-3-030-32686-9_13"},{"issue":"2\u20133","key":"18_CR3","doi-asserted-by":"publisher","first-page":"298","DOI":"10.1016\/j.tcs.2008.01.006","volume":"395","author":"A Amir","year":"2008","unstructured":"Amir, A., Chencinski, E., Iliopoulos, C.S., Kopelowitz, T., Zhang, H.: Property matching and weighted matching. Theor. Comput. Sci. 395(2\u20133), 298\u2013310 (2008). \nhttps:\/\/doi.org\/10.1016\/j.tcs.2008.01.006","journal-title":"Theor. Comput. Sci."},{"key":"18_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). \nhttps:\/\/doi.org\/10.1016\/j.ipl.2018.05.003","journal-title":"Inf. Process. Lett."},{"issue":"5","key":"18_CR5","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":"18_CR6","doi-asserted-by":"publisher","unstructured":"Bannai, H., Inenaga, S., K\u00f6ppl, D.: Computing all distinct squares in linear time for integer alphabets. In: 28th Annual Symposium on Combinatorial Pattern Matching (CPM 2017). LIPIcs, vol. 78, pp. 22:1\u201322:18. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2017). \nhttps:\/\/doi.org\/10.4230\/LIPIcs.CPM.2017.22","DOI":"10.4230\/LIPIcs.CPM.2017.22"},{"key":"18_CR7","doi-asserted-by":"publisher","unstructured":"Barton, C., Kociumaka, T., Liu, C., Pissis, S.P., Radoszewski, J.: Indexing weighted sequences: neat and efficient. Inf. Comput. 270 (2020). \nhttps:\/\/doi.org\/10.1016\/j.ic.2019.104462","DOI":"10.1016\/j.ic.2019.104462"},{"key":"18_CR8","doi-asserted-by":"publisher","unstructured":"Charalampopoulos, P., Iliopoulos, C.S., Liu, C., Pissis, S.P.: Property suffix array with applications in indexing weighted sequences. ACM J. Exp. Algorithm. 25(1) (2020). \nhttps:\/\/doi.org\/10.1145\/3385898","DOI":"10.1145\/3385898"},{"key":"18_CR9","doi-asserted-by":"crossref","unstructured":"Crochemore, M., Hancart, C., Lecroq, T.: Algorithms on Strings. Cambridge University Press (2007)","DOI":"10.1017\/CBO9780511546853"},{"issue":"2","key":"18_CR10","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1016\/j.ipl.2007.10.006","volume":"106","author":"M Crochemore","year":"2008","unstructured":"Crochemore, M., Ilie, L.: Computing longest previous factor in linear time and applications. Inf. Process. Lett. 106(2), 75\u201380 (2008). \nhttps:\/\/doi.org\/10.1016\/j.ipl.2007.10.006","journal-title":"Inf. Process. Lett."},{"key":"18_CR11","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":"18_CR12","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1016\/j.dam.2014.08.016","volume":"180","author":"A Deza","year":"2015","unstructured":"Deza, A., Franek, F., Thierry, A.: How many double squares can a string contain? Discrete Appl. Math. 180, 52\u201369 (2015). \nhttps:\/\/doi.org\/10.1016\/j.dam.2014.08.016","journal-title":"Discrete Appl. Math."},{"key":"18_CR13","doi-asserted-by":"publisher","unstructured":"Farach, M.: Optimal suffix tree construction with large alphabets. In: 38th Annual Symposium on Foundations of Computer Science (FOCS 1997), pp. 137\u2013143. IEEE Computer Society (1997). \nhttps:\/\/doi.org\/10.1109\/SFCS.1997.646102","DOI":"10.1109\/SFCS.1997.646102"},{"key":"18_CR14","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1016\/j.aam.2019.04.001","volume":"108","author":"G Fici","year":"2019","unstructured":"Fici, G., Postic, M., Silva, M.: Abelian antipowers in infinite words. Adv. Appl. Math. 108, 67\u201378 (2019). \nhttps:\/\/doi.org\/10.1016\/j.aam.2019.04.001","journal-title":"Adv. Appl. Math."},{"key":"18_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). \nhttps:\/\/doi.org\/10.1016\/j.jcta.2018.02.009","journal-title":"J. Comb. Theory Ser. A"},{"issue":"1","key":"18_CR16","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). \nhttps:\/\/doi.org\/10.2307\/2034009","journal-title":"Proc. Am. Math. Soc."},{"issue":"1","key":"18_CR17","doi-asserted-by":"publisher","first-page":"112","DOI":"10.1006\/jcta.1997.2843","volume":"82","author":"AS Fraenkel","year":"1998","unstructured":"Fraenkel, A.S., Simpson, J.: How many squares can a string contain? J. Comb. Theory Ser. A 82(1), 112\u2013120 (1998). \nhttps:\/\/doi.org\/10.1006\/jcta.1997.2843","journal-title":"J. Comb. Theory Ser. A"},{"issue":"2","key":"18_CR18","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1016\/0022-0000(85)90014-5","volume":"30","author":"HN Gabow","year":"1985","unstructured":"Gabow, H.N., Tarjan, R.E.: A linear-time algorithm for a special case of disjoint set union. J. Comput. Syst. Sci. 30(2), 209\u2013221 (1985). \nhttps:\/\/doi.org\/10.1016\/0022-0000(85)90014-5","journal-title":"J. Comput. Syst. Sci."},{"issue":"1","key":"18_CR19","doi-asserted-by":"publisher","first-page":"162","DOI":"10.1007\/s00224-017-9794-5","volume":"62","author":"P Gawrychowski","year":"2017","unstructured":"Gawrychowski, P., I, T., Inenaga, S., K\u00f6ppl, D., Manea, F.: Tighter bounds and optimal algorithms for all maximal $$\\alpha $$-gapped repeats and palindromes. Theory Comput. Syst. 62(1), 162\u2013191 (2017). \nhttps:\/\/doi.org\/10.1007\/s00224-017-9794-5","journal-title":"Theory Comput. Syst."},{"issue":"4","key":"18_CR20","doi-asserted-by":"publisher","first-page":"525","DOI":"10.1016\/j.jcss.2004.03.004","volume":"69","author":"D Gusfield","year":"2004","unstructured":"Gusfield, D., Stoye, J.: Linear time algorithms for finding and representing all the tandem repeats in a string. J. Comput. Syst. Sci. 69(4), 525\u2013546 (2004). \nhttps:\/\/doi.org\/10.1016\/j.jcss.2004.03.004","journal-title":"J. Comput. Syst. Sci."},{"key":"18_CR21","doi-asserted-by":"publisher","first-page":"10","DOI":"10.1016\/j.ic.2013.09.001","volume":"232","author":"W Hon","year":"2013","unstructured":"Hon, W., Patil, M., Shah, R., Thankachan, S.V.: Compressed property suffix trees. Inf. Comput. 232, 10\u201318 (2013). \nhttps:\/\/doi.org\/10.1016\/j.ic.2013.09.001","journal-title":"Inf. Comput."},{"key":"18_CR22","doi-asserted-by":"publisher","unstructured":"Kempa, D., Kociumaka, T.: String synchronizing sets: sublinear-time BWT construction and optimal LCE data structure. In: 51st Annual ACM SIGACT Symposium on Theory of Computing (STOC 2019), pp. 756\u2013767. ACM (2019). \nhttps:\/\/doi.org\/10.1145\/3313276.3316368","DOI":"10.1145\/3313276.3316368"},{"key":"18_CR23","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":"18_CR24","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":"18_CR25","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":"18_CR26","unstructured":"Kociumaka, T., Radoszewski, J., Rytter, W., Straszy\u0144ski, J., Wale\u0144, T., Zuba, W.: Efficient representation and counting of antipower factors in words (2020). \nhttps:\/\/arxiv.org\/abs\/1812.08101v3"},{"key":"18_CR27","doi-asserted-by":"publisher","unstructured":"Kociumaka, T., Radoszewski, J., Rytter, W., Wale\u0144, T.: Internal pattern matching queries in a text and applications. In: 26th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2015), pp. 532\u2013551. SIAM (2015). \nhttps:\/\/doi.org\/10.1137\/1.9781611973730.36","DOI":"10.1137\/1.9781611973730.36"},{"issue":"3","key":"18_CR28","doi-asserted-by":"publisher","first-page":"814","DOI":"10.1007\/s00453-016-0271-3","volume":"79","author":"T Kociumaka","year":"2017","unstructured":"Kociumaka, T., Radoszewski, J., Rytter, W., Wale\u0144, T.: String powers in trees. Algorithmica 79(3), 814\u2013834 (2017). \nhttps:\/\/doi.org\/10.1007\/s00453-016-0271-3","journal-title":"Algorithmica"},{"key":"18_CR29","doi-asserted-by":"publisher","unstructured":"Kolpakov, R.: Some results on the number of periodic factors in words. Inf. Comput. 270 (2020). \nhttps:\/\/doi.org\/10.1016\/j.ic.2019.104459","DOI":"10.1016\/j.ic.2019.104459"},{"key":"18_CR30","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), pp. 596\u2013604. IEEE Computer Society (1999). \nhttps:\/\/doi.org\/10.1109\/SFFCS.1999.814634","DOI":"10.1109\/SFFCS.1999.814634"},{"key":"18_CR31","doi-asserted-by":"publisher","unstructured":"Lothaire, M.: Algebraic Combinatorics on Words. Cambridge University Press (2002). \nhttps:\/\/doi.org\/10.1017\/cbo9781107326019","DOI":"10.1017\/cbo9781107326019"}],"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_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,9,16]],"date-time":"2020-09-16T10:10:08Z","timestamp":1600251008000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-59212-7_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030592110","9783030592127"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-59212-7_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"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)"}}]}}