{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,13]],"date-time":"2026-01-13T01:54:22Z","timestamp":1768269262794,"version":"3.49.0"},"reference-count":44,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1984,10,1]],"date-time":"1984-10-01T00:00:00Z","timestamp":465436800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":10516,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Computer and System Sciences"],"published-print":{"date-parts":[[1984,10]]},"DOI":"10.1016\/0022-0000(84)90025-4","type":"journal-article","created":{"date-parts":[[2003,12,4]],"date-time":"2003-12-04T12:01:00Z","timestamp":1070539260000},"page":"133-152","source":"Crossref","is-referenced-by-count":37,"title":["New algorithms for the LCS problem"],"prefix":"10.1016","volume":"29","author":[{"given":"W.J.","family":"Hsu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M.W.","family":"Du","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0022-0000(84)90025-4_BIB1","series-title":"Proceedings, 15th Ann. IEEE Sympos. on Switching and Automata Theory","first-page":"104","article-title":"Bounds on the complexity of the maximal common subsequence problem","author":"Aho","year":"1974"},{"issue":"1","key":"10.1016\/0022-0000(84)90025-4_BIB2","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/321921.321922","article-title":"Bounds on the complexity of the longest common subsequence problem","volume":"23","author":"Aho","year":"1976","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0022-0000(84)90025-4_BIB3","article-title":"The Design and Analysis of Computer Algorithms","author":"Aho","year":"1976"},{"key":"10.1016\/0022-0000(84)90025-4_BIB4_1","first-page":"487","article-title":"On economic construction of the transitive closure of a directed graph","volume":"194","author":"Arlazarov","year":"1970","journal-title":"Dokl. Akad. Nauk SSSR"},{"issue":"5","key":"10.1016\/0022-0000(84)90025-4_BIB4_2","first-page":"1209","volume":"11","author":"Arlazarov","year":"1970","journal-title":"Soviet Math. Dokl."},{"issue":"2","key":"10.1016\/0022-0000(84)90025-4_BIB5","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. Assoc. Comput. Mach."},{"key":"10.1016\/0022-0000(84)90025-4_BIB6","first-page":"26","article-title":"Selected combinatorial research problems","author":"Chvatal","year":"1972"},{"key":"10.1016\/0022-0000(84)90025-4_BIB7","article-title":"Longest common subsequences of two random sequences","author":"Chvatal","year":"1975"},{"key":"10.1016\/0022-0000(84)90025-4_BIB8","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1016\/0022-5193(65)90096-2","article-title":"Computer aids to protein sequence determination","volume":"8","author":"Dayhoff","year":"1965","journal-title":"J. Theoret. Biol."},{"issue":"1","key":"10.1016\/0022-0000(84)90025-4_BIB9","doi-asserted-by":"crossref","first-page":"86","DOI":"10.1038\/scientificamerican0769-86","article-title":"Computer analysis of protein evolution","volume":"221","author":"Dayhoff","year":"1969","journal-title":"Sci. Amer."},{"issue":"1","key":"10.1016\/0022-0000(84)90025-4_BIB10","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1016\/0012-365X(75)90103-X","article-title":"On computing length of the longest increasing subsequences","volume":"11","author":"Fredman","year":"1975","journal-title":"Discrete Math."},{"issue":"12","key":"10.1016\/0022-0000(84)90025-4_BIB11","doi-asserted-by":"crossref","first-page":"1087","DOI":"10.1109\/T-C.1973.223654","article-title":"Tree systems for syntactic pattern recognition","volume":"C-22","author":"Fu","year":"1973","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0022-0000(84)90025-4_BIB12","doi-asserted-by":"crossref","first-page":"50","DOI":"10.1016\/0022-0000(80)90004-5","article-title":"On finding minimal length superstrings","volume":"20","author":"Gallant","year":"1980","journal-title":"J. Comput. System Sci."},{"issue":"6","key":"10.1016\/0022-0000(84)90025-4_BIB13","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":"4","key":"10.1016\/0022-0000(84)90025-4_BIB14","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. Assoc. Comput. Mach."},{"key":"10.1016\/0022-0000(84)90025-4_BIB15","article-title":"The Longest Common Subsequence Problem","author":"Hirschberg","year":"1975"},{"key":"10.1016\/0022-0000(84)90025-4_BIB16","article-title":"A Fast Algorithm for the Longest Common Subsequence Problem","author":"Hsu","year":"1982","journal-title":"Yearly Report for NSC support"},{"key":"10.1016\/0022-0000(84)90025-4_BIB17","unstructured":"J. W. Hunt and M. D. McIlroy, \u201cAn Algorithm for Differential File Comparison,\u201d Computing Science Technical Report No. 41, 197."},{"issue":"5","key":"10.1016\/0022-0000(84)90025-4_BIB18","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\/0022-0000(84)90025-4_BIB19","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1137\/0201004","article-title":"A simple algorithm for merging two disjoint linearly ordered sets","volume":"1","author":"Hwang","year":"1972","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0022-0000(84)90025-4_BIB20","doi-asserted-by":"crossref","first-page":"20","DOI":"10.1007\/BF01934067","article-title":"The string merging problem","volume":"21","author":"Itoga","year":"1981","journal-title":"BIT"},{"issue":"3","key":"10.1016\/0022-0000(84)90025-4_BIB21","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1145\/360680.360684","article-title":"A system for typesetting mathematics","volume":"18","author":"Kernighan","year":"1975","journal-title":"Comm. ACM"},{"issue":"2","key":"10.1016\/0022-0000(84)90025-4_BIB22","doi-asserted-by":"crossref","first-page":"18","DOI":"10.1145\/1008328.1008329","article-title":"Big omicron and big omega and big theta","volume":"8","author":"Knuth","year":"1976","journal-title":"SIGACT News"},{"key":"10.1016\/0022-0000(84)90025-4_BIB23","article-title":"Fast Pattern Matching Algorithms","author":"Knuth","year":"1974"},{"key":"10.1016\/0022-0000(84)90025-4_BIB24","author":"Knuth","year":"1983"},{"key":"10.1016\/0022-0000(84)90025-4_BIB25","author":"Knuth","year":"1973"},{"issue":"2","key":"10.1016\/0022-0000(84)90025-4_BIB26","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1145\/321879.321880","article-title":"An extension of the string to string correction problem","volume":"22","author":"Lowrance","year":"1975","journal-title":"J. Assoc. Comput. Mach."},{"issue":"5","key":"10.1016\/0022-0000(84)90025-4_BIB27","doi-asserted-by":"crossref","first-page":"381","DOI":"10.1109\/TSMC.1978.4309979","article-title":"A sentence-to-sentence clustering procedure for pattern analysis","volume":"SMC-8","author":"Lu","year":"1978","journal-title":"IEEE Trans. Systems Man Cybernet"},{"issue":"2","key":"10.1016\/0022-0000(84)90025-4_BIB28","doi-asserted-by":"crossref","first-page":"322","DOI":"10.1145\/322063.322075","article-title":"The complexity of some problems on subsequences and supersequences","volume":"25","author":"Maier","year":"1978","journal-title":"J. Assoc. Comput. Mach."},{"issue":"3","key":"10.1016\/0022-0000(84)90025-4_BIB29","doi-asserted-by":"crossref","first-page":"434","DOI":"10.1145\/322139.322144","article-title":"Significant improvements to the Hwang-Lin merging algorithm","volume":"26","author":"Manacher","year":"1979","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0022-0000(84)90025-4_BIB30","doi-asserted-by":"crossref","first-page":"18","DOI":"10.1016\/0022-0000(80)90002-1","article-title":"A faster algorithm computing string edit distances","volume":"20","author":"Masek","year":"1980","journal-title":"J. Comput. System Sci."},{"issue":"2","key":"10.1016\/0022-0000(84)90025-4_BIB31","doi-asserted-by":"crossref","first-page":"90","DOI":"10.1145\/362007.362033","article-title":"Spelling correction in systems programs","volume":"13","author":"Morgan","year":"1970","journal-title":"Comm. ACM"},{"key":"10.1016\/0022-0000(84)90025-4_BIB32","article-title":"A Linear Pattern-Matching Algorithm","author":"Morris","year":"1970"},{"key":"10.1016\/0022-0000(84)90025-4_BIB33","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1016\/0020-0255(80)90025-0","article-title":"A fast algorithm for the longest-common-subsequence problem","volume":"20","author":"Mukhopadhyay","year":"1980","journal-title":"Inform Sci."},{"key":"10.1016\/0022-0000(84)90025-4_BIB34","doi-asserted-by":"crossref","first-page":"443","DOI":"10.1016\/0022-2836(70)90057-4","article-title":"A general method applicable to the search for similarities in the amino acid sequence of two proteins","volume":"48","author":"Needleman","year":"1970","journal-title":"J. Molecular Biol."},{"key":"10.1016\/0022-0000(84)90025-4_BIB35","first-page":"4","article-title":"Matching sequences under deletion insertion constraints","volume":"69","author":"Sankoff","year":"1972"},{"key":"10.1016\/0022-0000(84)90025-4_BIB36","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1016\/0022-2836(73)90369-0","article-title":"A test for nucleotide sequence homology","volume":"77","author":"Sankoff","year":"1973","journal-title":"J. Molecular Biol."},{"issue":"6","key":"10.1016\/0022-0000(84)90025-4_BIB37","doi-asserted-by":"crossref","first-page":"184","DOI":"10.1016\/0020-0190(77)90064-3","article-title":"The tree-to-tree editing problem","volume":"6","author":"Selkow","year":"1977","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0022-0000(84)90025-4_BIB38","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1016\/0097-3165(74)90050-8","article-title":"An algorithm for the distance between two finite sequences","volume":"16","author":"Sellers","year":"1974","journal-title":"J. Combin. Theory Ser. A"},{"issue":"3","key":"10.1016\/0022-0000(84)90025-4_BIB39","doi-asserted-by":"crossref","first-page":"148","DOI":"10.1145\/361972.361982","article-title":"Common phrases and minimum-space text storage","volume":"16","author":"Wagner","year":"1973","journal-title":"Comm. ACM"},{"issue":"1","key":"10.1016\/0022-0000(84)90025-4_BIB40","doi-asserted-by":"crossref","first-page":"168","DOI":"10.1145\/321796.321811","article-title":"The string-to-string correction problem","volume":"21","author":"Wagner","year":"1974","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0022-0000(84)90025-4_BIB41","series-title":"Proceedings, 7th Ann. ACM Sympos. on Theory of Comput.","first-page":"218","article-title":"On the complexity of the extended string-to-string correction problem","author":"Wagner","year":"1975"},{"issue":"1","key":"10.1016\/0022-0000(84)90025-4_BIB42","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1145\/321921.321923","article-title":"Bounds for the string editing problem","volume":"28","author":"Wong","year":"1976","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0022-0000(84)90025-4_BIB43","unstructured":"F. S. Hillier and G.J. Lieberman, \u201cIntroduction to Operations Research\u201d Holden-Day, San Francisco."}],"container-title":["Journal of Computer and System Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0022000084900254?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0022000084900254?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,16]],"date-time":"2019-02-16T13:51:53Z","timestamp":1550325113000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0022000084900254"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1984,10]]},"references-count":44,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1984,10]]}},"alternative-id":["0022000084900254"],"URL":"https:\/\/doi.org\/10.1016\/0022-0000(84)90025-4","relation":{},"ISSN":["0022-0000"],"issn-type":[{"value":"0022-0000","type":"print"}],"subject":[],"published":{"date-parts":[[1984,10]]}}}