{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T12:37:06Z","timestamp":1759667826057},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2017,2,2]],"date-time":"2017-02-02T00:00:00Z","timestamp":1485993600000},"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":["Math.Comput.Sci."],"published-print":{"date-parts":[[2017,6]]},"DOI":"10.1007\/s11786-016-0288-7","type":"journal-article","created":{"date-parts":[[2017,2,2]],"date-time":"2017-02-02T06:15:28Z","timestamp":1486016128000},"page":"219-232","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Palindromic Subsequence Automata and Longest Common Palindromic Subsequence"],"prefix":"10.1007","volume":"11","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","published-online":{"date-parts":[[2017,2,2]]},"reference":[{"issue":"4","key":"288_CR1","doi-asserted-by":"crossref","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)","journal-title":"Algorithmica"},{"key":"288_CR2","first-page":"339","volume":"2","author":"K-Y Chen","year":"2010","unstructured":"Chen, K.-Y., Hsu, P.-H., Chao, K.-M.: Identifying approximate palindromes in run-length encoded strings. ISAAC 2, 339\u2013350 (2010)","journal-title":"ISAAC"},{"key":"288_CR3","doi-asserted-by":"crossref","unstructured":"Choi, C.Q.: DNA palindromes found in cancer. The Scientist (2005)","DOI":"10.1186\/gb-spotlight-20050216-01"},{"issue":"4","key":"288_CR4","doi-asserted-by":"crossref","first-page":"329","DOI":"10.3233\/FI-2014-974","volume":"129","author":"SR Chowdhury","year":"2014","unstructured":"Chowdhury, S.R., Hasan, M.M., Iqbal, S., Rahman, M.S.: Computing a longest common palindromic subsequence. Fundam. Inform. 129(4), 329\u2013340 (2014)","journal-title":"Fundam. Inform."},{"key":"288_CR5","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":"288_CR6","doi-asserted-by":"crossref","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. 112(13), 562\u2013565 (2012)","journal-title":"Inf. Process. Lett."},{"key":"288_CR7","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":"288_CR8","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511574931","volume-title":"Algorithms on Strings, Trees, and Sequences\u2014Computer Science and Computational Biology","author":"D Gusfield","year":"1997","unstructured":"Gusfield, D.: Algorithms on Strings, Trees, and Sequences\u2014Computer Science and Computational Biology. Cambridge University Press, Cambridge (1997)"},{"key":"288_CR9","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":"288_CR10","doi-asserted-by":"crossref","unstructured":"Hsu, P.-H., Chen, K.-Y., Chao, K.-M.: Finding all approximate gapped palindromes. In: ISAAC, pp. 1084\u20131093 (2009)","DOI":"10.1007\/978-3-642-10631-6_109"},{"key":"288_CR11","unstructured":"http:\/\/0-www.ncbi.nlm.nih.gov.ilsprod.lib.neu.edu\/nuccore\/acin02000001.1 . Accessed 5 Jan 2014"},{"key":"288_CR12","unstructured":"http:\/\/www.ncbi.nlm.nih.gov\/genomes\/genomesgroup.cgi . Accessed 10 July 2014"},{"issue":"5","key":"288_CR13","doi-asserted-by":"crossref","first-page":"350","DOI":"10.1145\/359581.359603","volume":"20","author":"JW Hunt","year":"1977","unstructured":"Hunt, J.W., Szymanski, T.G.: A fast algorithm for computing longest subsequences. Commun. ACM 20(5), 350\u2013353 (1977)","journal-title":"Commun. ACM"},{"key":"288_CR14","doi-asserted-by":"crossref","unstructured":"Tomohiro, I., Inenaga, S., Takeda, M.: Palindrome pattern matching. In: CPM, pp. 232\u2013245 (2011)","DOI":"10.1007\/978-3-642-21458-5_21"},{"issue":"2\u20133","key":"288_CR15","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1016\/j.tcs.2008.01.009","volume":"395","author":"CS Iliopoulos","year":"2008","unstructured":"Iliopoulos, C.S., Rahman, M.S.: Algorithms for computing variants of the longest common subsequence problem. Theor. Comput. Sci. 395(2\u20133), 255\u2013267 (2008)","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"288_CR16","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1016\/j.ipl.2007.09.008","volume":"106","author":"CS Iliopoulos","year":"2008","unstructured":"Iliopoulos, C.S., Rahman, M.S.: New efficient algorithms for the LCS and constrained LCS problems. Inf. Process. Lett. 106(1), 13\u201318 (2008)","journal-title":"Inf. Process. Lett."},{"issue":"2","key":"288_CR17","doi-asserted-by":"crossref","first-page":"355","DOI":"10.1007\/s00224-008-9101-6","volume":"45","author":"CS Iliopoulos","year":"2009","unstructured":"Iliopoulos, C.S., Rahman, M.S.: A new efficient algorithm for computing the longest common subsequence. Theory Comput. Syst. 45(2), 355\u2013371 (2009)","journal-title":"Theory Comput. Syst."},{"issue":"2","key":"288_CR18","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1016\/j.jda.2008.10.004","volume":"8","author":"CS 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 8(2), 117\u2013130 (2010)","journal-title":"J. Discrete Algorithms"},{"issue":"51","key":"288_CR19","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":"288_CR20","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":"8\u201310","key":"288_CR21","doi-asserted-by":"crossref","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. 410(8\u201310), 900\u2013913 (2009)","journal-title":"Theor. Comput. Sci."},{"key":"288_CR22","unstructured":"Melichar, B., Holub, J., Muzatko, P.: Language and Translation. Publishing House of CTU (1997)"},{"issue":"11","key":"288_CR23","doi-asserted-by":"crossref","first-page":"2581","DOI":"10.1016\/S0031-3203(01)00179-0","volume":"35","author":"AHL Porto","year":"2002","unstructured":"Porto, A.H.L., Barbosa, V.C.: Finding approximate palindromes in strings. Pattern Recognit. 35(11), 2581\u20132591 (2002)","journal-title":"Pattern Recognit."},{"issue":"3","key":"288_CR24","doi-asserted-by":"crossref","first-page":"320","DOI":"10.1038\/ng1515","volume":"37","author":"H Tanaka","year":"2005","unstructured":"Tanaka, H., Bergstrom, D.A., Yao, M.-C., Tapscott, S.J.: Widespread and nonrandom distribution of dna palindromes in cancer cells provides a structural platform for subsequent gene amplification. Nat. Genet. 37(3), 320\u2013327 (2005)","journal-title":"Nat. Genet."},{"issue":"13","key":"288_CR25","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. Natl. Acad. Sci. 99(13), 8772\u20138777 (2002)","journal-title":"Natl. Acad. Sci."}],"container-title":["Mathematics in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11786-016-0288-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11786-016-0288-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11786-016-0288-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,10,1]],"date-time":"2020-10-01T11:35:20Z","timestamp":1601552120000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11786-016-0288-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,2,2]]},"references-count":25,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2017,6]]}},"alternative-id":["288"],"URL":"https:\/\/doi.org\/10.1007\/s11786-016-0288-7","relation":{},"ISSN":["1661-8270","1661-8289"],"issn-type":[{"value":"1661-8270","type":"print"},{"value":"1661-8289","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,2,2]]}}}