{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,31]],"date-time":"2022-03-31T19:05:12Z","timestamp":1648753512789},"reference-count":8,"publisher":"Elsevier BV","issue":"4","license":[{"start":{"date-parts":[[1991,5,1]],"date-time":"1991-05-01T00:00:00Z","timestamp":673056000000},"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":[[1991,5]]},"DOI":"10.1016\/0020-0190(91)90094-x","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:38:59Z","timestamp":1027640339000},"page":"169-171","source":"Crossref","is-referenced-by-count":2,"title":["On the inadequacy of tournament algorithms for the N-SCS problem"],"prefix":"10.1016","volume":"38","author":[{"given":"James H.","family":"Bradford","sequence":"first","affiliation":[]},{"given":"T.A.","family":"Jenkyns","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"6","key":"10.1016\/0020-0190(91)90094-X_BIB1","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\/0020-0190(91)90094-X_BIB2","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":"5","key":"10.1016\/0020-0190(91)90094-X_BIB3","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(91)90094-X_BIB4","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1016\/0020-0255(81)90052-9","article-title":"An effective algorithm for string correction using generalized edit distances \u2014 I. Description of the algorithm and its optimality","volume":"23","author":"Kashyap","year":"1981","journal-title":"Inform. Sci."},{"key":"10.1016\/0020-0190(91)90094-X_BIB5","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1080\/00207168308803349","article-title":"A common basis for similarity measures involving two strings","volume":"13","author":"Kashyap","year":"1983","journal-title":"Internat. J. Comput. Math."},{"issue":"2","key":"10.1016\/0020-0190(91)90094-X_BIB6","doi-asserted-by":"crossref","first-page":"322","DOI":"10.1145\/322063.322075","article-title":"The complexity of common subsequence and supersequence problems and related problems","volume":"25","author":"Maier","year":"1978","journal-title":"J. ACM"},{"key":"10.1016\/0020-0190(91)90094-X_BIB7","first-page":"1","article-title":"Complexity of common problems on subsequences and supersequences","volume":"5","author":"Timkovskii","year":"1989","journal-title":"Kibernetika"},{"issue":"1","key":"10.1016\/0020-0190(91)90094-X_BIB8","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1145\/321921.321923","article-title":"Bounds on the string editing problem","volume":"23","author":"Wong","year":"1976","journal-title":"J. ACM"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001909190094X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001909190094X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T04:24:16Z","timestamp":1555129456000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/002001909190094X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991,5]]},"references-count":8,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1991,5]]}},"alternative-id":["002001909190094X"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(91)90094-x","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1991,5]]}}}