{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T20:19:26Z","timestamp":1725740366635},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642392733"},{"type":"electronic","value":"9783642392740"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-39274-0_15","type":"book-chapter","created":{"date-parts":[[2013,7,10]],"date-time":"2013-07-10T21:07:42Z","timestamp":1373490462000},"page":"158-168","source":"Crossref","is-referenced-by-count":0,"title":["On Palindromic Sequence Automata and Applications"],"prefix":"10.1007","author":[{"given":"Md. Mahbubul","family":"Hasan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"A. S. M. Sohidull","family":"Islam","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M. Sohel","family":"Rahman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ayon","family":"Sen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"4","key":"15_CR1","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\u00a014(4), 355\u2013366 (1995)","journal-title":"Algorithmica"},{"key":"15_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1007\/978-3-642-17514-5_29","volume-title":"Algorithms and Computation","author":"K.-Y. Chen","year":"2010","unstructured":"Chen, K.-Y., Hsu, P.-H., Chao, K.-M.: Identifying approximate palindromes in run-length encoded strings. In: Cheong, O., Chwa, K.-Y., Park, K. (eds.) ISAAC 2010, Part II. LNCS, vol.\u00a06507, pp. 339\u2013350. Springer, Heidelberg (2010)"},{"key":"15_CR3","doi-asserted-by":"crossref","unstructured":"Choi, C.Q.: Dna palindromes found in cancer. The Scientist (2005)","DOI":"10.1186\/gb-spotlight-20050216-01"},{"key":"15_CR4","unstructured":"Chowdhury, S.R., Hasan, M.M., Iqbal, S., Rahman, M.S.: Computing a longest common palindromic subsequence. Fundamneta Informaticae"},{"key":"15_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1007\/978-3-642-35926-2_24","volume-title":"IWOCA 2012","author":"S.R. Chowdhury","year":"2012","unstructured":"Chowdhury, S.R., Hasan, M. M., Iqbal, S., Rahman, M.S.: Computing a longest common palindromic subsequence. In: Arumugam, S., Smyth, B. (eds.) IWOCA 2012. LNCS, vol.\u00a07643, pp. 219\u2013223. Springer, Heidelberg (2012)"},{"key":"15_CR6","unstructured":"Chuang, K., Lee, R., Huang, C.: Finding all palindrome subsequences in a string. In: The 24th Workshop on Combinatorial Mathematics and Computation Theory (2007)"},{"issue":"13","key":"15_CR7","doi-asserted-by":"publisher","first-page":"562","DOI":"10.1016\/j.ipl.2012.04.007","volume":"112","author":"E. Farhana","year":"2012","unstructured":"Farhana, E., Rahman, M.S.: Doubly-constrained lcs and hybrid-constrained lcs problems revisited. Inf. Process. Lett.\u00a0112(13), 562\u2013565 (2012)","journal-title":"Inf. Process. Lett."},{"key":"15_CR8","doi-asserted-by":"crossref","unstructured":"Galil, Z.: Real-time algorithms for string-matching and palindrome recognition. In: STOC, pp. 161\u2013173 (1976)","DOI":"10.1145\/800113.803644"},{"key":"15_CR9","doi-asserted-by":"crossref","unstructured":"Gusfield, D.: Algorithms on Strings, Trees, and Sequences - Computer Science and Computational Biology. Cambridge University Press (1997)","DOI":"10.1017\/CBO9780511574931"},{"key":"15_CR10","doi-asserted-by":"crossref","unstructured":"Hoshino, H., Shinohara, A., Takeda, M., Arikawa, S.: Online construction of subsequence automata for multiple texts. In: SPIRE, pp. 146\u2013152 (2000)","DOI":"10.1109\/SPIRE.2000.878190"},{"key":"15_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1084","DOI":"10.1007\/978-3-642-10631-6_109","volume-title":"Algorithms and Computation","author":"P.-H. Hsu","year":"2009","unstructured":"Hsu, P.-H., Chen, K.-Y., Chao, K.-M.: Finding all approximate gapped palindromes. In: Dong, Y., Du, D.-Z., Ibarra, O. (eds.) ISAAC 2009. LNCS, vol.\u00a05878, pp. 1084\u20131093. Springer, Heidelberg (2009)"},{"key":"15_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"232","DOI":"10.1007\/978-3-642-21458-5_21","volume-title":"Combinatorial Pattern Matching","author":"T. I.","year":"2011","unstructured":"I., T., Inenaga, S., Takeda, M.: Palindrome pattern matching. In: Giancarlo, R., Manzini, G. (eds.) CPM 2011. LNCS, vol.\u00a06661, pp. 232\u2013245. Springer, Heidelberg (2011)"},{"issue":"2","key":"15_CR13","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1016\/j.jda.2008.10.004","volume":"8","author":"C.S. Iliopoulos","year":"2010","unstructured":"Iliopoulos, C.S., Rahman, M.S., Vor\u00e1cek, M., Vagner, L.: Finite automata based algorithms on subsequences and supersequences of degenerate strings. J. Discrete Algorithms\u00a08(2), 117\u2013130 (2010)","journal-title":"J. Discrete Algorithms"},{"issue":"51","key":"15_CR14","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.\u00a0410(51), 5365\u20135373 (2009)","journal-title":"Theor. Comput. Sci."},{"issue":"3","key":"15_CR15","doi-asserted-by":"publisher","first-page":"346","DOI":"10.1145\/321892.321896","volume":"22","author":"G.K. 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\u00a022(3), 346\u2013351 (1975)","journal-title":"J. ACM"},{"issue":"8-10","key":"15_CR16","doi-asserted-by":"publisher","first-page":"900","DOI":"10.1016\/j.tcs.2008.12.016","volume":"410","author":"W. Matsubara","year":"2009","unstructured":"Matsubara, W., Inenaga, S., Ishino, A., Shinohara, A., Nakamura, T., Hashimoto, K.: Efficient algorithms to compute compressed longest common substrings and compressed palindromes. Theor. Comput. Sci.\u00a0410(8-10), 900\u2013913 (2009)","journal-title":"Theor. Comput. Sci."},{"key":"15_CR17","unstructured":"Melicher, B., Holub, J., Muzatko, P.: Language and Translation. Publishing House of CTU (1997)"},{"issue":"11","key":"15_CR18","doi-asserted-by":"publisher","first-page":"2581","DOI":"10.1016\/S0031-3203(01)00179-0","volume":"35","author":"A.H.L. Porto","year":"2002","unstructured":"Porto, A.H.L., Barbosa, V.C.: Finding approximate palindromes in strings. Pattern Recognition\u00a035(11), 2581\u20132591 (2002)","journal-title":"Pattern Recognition"},{"issue":"13","key":"15_CR19","doi-asserted-by":"crossref","first-page":"8772","DOI":"10.1073\/pnas.132275999","volume":"99","author":"H. Tanaka","year":"2002","unstructured":"Tanaka, H., Tapscott, S.J., Trask, B.J., Yao, M.C.: Short inverted repeats initiate gene amplification through the formation of a large dna palindrome in mammalian cells. National Academy of Science\u00a099(13), 8772\u20138777 (2002)","journal-title":"National Academy of Science"}],"container-title":["Lecture Notes in Computer Science","Implementation and Application of Automata"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-39274-0_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,1,28]],"date-time":"2019-01-28T02:26:22Z","timestamp":1548642382000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-39274-0_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642392733","9783642392740"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-39274-0_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}