{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T21:40:00Z","timestamp":1775079600433,"version":"3.50.1"},"reference-count":7,"publisher":"Elsevier BV","issue":"1","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\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":8113,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1991,5]]},"DOI":"10.1016\/0304-3975(91)90170-7","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:47:37Z","timestamp":1027655257000},"page":"35-49","source":"Crossref","is-referenced-by-count":29,"title":["An algorithm for distinguishing efficiently bit-strings by their subsequences"],"prefix":"10.1016","volume":"82","author":[{"given":"Jean-Jacques","family":"Hebrard","sequence":"first","affiliation":[]}],"member":"78","reference":[{"issue":"4","key":"10.1016\/0304-3975(91)90170-7_BIB1","doi-asserted-by":"crossref","first-page":"441","DOI":"10.1051\/ita\/1986200404411","article-title":"Calcul de la distance par les sous-mots","volume":"20","author":"Hebrard","year":"1986","journal-title":"RAIRO Inform Th\u00e9or. Appl."},{"key":"10.1016\/0304-3975(91)90170-7_BIB2","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1007\/BF00265993","article-title":"A linear space algorithm for the LCS problem","volume":"24","author":"Kumar","year":"1987","journal-title":"Acta Inform."},{"key":"10.1016\/0304-3975(91)90170-7_BIB3","series-title":"Combinatorics on Words","author":"Lothaire","year":"1983"},{"key":"10.1016\/0304-3975(91)90170-7_BIB4","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."},{"key":"10.1016\/0304-3975(91)90170-7_BIB5","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1007\/BF00264437","article-title":"A longest common subsequence algorithm suitable for similar test strings","volume":"18","author":"Nakatsu","year":"1982","journal-title":"Acta Inform."},{"key":"10.1016\/0304-3975(91)90170-7_BIB6","series-title":"Time Warps, String Edits and Macromolecules: the Theory and Practice of Sequence Comparison","author":"Sankoff","year":"1983"},{"key":"10.1016\/0304-3975(91)90170-7_BIB7","series-title":"An algorithm to distinguish words efficiently by their subwords","author":"Simon","year":"1984"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397591901707?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397591901707?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T03:53:38Z","timestamp":1555127618000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397591901707"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991,5]]},"references-count":7,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1991,5]]}},"alternative-id":["0304397591901707"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(91)90170-7","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1991,5]]}}}