{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,26]],"date-time":"2025-11-26T04:59:08Z","timestamp":1764133148395,"version":"3.37.3"},"publisher-location":"Cham","reference-count":14,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030004781"},{"type":"electronic","value":"9783030004798"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"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":[[2018]]},"DOI":"10.1007\/978-3-030-00479-8_15","type":"book-chapter","created":{"date-parts":[[2018,9,13]],"date-time":"2018-09-13T10:58:18Z","timestamp":1536836298000},"page":"183-190","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Block Palindromes: A New Generalization of Palindromes"],"prefix":"10.1007","author":[{"given":"Keisuke","family":"Goto","sequence":"first","affiliation":[]},{"given":"I","family":"Tomohiro","sequence":"additional","affiliation":[]},{"given":"Hideo","family":"Bannai","sequence":"additional","affiliation":[]},{"given":"Shunsuke","family":"Inenaga","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,9,14]]},"reference":[{"key":"15_CR1","unstructured":"The 2015 British Informatics Olympiad (2015). http:\/\/olympiad.org.uk\/2015\/index.html. Accessed 13 June 2018"},{"key":"15_CR2","unstructured":"Alatabbi, A., Iliopoulos, C.S., Rahman, M.S.: Maximal palindromic factorization. In: Holub, J., \u017d\u010f\u00e1rek, J. (eds.) Proceedings of the Prague Stringology Conference 2013, pp. 70\u201377. Czech Technical University in Prague, Czech Republic (2013)"},{"key":"15_CR3","unstructured":"Borozdin, K., Kosolobov, D., Rubinchik, M., Shur, A.M.: Palindromic length in linear time. In: CPM. LIPIcs, vol. 78, pp. 23:1\u201323:12. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik (2017)"},{"key":"15_CR4","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, 41\u201348 (2014)","journal-title":"J. Discret. Algorithms"},{"issue":"1","key":"15_CR5","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1080\/02522667.2015.1103044","volume":"37","author":"S Gupta","year":"2016","unstructured":"Gupta, S., Prasad, R.: Searching gapped palindromes in DNA sequences using Burrows Wheeler type transformation. J. Inf. Optim. Sci. 37(1), 51\u201374 (2016). https:\/\/doi.org\/10.1080\/02522667.2015.1103044","journal-title":"J. Inf. Optim. Sci."},{"key":"15_CR6","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, Cambridge (1997)"},{"issue":"6","key":"15_CR7","doi-asserted-by":"publisher","first-page":"925","DOI":"10.1142\/S0129054110007647","volume":"21","author":"P Hsu","year":"2010","unstructured":"Hsu, P., Chen, K., Chao, K.: Finding all approximate gapped palindromes. Int. J. Found. Comput. Sci. 21(6), 925\u2013939 (2010)","journal-title":"Int. J. Found. Comput. Sci."},{"key":"15_CR8","doi-asserted-by":"publisher","first-page":"162","DOI":"10.1016\/J.TCS.2012.01.047","volume":"483","author":"T I","year":"2013","unstructured":"I, T., Inenaga, S., Takeda, M.: Palindrome pattern matching. Theor. Comput. Sci. 483, 162\u2013170 (2013). https:\/\/doi.org\/10.1016\/J.TCS.2012.01.047","journal-title":"Theor. Comput. Sci."},{"key":"15_CR9","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). https:\/\/doi.org\/10.1007\/978-3-319-07566-2_16"},{"issue":"51","key":"15_CR10","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). https:\/\/doi.org\/10.1016\/j.tcs.2009.09.013","journal-title":"Theor. Comput. Sci."},{"key":"15_CR11","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.: Pa$$^{k}$$ 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). https:\/\/doi.org\/10.1007\/978-3-662-46078-8_24"},{"issue":"3","key":"15_CR12","doi-asserted-by":"publisher","first-page":"346","DOI":"10.1145\/321892.321896","volume":"22","author":"GK Manacher","year":"1975","unstructured":"Manacher, G.K.: A new linear-time \u201con-line\u201d algorithm for finding the smallest initial palindrome of a string. J. ACM 22(3), 346\u2013351 (1975)","journal-title":"J. ACM"},{"key":"15_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1007\/978-3-319-51963-0_29","volume-title":"SOFSEM: Theory and Practice of Computer Science","author":"S Narisada","year":"2017","unstructured":"Narisada, S., Diptarama, Narisawa, K., Inenaga, S., Shinohara, A.: Computing longest single-arm-gapped palindromes in a string. In: Steffen, B., Baier, C., van den Brand, M., Eder, J., Hinchey, M., Margaria, T. (eds.) SOFSEM 2017. LNCS, vol. 10139, pp. 375\u2013386. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-51963-0_29"},{"key":"15_CR14","doi-asserted-by":"publisher","first-page":"2612","DOI":"10.1101\/gad.1724708","volume":"22","author":"GR Smith","year":"2008","unstructured":"Smith, G.R.: Meeting DNA palindromes head-to-head. Genes Dev. 22, 2612\u20132620 (2008)","journal-title":"Genes Dev."}],"container-title":["Lecture Notes in Computer Science","String Processing and Information Retrieval"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-00479-8_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,9,28]],"date-time":"2018-09-28T07:23:47Z","timestamp":1538119427000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-00479-8_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783030004781","9783030004798"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-00479-8_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"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":"Lima","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Peru","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 October 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 October 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"spire2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/eventos.spc.org.pe\/spire2018\/","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":"51","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"22","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"6","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"43% - 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":"3.8","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"}}]}}