{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T14:26:02Z","timestamp":1742999162951,"version":"3.40.3"},"publisher-location":"Cham","reference-count":34,"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_7","type":"book-chapter","created":{"date-parts":[[2023,9,19]],"date-time":"2023-09-19T12:02:15Z","timestamp":1695124935000},"page":"75-88","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Approximation and\u00a0Fixed Parameter Algorithms for\u00a0the\u00a0Approximate Cover Problem"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0708-0838","authenticated-orcid":false,"given":"Guillaume","family":"Blin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3364-1210","authenticated-orcid":false,"given":"Alexandru","family":"Popa","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0006-4621-2705","authenticated-orcid":false,"given":"Mathieu","family":"Raffinot","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5730-6428","authenticated-orcid":false,"given":"Raluca","family":"Uricaru","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,9,20]]},"reference":[{"key":"7_CR1","unstructured":"Amir, A., Levy, A., Lewenstein, M., Lubin, R., Porat, B.: Can we recover the cover? In: 28th Annual Symposium on Combinatorial Pattern Matching, CPM 2017, Warsaw, Poland, 4\u20136 July 2017, pp. 25:1\u201325:15 (2017)"},{"key":"7_CR2","doi-asserted-by":"crossref","unstructured":"Amir, A., Levy, A., Lewenstein, M., Lubin, R., Porat, B.: Can we recover the cover? Algorithmica 81 (2019)","DOI":"10.1007\/s00453-019-00559-8"},{"key":"7_CR3","unstructured":"Amir, A., Levy, A., Lubin, R., Porat, E.: Approximate cover of strings. In: 28th Annual Symposium on Combinatorial Pattern Matching, CPM 2017, Warsaw, Poland, 4\u20136 July 2017, pp. 26:1\u201326:14 (2017)"},{"key":"7_CR4","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1016\/j.tcs.2019.05.020","volume":"793","author":"A Amir","year":"2019","unstructured":"Amir, A., Levy, A., Lubin, R., Porat, E.: Approximate cover of strings. Theor. Comput. Sci. 793, 59\u201369 (2019)","journal-title":"Theor. Comput. Sci."},{"key":"7_CR5","unstructured":"Amir, A., Levy, A., Porat, E.: Quasi-periodicity under mismatch errors. In: Annual Symposium on Combinatorial Pattern Matching, CPM 2018, Qingdao, China, 2\u20134 July 2018, pp. 4:1\u20134:15 (2018)"},{"key":"7_CR6","unstructured":"Antoniou, P., Crochemore, M., Iliopoulos, C.S., Jayasekera, I., Landau, G.M.: Conservative string covering of indeterminate strings. In: Stringology, pp. 108\u2013115 (2008)"},{"key":"7_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1007\/3-540-63246-8_14","volume-title":"Structures in Logic and Computer Science","author":"A Apostolico","year":"1997","unstructured":"Apostolico, A., Breslauer, D.: Of periods, quasiperiods, repetitions and covers. In: Mycielski, J., Rozenberg, G., Salomaa, A. (eds.) Structures in Logic and Computer Science. LNCS, vol. 1261, pp. 236\u2013248. Springer, Heidelberg (1997). https:\/\/doi.org\/10.1007\/3-540-63246-8_14"},{"issue":"2","key":"7_CR8","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":"7_CR9","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."},{"key":"7_CR10","volume-title":"Liapunov Functions and Stability in Control Theory","author":"A Bacciotti","year":"2006","unstructured":"Bacciotti, A., Rosier, L.: Liapunov Functions and Stability in Control Theory. Springer, Heidelberg (2006)"},{"key":"7_CR11","unstructured":"Barton, C., Kociumaka, T., Pissis, S.P., Radoszewski, J.: Efficient index for weighted sequences. In: 27th Annual Symposium on Combinatorial Pattern Matching, CPM 2016, Tel Aviv, Israel, 27\u201329 June 2016, pp. 4:1\u20134:13 (2016)"},{"issue":"6","key":"7_CR12","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."},{"issue":"5","key":"7_CR13","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1016\/0020-0190(94)90060-4","volume":"49","author":"D Breslauer","year":"1994","unstructured":"Breslauer, D.: Testing string superprimitivity in parallel. Inf. Process. Lett. 49(5), 235\u2013241 (1994)","journal-title":"Inf. Process. Lett."},{"key":"7_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"397","DOI":"10.1007\/3-540-45123-4_33","volume-title":"Combinatorial Pattern Matching","author":"GS Brodal","year":"2000","unstructured":"Brodal, G.S., Pedersen, C.N.S.: Finding maximal quasiperiodicities in strings. In: Giancarlo, R., Sankoff, D. (eds.) CPM 2000. LNCS, vol. 1848, pp. 397\u2013411. Springer, Heidelberg (2000). https:\/\/doi.org\/10.1007\/3-540-45123-4_33"},{"issue":"6","key":"7_CR15","doi-asserted-by":"publisher","first-page":"694","DOI":"10.1093\/bioinformatics\/btl674","volume":"23","author":"AK Brodzik","year":"2007","unstructured":"Brodzik, A.K.: Quaternionic periodicity transform: an algebraic solution to the tandem repeat detection problem. Bioinformatics 23(6), 694\u2013700 (2007)","journal-title":"Bioinformatics"},{"issue":"6","key":"7_CR16","doi-asserted-by":"publisher","first-page":"1214","DOI":"10.1089\/cmb.2006.13.1214","volume":"13","author":"M Christodoulakis","year":"2006","unstructured":"Christodoulakis, M., Iliopoulos, C., Mouchard, L., Perdikuri, K., Tsakalidis, A., Tsichlas, K.: Computation of repetitions and regularities of biologically weighted sequences. J. Comput. Biol. 13(6), 1214\u20131231 (2006)","journal-title":"J. Comput. Biol."},{"issue":"5\u20136","key":"7_CR17","first-page":"641","volume":"10","author":"R Cole","year":"2005","unstructured":"Cole, R., Ilopoulos, C.S., Mohamed, M., Smyth, W.F., Yang, L.: The complexity of the minimum k-cover problem. J. Autom. Lang. Comb. 10(5\u20136), 641\u2013653 (2005)","journal-title":"J. Autom. Lang. Comb."},{"key":"7_CR18","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1016\/j.tcs.2017.05.026","volume":"698","author":"M Crochemore","year":"2017","unstructured":"Crochemore, M., Iliopoulos, C.S., Kociumaka, T., Radoszewski, J., Rytter, W., Walen, T.: Covering problems for partial words and for indeterminate strings. Theor. Comput. Sci. 698, 25\u201339 (2017)","journal-title":"Theor. Comput. Sci."},{"key":"7_CR19","doi-asserted-by":"publisher","first-page":"102","DOI":"10.1016\/j.tcs.2013.08.013","volume":"506","author":"T Flouri","year":"2013","unstructured":"Flouri, T., et al.: Enhanced string covering. Theor. Comput. Sci. 506, 102\u2013114 (2013)","journal-title":"Theor. Comput. Sci."},{"key":"7_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1007\/11775096_28","volume-title":"Algorithmic Aspects in Information and Management","author":"Q Guo","year":"2006","unstructured":"Guo, Q., Zhang, H., Iliopoulos, C.S.: Computing the $$\\lambda $$-seeds of a string. In: Cheng, S.-W., Poon, C.K. (eds.) AAIM 2006. LNCS, vol. 4041, pp. 303\u2013313. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11775096_28"},{"issue":"19","key":"7_CR21","doi-asserted-by":"publisher","first-page":"3957","DOI":"10.1016\/j.ins.2007.02.020","volume":"177","author":"Q Guo","year":"2007","unstructured":"Guo, Q., Zhang, H., Iliopoulos, C.S.: Computing the $$\\lambda $$-covers of a string. Inf. Sci. 177(19), 3957\u20133967 (2007)","journal-title":"Inf. Sci."},{"issue":"3","key":"7_CR22","doi-asserted-by":"publisher","first-page":"288","DOI":"10.1007\/BF01955677","volume":"16","author":"CS Iliopoulos","year":"1996","unstructured":"Iliopoulos, C.S., Moore, D.W., Park, K.: Covering a string. Algorithmica 16(3), 288\u2013297 (1996)","journal-title":"Algorithmica"},{"key":"7_CR23","volume-title":"Introduction to the Modern Theory of Dynamical Systems","author":"A Katok","year":"1997","unstructured":"Katok, A., Hasselblatt, B.: Introduction to the Modern Theory of Dynamical Systems, vol. 54. Cambridge University Press, Cambridge (1997)"},{"key":"7_CR24","doi-asserted-by":"crossref","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)","DOI":"10.1145\/3386369"},{"issue":"1","key":"7_CR25","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1007\/s00453-014-9915-3","volume":"73","author":"T Kociumaka","year":"2015","unstructured":"Kociumaka, T., Pissis, S.P., Radoszewski, J., Rytter, W., Wale\u0144, T.: Fast algorithm for partial covers in words. Algorithmica 73(1), 217\u2013233 (2015)","journal-title":"Algorithmica"},{"issue":"1","key":"7_CR26","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1016\/S0304-3975(02)00448-6","volume":"303","author":"R Kolpakov","year":"2003","unstructured":"Kolpakov, R., Kucherov, G.: Finding approximate repetitions under Hamming distance. Theor. Comput. Sci. 303(1), 135\u2013156 (2003)","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"7_CR27","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1089\/106652701300099038","volume":"8","author":"GM Landau","year":"2001","unstructured":"Landau, G.M., Schmidt, J.P., Sokol, D.: An algorithm for approximate tandem repeats. J. Comput. Biol. 8(1), 1\u201318 (2001)","journal-title":"J. Comput. Biol."},{"issue":"1","key":"7_CR28","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1007\/s00453-001-0062-2","volume":"32","author":"Y Li","year":"2002","unstructured":"Li, Y., Smyth, W.F.: Computing the cover array in linear time. Algorithmica 32(1), 95\u2013106 (2002)","journal-title":"Algorithmica"},{"key":"7_CR29","doi-asserted-by":"crossref","unstructured":"Ming, L., Vit\u00e1nyi, P.M.: Kolmogorov complexity and its applications. In: Algorithms and Complexity, pp. 187\u2013254. Elsevier (1990)","DOI":"10.1016\/B978-0-444-88071-0.50009-6"},{"issue":"5","key":"7_CR30","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1016\/0020-0190(94)00045-X","volume":"50","author":"D Moore","year":"1994","unstructured":"Moore, D., Smyth, W.F.: An optimal algorithm to compute all the covers of a string. Inf. Process. Lett. 50(5), 239\u2013246 (1994)","journal-title":"Inf. Process. Lett."},{"issue":"2","key":"7_CR31","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1016\/0020-0190(94)00235-Q","volume":"54","author":"D Moore","year":"1995","unstructured":"Moore, D., 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."},{"issue":"1\u20133","key":"7_CR32","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0304-3975(02)00847-2","volume":"304","author":"A Muchnik","year":"2003","unstructured":"Muchnik, A., Semenov, A., Ushakov, M.: Almost periodic sequences. Theor. Comput. Sci. 304(1\u20133), 1\u201333 (2003)","journal-title":"Theor. Comput. Sci."},{"issue":"11","key":"7_CR33","doi-asserted-by":"publisher","first-page":"2953","DOI":"10.1109\/78.796431","volume":"47","author":"WA Sethares","year":"1999","unstructured":"Sethares, W.A., Staley, T.W.: Periodicity transforms. IEEE Trans. Signal Process. 47(11), 2953\u20132964 (1999)","journal-title":"IEEE Trans. Signal Process."},{"key":"7_CR34","doi-asserted-by":"crossref","unstructured":"Timmermans, M., Heijmans, R., Daniels, H.: Cyclical patterns in risk indicators based on financial market infrastructure transaction data. De Nederlandsche Bank Working Paper (558) (2017)","DOI":"10.2139\/ssrn.2985414"}],"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_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,19]],"date-time":"2023-09-19T12:02:54Z","timestamp":1695124974000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-43980-3_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031439797","9783031439803"],"references-count":34,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-43980-3_7","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)"}}]}}