{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T02:26:44Z","timestamp":1742956004491,"version":"3.40.3"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031439797"},{"type":"electronic","value":"9783031439803"}],"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-43980-3_24","type":"book-chapter","created":{"date-parts":[[2023,9,19]],"date-time":"2023-09-19T12:02:15Z","timestamp":1695124935000},"page":"297-309","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["String Covers of\u00a0a\u00a0Tree Revisited"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7332-6533","authenticated-orcid":false,"given":"\u0141ukasz","family":"Kondraciuk","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,9,20]]},"reference":[{"key":"24_CR1","unstructured":"Alstrup, S., Husfeldt, T., Rauhe, T.: Marked ancestor problems. In: 39th Annual Symposium on Foundations of Computer Science, FOCS 1998, 8\u201311 November 1998, Palo Alto, California, USA, pp. 534\u2013544. IEEE Computer Society (1998)"},{"issue":"2","key":"24_CR2","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1016\/0304-3975(93)90159-Q","volume":"119","author":"A Apostolico","year":"1993","unstructured":"Apostolico, A., Ehrenfeucht, A.: Efficient detection of quasiperiodicities in strings. Theor. Comput. Sci. 119(2), 247\u2013265 (1993)","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"24_CR3","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)","journal-title":"Inf. Process. Lett."},{"issue":"6","key":"24_CR4","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)","journal-title":"Inf. Process. Lett."},{"key":"24_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1007\/978-3-319-21500-6_12","volume-title":"Developments in Language Theory","author":"S Brlek","year":"2015","unstructured":"Brlek, S., Lafreni\u00e8re, N., Proven\u00e7al, X.: Palindromic complexity of trees. In: Potapov, I. (ed.) DLT 2015. LNCS, vol. 9168, pp. 155\u2013166. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-21500-6_12"},{"key":"24_CR6","volume-title":"Introduction to Algorithms","author":"TH Cormen","year":"2001","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, 2nd edn. The MIT Press, Cambridge (2001)","edition":"2"},{"key":"24_CR7","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). https:\/\/doi.org\/10.1007\/978-3-642-31265-6_3"},{"key":"24_CR8","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1016\/j.tcs.2020.11.033","volume":"854","author":"P Czajka","year":"2021","unstructured":"Czajka, P., Radoszewski, J.: Experimental evaluation of algorithms for computing quasiperiods. Theor. Comput. Sci. 854, 17\u201329 (2021)","journal-title":"Theor. Comput. Sci."},{"key":"24_CR9","unstructured":"Funakoshi, M., Nakashima, Y., Inenaga, S., Bannai, H., Takeda, M.: Computing maximal palindromes and distinct palindromes in a trie. In: Holub, J., Zd\u00e1rek, J. (eds.) Prague Stringology Conference 2019, Prague, Czech Republic, 26\u201328 August 2019, pp. 3\u201315. Czech Technical University in Prague, Faculty of Information Technology, Department of Theoretical Computer Science (2019)"},{"key":"24_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"270","DOI":"10.1007\/978-3-319-23826-5_26","volume-title":"String Processing and Information Retrieval","author":"P Gawrychowski","year":"2015","unstructured":"Gawrychowski, P., Kociumaka, T., Rytter, W., Wale\u0144, T.: Tight bound for the number of distinct palindromes in a tree. In: Iliopoulos, C., Puglisi, S., Yilmaz, E. (eds.) SPIRE 2015. LNCS, vol. 9309, pp. 270\u2013276. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-23826-5_26"},{"key":"24_CR11","first-page":"04","volume":"30","author":"P Gawrychowski","year":"2023","unstructured":"Gawrychowski, P., Kociumaka, T., Rytter, W., Wale\u0144, T.: Tight bound for the number of distinct palindromes in a tree. Electron. J. Comb. 30, 04 (2023)","journal-title":"Electron. J. Comb."},{"key":"24_CR12","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1016\/j.tcs.2014.04.015","volume":"544","author":"T Kociumaka","year":"2014","unstructured":"Kociumaka, T., Pachocki, J., Radoszewski, J., Rytter, W., Wale\u0144, T.: Efficient counting of square substrings in a tree. Theor. Comput. Sci. 544, 60\u201373 (2014)","journal-title":"Theor. Comput. Sci."},{"issue":"3","key":"24_CR13","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)","journal-title":"Algorithmica"},{"key":"24_CR14","unstructured":"Mhaskar, N., Smyth, W.F.: String covering: a survey. CoRR, abs\/2211.11856 (2022)"},{"issue":"2","key":"24_CR15","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\u2019\u2019. Inf. Process. Lett. 54(2), 101\u2013103 (1995)","journal-title":"Inf. Process. Lett."},{"key":"24_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1007\/978-3-030-86692-1_7","volume-title":"String Processing and Information Retrieval","author":"J Radoszewski","year":"2021","unstructured":"Radoszewski, J., Rytter, W., Straszy\u0144ski, J., Wale\u0144, T., Zuba, W.: String covers of a tree. In: Lecroq, T., Touzet, H. (eds.) SPIRE 2021. LNCS, vol. 12944, pp. 68\u201382. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-86692-1_7"},{"key":"24_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1007\/3-540-46632-0_24","volume-title":"Algorithms and Computation","author":"T Shibuya","year":"1999","unstructured":"Shibuya, T.: Constructing the suffix tree of a tree with a large alphabet. In: ISAAC 1999. LNCS, vol. 1741, pp. 225\u2013236. Springer, Heidelberg (1999). https:\/\/doi.org\/10.1007\/3-540-46632-0_24"},{"key":"24_CR18","unstructured":"Stroustrup, B.: The C++ Programming Language - Special Edition, 3rd edn. Addison-Wesley (2007)"},{"key":"24_CR19","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1016\/j.tcs.2021.07.011","volume":"887","author":"R Sugahara","year":"2021","unstructured":"Sugahara, R., Nakashima, Y., Inenaga, S., Bannai, H., Takeda, M.: Efficiently computing runs on a trie. Theor. Comput. Sci. 887, 143\u2013151 (2021)","journal-title":"Theor. Comput. Sci."}],"container-title":["Lecture Notes in Computer Science","String Processing and Information Retrieval"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-43980-3_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,19]],"date-time":"2023-09-19T12:04:32Z","timestamp":1695125072000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-43980-3_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031439797","9783031439803"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-43980-3_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"20 September 2023","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":"Pisa","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","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":"26 September 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28 September 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"spire2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/spire2023.isti.cnr.it\/","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":"47","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":"31","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":"0","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":"66% - 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":"3","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)"}}]}}