{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,21]],"date-time":"2026-02-21T18:47:05Z","timestamp":1771699625452,"version":"3.50.1"},"reference-count":13,"publisher":"Elsevier BV","issue":"5","license":[{"start":{"date-parts":[[1986,11,1]],"date-time":"1986-11-01T00:00:00Z","timestamp":531187200000},"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,11]]},"DOI":"10.1016\/0020-0190(86)90091-8","type":"journal-article","created":{"date-parts":[[2003,3,14]],"date-time":"2003-03-14T19:37:33Z","timestamp":1047670653000},"page":"305-310","source":"Crossref","is-referenced-by-count":65,"title":["A bit-string longest-common-subsequence algorithm"],"prefix":"10.1016","volume":"23","author":[{"given":"Lloyd","family":"Allison","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Trevor I.","family":"Dix","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"1","key":"10.1016\/0020-0190(86)90091-8_BIB1","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. ACM"},{"issue":"6","key":"10.1016\/0020-0190(86)90091-8_BIB2","doi-asserted-by":"crossref","first-page":"431","DOI":"10.1145\/360825.360861","article-title":"A linear spase algorithm for computing maximal common subsequences","volume":"18","author":"Hirschberg","year":"1975","journal-title":"Comm. ACM"},{"issue":"4","key":"10.1016\/0020-0190(86)90091-8_BIB3","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(86)90091-8_BIB4","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)90091-8_BIB5","series-title":"Time Warps, String Edits and Macromolecules: The Theory and Practice of Sequence Comparison","article-title":"How to computer string-edit distances quickly","author":"Masek","year":"1983"},{"key":"10.1016\/0020-0190(86)90091-8_BIB6","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1007\/BF00264437","article-title":"A longest common subsequence algorithm suitable for similar text strings","volume":"18","author":"Nakatsu","year":"1982","journal-title":"Acta Informatica"},{"key":"10.1016\/0020-0190(86)90091-8_BIB7","series-title":"Combinatorial Algorithms: Theory and Practice","author":"Reingold","year":"1977"},{"key":"10.1016\/0020-0190(86)90091-8_BIB8","series-title":"Time Warps, String Edits and Macromolecules: The Theory and Practice of Sequence Comparison","year":"1983"},{"issue":"4","key":"10.1016\/0020-0190(86)90091-8_BIB9","doi-asserted-by":"crossref","first-page":"787","DOI":"10.1137\/0126070","article-title":"On the theory and computation of evolutionary distances","volume":"26","author":"Sellers","year":"1974","journal-title":"SIAM J. Math."},{"issue":"4","key":"10.1016\/0020-0190(86)90091-8_BIB10","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1016\/0196-6774(80)90016-4","article-title":"The theory and computation of evolutionary distances: Pattern recognition","volume":"1","author":"Sellers","year":"1980","journal-title":"J. Algorithms"},{"issue":"1","key":"10.1016\/0020-0190(86)90091-8_BIB11","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"},{"issue":"4","key":"10.1016\/0020-0190(86)90091-8_BIB12","doi-asserted-by":"crossref","first-page":"473","DOI":"10.1007\/BF02459498","article-title":"General methods of sequence comparison","volume":"46","author":"Waterman","year":"1984","journal-title":"Bull. Math. Biology"},{"issue":"1","key":"10.1016\/0020-0190(86)90091-8_BIB13","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1145\/321921.321923","article-title":"Bounds for 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:0020019086900918?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019086900918?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,26]],"date-time":"2019-03-26T09:51:02Z","timestamp":1553593862000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0020019086900918"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1986,11]]},"references-count":13,"journal-issue":{"issue":"5","published-print":{"date-parts":[[1986,11]]}},"alternative-id":["0020019086900918"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(86)90091-8","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1986,11]]}}}