{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,13]],"date-time":"2026-01-13T02:16:03Z","timestamp":1768270563702,"version":"3.49.0"},"reference-count":6,"publisher":"Elsevier BV","issue":"4","license":[{"start":{"date-parts":[[1987,6,1]],"date-time":"1987-06-01T00:00:00Z","timestamp":549504000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information Processing Letters"],"published-print":{"date-parts":[[1987,6]]},"DOI":"10.1016\/0020-0190(87)90167-0","type":"journal-article","created":{"date-parts":[[2003,3,14]],"date-time":"2003-03-14T19:37:33Z","timestamp":1047670653000},"page":"235-236","source":"Crossref","is-referenced-by-count":9,"title":["Remark on the HSU\ue5f8DU new algorithm for the longest common subsequence problem"],"prefix":"10.1016","volume":"25","author":[{"given":"Alberto","family":"Apostolico","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(87)90167-0_BIB1","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1016\/0020-0190(86)90044-X","article-title":"Improving the worst-case performance of the Hunt-Szymanski strategy for the longest common subsequence of two strings","volume":"23","author":"Apostolico","year":"1986","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0020-0190(87)90167-0_BIB2_1","article-title":"The longest common subsequence problem revisited","author":"Apostolico","year":"1985"},{"key":"10.1016\/0020-0190(87)90167-0_BIB2_2","unstructured":"also: Algorithmica, to appear."},{"key":"10.1016\/0020-0190(87)90167-0_BIB4","doi-asserted-by":"crossref","first-page":"664","DOI":"10.1145\/322033.322044","article-title":"Algorithms for the longest common subsequence problem","volume":"24","author":"Hirschberg","year":"1977","journal-title":"J. ACM"},{"key":"10.1016\/0020-0190(87)90167-0_BIB5","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1016\/0022-0000(84)90025-4","article-title":"New algorithms for the LCS problem","volume":"29","author":"Hsu","year":"1984","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0020-0190(87)90167-0_BIB6","doi-asserted-by":"crossref","first-page":"350","DOI":"10.1145\/359581.359603","article-title":"A fast algorithm for computing longest common subsequences","volume":"20","author":"Hunt","year":"1977","journal-title":"Comm. ACM"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019087901670?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019087901670?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,26]],"date-time":"2019-03-26T09:54:22Z","timestamp":1553594062000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0020019087901670"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1987,6]]},"references-count":6,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1987,6]]}},"alternative-id":["0020019087901670"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(87)90167-0","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1987,6]]}}}