{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:26:53Z","timestamp":1759638413629},"publisher-location":"Cham","reference-count":19,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319519623"},{"type":"electronic","value":"9783319519630"}],"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":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-51963-0_29","type":"book-chapter","created":{"date-parts":[[2017,1,10]],"date-time":"2017-01-10T01:17:39Z","timestamp":1484011059000},"page":"375-386","source":"Crossref","is-referenced-by-count":2,"title":["Computing Longest Single-arm-gapped Palindromes in a String"],"prefix":"10.1007","author":[{"given":"Shintaro","family":"Narisada","sequence":"first","affiliation":[]},{"family":"Diptarama","sequence":"additional","affiliation":[]},{"given":"Kazuyuki","family":"Narisawa","sequence":"additional","affiliation":[]},{"given":"Shunsuke","family":"Inenaga","sequence":"additional","affiliation":[]},{"given":"Ayumi","family":"Shinohara","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,1,11]]},"reference":[{"issue":"1&2","key":"29_CR1","doi-asserted-by":"crossref","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&2), 163\u2013173 (1995)","journal-title":"Theor. Comput. Sci."},{"key":"29_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1007\/10719839_9","volume-title":"LATIN 2000: Theoretical Informatics","author":"MA Bender","year":"2000","unstructured":"Bender, M.A., Farach-Colton, M.: The LCA problem revisited. In: Gonnet, G.H., Viola, A. (eds.) LATIN 2000. LNCS, vol. 1776, pp. 88\u201394. Springer, Heidelberg (2000). doi: 10.1007\/10719839_9"},{"issue":"1\u20132","key":"29_CR3","doi-asserted-by":"crossref","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)","journal-title":"Theor. Comput. Sci."},{"key":"29_CR4","doi-asserted-by":"crossref","unstructured":"van Emde Boas, P.: Preserving order in a forest in less than logarithmic time. In: FOCS, pp. 75\u201384 (1975)","DOI":"10.1109\/SFCS.1975.26"},{"issue":"6","key":"29_CR5","doi-asserted-by":"crossref","first-page":"987","DOI":"10.1145\/355541.355547","volume":"47","author":"M Farach-Colton","year":"2000","unstructured":"Farach-Colton, M., Ferragina, P., Muthukrishnan, S.: On the sorting-complexity of suffix tree construction. J. ACM 47(6), 987\u20131011 (2000)","journal-title":"J. ACM"},{"key":"29_CR6","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, Heidelberg (2016). doi: 10.1007\/978-3-319-44543-4_15"},{"key":"29_CR7","unstructured":"Gawrychowski, P., Tomohiro, I., Inenaga, S., K\u00f6ppl, D., Manea, F.: Efficiently finding all maximal $$\\alpha $$ -gapped repeats. In: STACS 2016, pp. 39:1\u201339:14 (2016)"},{"issue":"2","key":"29_CR8","doi-asserted-by":"crossref","first-page":"510","DOI":"10.1016\/j.ejc.2008.04.006","volume":"30","author":"A Glen","year":"2009","unstructured":"Glen, A., Justin, J., Widmer, S., Zamboni, L.Q.: Palindromic richness. Eur. J. Comb. 30(2), 510\u2013531 (2009)","journal-title":"Eur. J. Comb."},{"key":"29_CR9","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511574931","volume-title":"Algorithms on Strings, Trees, and Sequences","author":"D Gusfield","year":"1997","unstructured":"Gusfield, D.: Algorithms on Strings, Trees, and Sequences. Cambridge University Press, New York (1997)"},{"issue":"6","key":"29_CR10","doi-asserted-by":"crossref","first-page":"925","DOI":"10.1142\/S0129054110007647","volume":"21","author":"PH Hsu","year":"2010","unstructured":"Hsu, P.H., Chen, K.Y., Chao, K.M.: Finding all approximate gapped palindromes. Int. J. Found. Comput. Sci. 21(6), 925\u2013939 (2010)","journal-title":"Int. J. Found. Comput. Sci."},{"issue":"6","key":"29_CR11","doi-asserted-by":"crossref","first-page":"918","DOI":"10.1145\/1217856.1217858","volume":"53","author":"J K\u00e4rkk\u00e4inen","year":"2006","unstructured":"K\u00e4rkk\u00e4inen, J., Sanders, P., Burkhardt, S.: Linear work suffix array construction. J. ACM 53(6), 918\u2013936 (2006)","journal-title":"J. ACM"},{"key":"29_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1007\/3-540-48194-X_17","volume-title":"Combinatorial Pattern Matching","author":"T Kasai","year":"2001","unstructured":"Kasai, T., Lee, G., Arimura, H., Arikawa, S., Park, K.: Linear-time longest-common-prefix computation in suffix arrays and its applications. In: Amir, A. (ed.) CPM 2001. LNCS, vol. 2089, pp. 181\u2013192. Springer, Heidelberg (2001). doi: 10.1007\/3-540-48194-X_17"},{"issue":"51","key":"29_CR13","doi-asserted-by":"crossref","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)","journal-title":"Theor. Comput. Sci."},{"issue":"3","key":"29_CR14","doi-asserted-by":"crossref","first-page":"346","DOI":"10.1145\/321892.321896","volume":"22","author":"GK Manacher","year":"1975","unstructured":"Manacher, G.K.: A new linear-time on-line algorithm for finding the smallest initial palindrome of a string. J. ACM 22(3), 346\u2013351 (1975)","journal-title":"J. ACM"},{"issue":"5","key":"29_CR15","doi-asserted-by":"crossref","first-page":"935","DOI":"10.1137\/0222058","volume":"22","author":"U Manber","year":"1993","unstructured":"Manber, U., Myers, E.W.: Suffix arrays: a new method for on-line string searches. SIAM J. Comput. 22(5), 935\u2013948 (1993)","journal-title":"SIAM J. Comput."},{"issue":"10","key":"29_CR16","doi-asserted-by":"crossref","first-page":"105102","DOI":"10.1063\/1.4894752","volume":"141","author":"YZ Shi","year":"2014","unstructured":"Shi, Y.Z., Wang, F.H., Wu, Y.Y., Tan, Z.J.: A coarse-grained model with implicit salt for RNAs: predicting 3D structure, stability and salt effect. J. Chem. Phys. 141(10), 105102 (2014)","journal-title":"J. Chem. Phys."},{"key":"29_CR17","doi-asserted-by":"crossref","unstructured":"Weiner, P.: Linear pattern matching algorithms. In: 14th Annual Symposium on Switching and Automata Theory, pp. 1\u201311 (1973)","DOI":"10.1109\/SWAT.1973.13"},{"key":"29_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"342","DOI":"10.1007\/3-540-55719-9_86","volume-title":"Automata, Languages and Programming","author":"J Westbrook","year":"1992","unstructured":"Westbrook, J.: Fast incremental planarity testing. In: Kuich, W. (ed.) ICALP 1992. LNCS, vol. 623, pp. 342\u2013353. Springer, Heidelberg (1992). doi: 10.1007\/3-540-55719-9_86"},{"key":"29_CR19","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1016\/0020-0190(83)90075-3","volume":"17","author":"DE Willard","year":"1983","unstructured":"Willard, D.E.: Log-logarithmic worst-case range queries are possible in space $$\\varTheta (N)$$ . Information Processing Letters 17, 81\u201384 (1983)","journal-title":"Information Processing Letters"}],"container-title":["Lecture Notes in Computer Science","SOFSEM 2017: Theory and Practice of Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-51963-0_29","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,25]],"date-time":"2017-06-25T03:46:25Z","timestamp":1498362385000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-51963-0_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319519623","9783319519630"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-51963-0_29","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}