{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,13]],"date-time":"2026-01-13T03:37:36Z","timestamp":1768275456940,"version":"3.49.0"},"reference-count":17,"publisher":"Elsevier BV","issue":"6","license":[{"start":{"date-parts":[[1990,9,1]],"date-time":"1990-09-01T00:00:00Z","timestamp":652147200000},"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":[[1990,9]]},"DOI":"10.1016\/0020-0190(90)90035-v","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T00:10:11Z","timestamp":1027642211000},"page":"317-323","source":"Crossref","is-referenced-by-count":72,"title":["An O(NP) sequence comparison algorithm"],"prefix":"10.1016","volume":"35","author":[{"given":"Sun","family":"Wu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Udi","family":"Manber","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gene","family":"Myers","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Webb","family":"Miller","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(90)90035-V_BIB1_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"},{"key":"10.1016\/0020-0190(90)90035-V_BIB1_2","first-page":"1209","article-title":"On economic construction of the transitive closure of a directed graph","volume":"11","author":"Arlazarov","year":"1975","journal-title":"Soviet Math. Dokl."},{"key":"10.1016\/0020-0190(90)90035-V_BIB2","first-page":"263","article-title":"Minimum detour methods for string or sequence comparison","volume":"61","author":"Hadlock","year":"1988","journal-title":"Congr. Numer."},{"key":"10.1016\/0020-0190(90)90035-V_BIB3","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1145\/360825.360861","article-title":"A linear space algorithm for computing longest common subsequences","volume":"18","author":"Hirschberg","year":"1975","journal-title":"Comm. ACM"},{"key":"10.1016\/0020-0190(90)90035-V_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(90)90035-V_BIB5","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(90)90035-V_BIB6","first-page":"8","article-title":"Binary codes capable of correcting deletions, insertions, and reversals","volume":"1","author":"Levenshtein","year":"1965","journal-title":"Problems Inform. Transmission"},{"key":"10.1016\/0020-0190(90)90035-V_BIB7","doi-asserted-by":"crossref","first-page":"18","DOI":"10.1016\/0022-0000(80)90002-1","article-title":"A faster algorithm for computing string edit distances","volume":"20","author":"Masek","year":"1980","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0020-0190(90)90035-V_BIB8","doi-asserted-by":"crossref","first-page":"1025","DOI":"10.1002\/spe.4380151102","article-title":"A file comparison program","volume":"15","author":"Miller","year":"1985","journal-title":"Software\u2014Practice & Experience"},{"key":"10.1016\/0020-0190(90)90035-V_BIB9","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1007\/BF01840446","article-title":"An O(ND) difference algorithm and its variations","volume":"1","author":"Myers","year":"1986","journal-title":"Algorithmica"},{"key":"10.1016\/0020-0190(90)90035-V_BIB10","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1145\/59287.59290","article-title":"Row replacement algorithms for screen editors","volume":"11","author":"Myers","year":"1989","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"10.1016\/0020-0190(90)90035-V_BIB11","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1007\/BF00264437","article-title":"A longest common subsequence algorithm suitable for similar text string","volume":"18","author":"Nakatsu","year":"1982","journal-title":"Acta Inform."},{"key":"10.1016\/0020-0190(90)90035-V_BIB12","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 Biology"},{"key":"10.1016\/0020-0190(90)90035-V_BIB13","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1007\/BF01840435","article-title":"Shortest paths in Euclidean graphs","volume":"1","author":"Sedgewick","year":"1986","journal-title":"Algorithmica"},{"key":"10.1016\/0020-0190(90)90035-V_BIB14","doi-asserted-by":"crossref","first-page":"100","DOI":"10.1016\/S0019-9958(85)80046-2","article-title":"Algorithms for approximate string matching","volume":"64","author":"Ukkonen","year":"1985","journal-title":"Inform. and Control"},{"key":"10.1016\/0020-0190(90)90035-V_BIB15","first-page":"55","article-title":"Speech discrimination by dynamic programming","volume":"4","author":"Vintsyuk","year":"1968","journal-title":"Cybernetics"},{"key":"10.1016\/0020-0190(90)90035-V_BIB16","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. ACM"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001909090035V?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001909090035V?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,12]],"date-time":"2019-04-12T13:20:52Z","timestamp":1555075252000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/002001909090035V"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990,9]]},"references-count":17,"journal-issue":{"issue":"6","published-print":{"date-parts":[[1990,9]]}},"alternative-id":["002001909090035V"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(90)90035-v","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1990,9]]}}}