{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:35:24Z","timestamp":1759638924167,"version":"3.40.3"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319587462"},{"type":"electronic","value":"9783319587479"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","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":[[2017]]},"DOI":"10.1007\/978-3-319-58747-9_7","type":"book-chapter","created":{"date-parts":[[2017,5,5]],"date-time":"2017-05-05T01:14:05Z","timestamp":1493946845000},"page":"48-61","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Palindromic Decompositions with Gaps and Errors"],"prefix":"10.1007","author":[{"given":"Micha\u0142","family":"Adamczyk","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mai","family":"Alzamel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Panagiotis","family":"Charalampopoulos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Costas S.","family":"Iliopoulos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jakub","family":"Radoszewski","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,5,6]]},"reference":[{"key":"7_CR1","unstructured":"Alatabbi, A., Iliopoulos, C.S., Rahman, M.S.: Maximal palindromic factorization. In: Stringology, pp. 70\u201377 (2013)"},{"issue":"1","key":"7_CR2","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1016\/0304-3975(94)00083-U","volume":"141","author":"A Apostolico","year":"1995","unstructured":"Apostolico, A., Breslauer, D., Galil, Z.: Parallel detection of all palindromes in a string. Theor. Comput. Sci. 141(1), 163\u2013173 (1995). http:\/\/dx.doi.org\/10.1016\/0304-3975(94)00083-U","journal-title":"Theor. Comput. Sci."},{"issue":"4","key":"7_CR3","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1007\/BF01294132","volume":"14","author":"D Breslauer","year":"1995","unstructured":"Breslauer, D., Galil, Z.: Finding all periods and initial palindromes of a string in parallel. Algorithmica 14(4), 355\u2013366 (1995). http:\/\/dx.doi.org\/10.1007\/BF01294132","journal-title":"Algorithmica"},{"key":"7_CR4","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511546853","volume-title":"Algorithms on Strings","author":"M Crochemore","year":"2007","unstructured":"Crochemore, M., Hancart, C., Lecroq, T.: Algorithms on Strings. Cambridge University Press, Cambridge (2007)"},{"key":"7_CR5","volume-title":"Jewels of Stringology","author":"M Crochemore","year":"2003","unstructured":"Crochemore, M., Rytter, W.: Jewels of Stringology. World Scientific, Singapore (2003)"},{"issue":"4","key":"7_CR6","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1016\/0020-0190(95)00080-V","volume":"55","author":"X Droubay","year":"1995","unstructured":"Droubay, X.: Palindromes in the Fibonacci word. Inf. Process. Lett. 55(4), 217\u2013221 (1995). http:\/\/dx.doi.org\/10.1016\/0020-0190(95)00080-V","journal-title":"Inf. Process. Lett."},{"issue":"1\u20132","key":"7_CR7","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1016\/S0304-3975(97)00188-6","volume":"223","author":"X Droubay","year":"1999","unstructured":"Droubay, X., Pirillo, G.: Palindromes and Sturmian words. Theor. Comput. Sci. 223(1\u20132), 73\u201385 (1999). http:\/\/dx.doi.org\/10.1016\/S0304-3975(97)00188\u20136","journal-title":"Theor. Comput. Sci."},{"issue":"C","key":"7_CR8","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1016\/j.jda.2014.08.001","volume":"28","author":"G Fici","year":"2014","unstructured":"Fici, G., Gagie, T., K\u00e4rkk\u00e4inen, J., Kempa, D.: A subquadratic algorithm for minimum palindromic factorization. J. Discret. Algorithms 28(C), 41\u201348 (2014). http:\/\/dx.doi.org\/10.1016\/j.jda.2014.08.001","journal-title":"J. Discret. Algorithms"},{"issue":"5","key":"7_CR9","doi-asserted-by":"publisher","first-page":"737","DOI":"10.1016\/j.aam.2013.01.002","volume":"50","author":"A Frid","year":"2013","unstructured":"Frid, A., Puzynina, S., Zamboni, L.: On palindromic factorization of words. Adv. Appl. Math. 50(5), 737\u2013748 (2013). http:\/\/dx.doi.org\/10.1016\/j.aam.2013.01.002","journal-title":"Adv. Appl. Math."},{"key":"7_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1007\/978-3-319-44543-4_15","volume-title":"Combinatorial Algorithms","author":"Y Fujishige","year":"2016","unstructured":"Fujishige, Y., Nakamura, M., Inenaga, S., Bannai, H., Takeda, M.: Finding gapped palindromes online. In: M\u00e4kinen, V., Puglisi, S.J., Salmela, L. (eds.) IWOCA 2016. LNCS, vol. 9843, pp. 191\u2013202. Springer, Cham (2016). doi:10.1007\/978-3-319-44543-4_15"},{"key":"7_CR11","doi-asserted-by":"crossref","unstructured":"Galil, Z.: Real-time algorithms for string-matching and palindrome recognition. In: Proceedings of the Eighth Annual ACM Symposium on Theory of Computing, pp. 161\u2013173. ACM (1976). http:\/\/doi.acm.org\/10.1145\/800113.803644","DOI":"10.1145\/800113.803644"},{"issue":"1","key":"7_CR12","doi-asserted-by":"publisher","first-page":"102","DOI":"10.1145\/322047.322056","volume":"25","author":"Z Galil","year":"1978","unstructured":"Galil, Z., Seiferas, J.: A linear-time on-line recognition algorithm for \u201cpalstar\u201d. J. ACM 25(1), 102\u2013111 (1978). http:\/\/doi.acm.org\/10.1145\/322047.322056","journal-title":"J. ACM"},{"issue":"23","key":"7_CR13","doi-asserted-by":"publisher","first-page":"1","DOI":"10.17485\/ijst\/2015\/v8i23\/70645","volume":"8","author":"S Gupta","year":"2015","unstructured":"Gupta, S., Prasad, R., Yadav, S.: Searching gapped palindromes in DNA sequences using dynamic suffix array. Indian J. Sci. Technol. 8(23), 1 (2015)","journal-title":"Indian J. Sci. Technol."},{"key":"7_CR14","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511574931","volume-title":"Algorithms on Strings, Trees, and Sequences: Computer Science and Computational Biology","author":"D Gusfield","year":"1997","unstructured":"Gusfield, D.: Algorithms on Strings, Trees, and Sequences: Computer Science and Computational Biology. Cambridge University Press, New York (1997)"},{"key":"7_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"150","DOI":"10.1007\/978-3-319-07566-2_16","volume-title":"Combinatorial Pattern Matching","author":"T I","year":"2014","unstructured":"I, T., Sugimoto, S., Inenaga, S., Bannai, H., Takeda, M.: Computing palindromic factorizations and palindromic covers on-line. In: Kulikov, A.S., Kuznetsov, S.O., Pevzner, P. (eds.) CPM 2014. LNCS, vol. 8486, pp. 150\u2013161. Springer, Cham (2014). doi:10.1007\/978-3-319-07566-2_16"},{"issue":"2","key":"7_CR16","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1137\/0206024","volume":"6","author":"DE Knuth","year":"1977","unstructured":"Knuth, D.E., Morris Jr., J.H., Pratt, V.R.: Fast pattern matching in strings. SIAM J. Comput. 6(2), 323\u2013350 (1977)","journal-title":"SIAM J. Comput."},{"issue":"51","key":"7_CR17","doi-asserted-by":"publisher","first-page":"5365","DOI":"10.1016\/j.tcs.2009.09.013","volume":"410","author":"R Kolpakov","year":"2009","unstructured":"Kolpakov, R., Kucherov, G.: Searching for gapped palindromes. Theor. Comput. Sci. 410(51), 5365\u20135373 (2009). http:\/\/dx.doi.org\/10.1016\/j.tcs.2009.09.013","journal-title":"Theor. Comput. Sci."},{"key":"7_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1007\/978-3-662-46078-8_24","volume-title":"SOFSEM 2015: Theory and Practice of Computer Science","author":"D Kosolobov","year":"2015","unstructured":"Kosolobov, D., Rubinchik, M., Shur, A.M.: Pal\n                    k\n                   is linear recognizable online. In: Italiano, G.F., Margaria-Steffen, T., Pokorn\u00fd, J., Quisquater, J.-J., Wattenhofer, R. (eds.) SOFSEM 2015. LNCS, vol. 8939, pp. 289\u2013301. Springer, Heidelberg (2015). doi:10.1007\/978-3-662-46078-8_24"},{"issue":"3","key":"7_CR19","doi-asserted-by":"publisher","first-page":"346","DOI":"10.1145\/321892.321896","volume":"22","author":"G Manacher","year":"1975","unstructured":"Manacher, G.: A new linear-time \u201con-line\u201d algorithm for finding the smallest initial palindrome of a string. J. ACM (JACM) 22(3), 346\u2013351 (1975)","journal-title":"J. ACM (JACM)"},{"key":"7_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1007\/978-3-319-29516-9_27","volume-title":"Combinatorial Algorithms","author":"M Rubinchik","year":"2016","unstructured":"Rubinchik, M., Shur, A.M.: EERTREE: an efficient data structure for processing palindromes in strings. In: Lipt\u00e1k, Z., Smyth, W.F. (eds.) IWOCA 2015. LNCS, vol. 9538, pp. 321\u2013333. Springer, Cham (2016). doi:10.1007\/978-3-319-29516-9_27"}],"container-title":["Lecture Notes in Computer Science","Computer Science \u2013 Theory and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-58747-9_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T17:14:46Z","timestamp":1710263686000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-58747-9_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319587462","9783319587479"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-58747-9_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]},"assertion":[{"value":"6 May 2017","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CSR","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Computer Science Symposium in Russia","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Kazan","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":"2017","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 June 2017","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 June 2017","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"csr2017","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/logic.pdmi.ras.ru\/csr2017\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}