{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,13]],"date-time":"2026-01-13T05:01:45Z","timestamp":1768280505838,"version":"3.49.0"},"reference-count":9,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1986,8,1]],"date-time":"1986-08-01T00:00:00Z","timestamp":523238400000},"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":[[1986,8]]},"DOI":"10.1016\/0020-0190(86)90044-x","type":"journal-article","created":{"date-parts":[[2003,3,14]],"date-time":"2003-03-14T14:37:33Z","timestamp":1047652653000},"page":"63-69","source":"Crossref","is-referenced-by-count":34,"title":["Improving the worst-case performance of the Hunt-Szymanski strategy for the longest common subsequence of two strings"],"prefix":"10.1016","volume":"23","author":[{"given":"Alberto","family":"Apostolico","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(86)90044-X_BIB1","series-title":"The longest common subsequence problem revisited","author":"Apostolica","year":"1985"},{"issue":"1","key":"10.1016\/0020-0190(86)90044-X_BIB2","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/321921.321922","article-title":"Bounds on the complexity of the maximal common subsequence problem","volume":"23","author":"Aho","year":"1976","journal-title":"J. ACM"},{"key":"10.1016\/0020-0190(86)90044-X_BIB3","series-title":"Proc. 10th STOC","first-page":"19","article-title":"A representation of linear lists with movable fingers","author":"Brown","year":"1978"},{"issue":"2","key":"10.1016\/0020-0190(86)90044-X_BIB4","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1145\/322123.322127","article-title":"A fast merging algorithm","volume":"26","author":"Brown","year":"1979","journal-title":"J. ACM"},{"issue":"4","key":"10.1016\/0020-0190(86)90044-X_BIB5","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"},{"issue":"6","key":"10.1016\/0020-0190(86)90044-X_BIB6","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1145\/360825.360861","article-title":"A linear space algorithm for computing maximal common subsequences","volume":"18","author":"Hirschberg","year":"1975","journal-title":"Comm. ACM"},{"issue":"5","key":"10.1016\/0020-0190(86)90044-X_BIB7","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"},{"key":"10.1016\/0020-0190(86)90044-X_BIB8","series-title":"EATCS Monographs on Theoretical Computer Science","article-title":"Data Structures and Algorithms 1: Sorting and Searching","author":"Mehlhorn","year":"1984"},{"issue":"3","key":"10.1016\/0020-0190(86)90044-X_BIB9","doi-asserted-by":"crossref","first-page":"80","DOI":"10.1016\/0020-0190(77)90031-X","article-title":"Preserving order in a forest in less than logarithmic time and linear space","volume":"6","author":"van Emde Boas","year":"1977","journal-title":"Inform. Process. Lett."}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001908690044X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001908690044X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,26]],"date-time":"2019-03-26T05:50:09Z","timestamp":1553579409000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/002001908690044X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1986,8]]},"references-count":9,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1986,8]]}},"alternative-id":["002001908690044X"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(86)90044-x","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1986,8]]}}}