{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,30]],"date-time":"2022-03-30T02:20:10Z","timestamp":1648606810427},"reference-count":7,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1982,6,1]],"date-time":"1982-06-01T00:00:00Z","timestamp":391737600000},"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":["Journal of Algorithms"],"published-print":{"date-parts":[[1982,6]]},"DOI":"10.1016\/0196-6774(82)90014-1","type":"journal-article","created":{"date-parts":[[2005,2,10]],"date-time":"2005-02-10T03:44:36Z","timestamp":1108007076000},"page":"147-156","source":"Crossref","is-referenced-by-count":1,"title":["Minimal string difference encodings"],"prefix":"10.1016","volume":"3","author":[{"given":"Robert N","family":"Goldberg","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0196-6774(82)90014-1_BIB1","article-title":"Software Design Issues in the Architecture and Implementation of Distributed Text Editors","author":"Goldberg","year":"1982"},{"issue":"No. 4","key":"10.1016\/0196-6774(82)90014-1_BIB2","doi-asserted-by":"crossref","DOI":"10.1145\/359460.359467","article-title":"A technique for isolatin differences between files","volume":"21","author":"Heckel","year":"1978","journal-title":"Comm. ACM"},{"issue":"No. 6","key":"10.1016\/0196-6774(82)90014-1_BIB3","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":"No. 4","key":"10.1016\/0196-6774(82)90014-1_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. Assoc. Comput. Mach."},{"issue":"No. 5","key":"10.1016\/0196-6774(82)90014-1_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"},{"issue":"No. 2","key":"10.1016\/0196-6774(82)90014-1_BIB6","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":"No. 1","key":"10.1016\/0196-6774(82)90014-1_BIB7","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."}],"container-title":["Journal of Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0196677482900141?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0196677482900141?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,1,29]],"date-time":"2019-01-29T01:51:59Z","timestamp":1548726719000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0196677482900141"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1982,6]]},"references-count":7,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1982,6]]}},"alternative-id":["0196677482900141"],"URL":"https:\/\/doi.org\/10.1016\/0196-6774(82)90014-1","relation":{},"ISSN":["0196-6774"],"issn-type":[{"value":"0196-6774","type":"print"}],"subject":[],"published":{"date-parts":[[1982,6]]}}}