{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T12:51:30Z","timestamp":1725540690739},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642359255"},{"type":"electronic","value":"9783642359262"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-35926-2_24","type":"book-chapter","created":{"date-parts":[[2012,12,20]],"date-time":"2012-12-20T23:32:11Z","timestamp":1356046331000},"page":"219-223","source":"Crossref","is-referenced-by-count":2,"title":["Computing a Longest Common Palindromic Subsequence"],"prefix":"10.1007","author":[{"given":"Shihabur Rahman","family":"Chowdhury","sequence":"first","affiliation":[]},{"given":"Md. Mahbubul","family":"Hasan","sequence":"additional","affiliation":[]},{"given":"Sumaiya","family":"Iqbal","sequence":"additional","affiliation":[]},{"given":"M. Sohel","family":"Rahman","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"24_CR1","doi-asserted-by":"publisher","first-page":"397","DOI":"10.1145\/356789.356797","volume":"11","author":"J.L. Bentley","year":"1979","unstructured":"Bentley, J.L., Friedman, J.H.: Data structures for range searching. ACM Comput. Surv.\u00a011, 397\u2013409 (1979)","journal-title":"ACM Comput. Surv."},{"key":"24_CR2","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, 355\u2013366 (1995)","journal-title":"Algorithmica"},{"key":"24_CR3","unstructured":"Gusfield, D.: Algorithms on Strings, Trees, and Sequences: Computer Science and Computational Biology. Cambridge University Press, New York"},{"key":"24_CR4","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":"24_CR5","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1007\/s00224-008-9101-6","volume":"45","author":"C. Iliopoulos","year":"2009","unstructured":"Iliopoulos, C., Rahman, M.: A new efficient algorithm for computing the longest common subsequence. Theory of Computing Systems\u00a045, 355\u2013371 (2009)","journal-title":"Theory of Computing Systems"},{"key":"24_CR6","doi-asserted-by":"crossref","unstructured":"Kolpakov, R., Kucherov, G.: Searching for gapped palindromes. Theoretical Computer Science, 5365\u20135373 (November 2009)","DOI":"10.1016\/j.tcs.2009.09.013"},{"key":"24_CR7","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 on-line algorithm for finding the smallest initial palindrome of a string. Journal of the ACM\u00a022, 346\u2013351 (1975)","journal-title":"Journal of the ACM"},{"key":"24_CR8","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. Theoretical Computer Science\u00a0410, 900\u2013913 (2009)","journal-title":"Theoretical Computer Science"},{"key":"24_CR9","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":"I. Tomohiro","year":"2011","unstructured":"Tomohiro, I., Inenaga, S., Takeda, M.: Palindrome Pattern Matching. In: Giancarlo, R., Manzini, G. (eds.) CPM 2011. LNCS, vol.\u00a06661, pp. 232\u2013245. Springer, Heidelberg (2011)"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-35926-2_24.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T09:33:50Z","timestamp":1620120830000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-35926-2_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642359255","9783642359262"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-35926-2_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}