{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,31]],"date-time":"2022-03-31T22:53:31Z","timestamp":1648767211821},"reference-count":6,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1993,2,1]],"date-time":"1993-02-01T00:00:00Z","timestamp":728524800000},"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":7471,"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":[[1993,2]]},"DOI":"10.1016\/0304-3975(93)90200-d","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:47:37Z","timestamp":1027655257000},"page":"365-369","source":"Crossref","is-referenced-by-count":10,"title":["The shortest common nonsubsequence problem is NP-complete"],"prefix":"10.1016","volume":"108","author":[{"given":"M.","family":"Middendorf","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(93)90200-D_BIB1","series-title":"Computers and Intractability","author":"Garey","year":"1979"},{"key":"10.1016\/0304-3975(93)90200-D_BIB2","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1016\/0304-3975(91)90170-7","article-title":"An algorithm for distinguishing efficiently bit-strings by their subsequences","volume":"82","author":"Hebrard","year":"1991","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(93)90200-D_BIB3","doi-asserted-by":"crossref","first-page":"322","DOI":"10.1145\/322063.322075","article-title":"The complexity of some problems on subsequences and supersequences","volume":"25","author":"Maier","year":"1978","journal-title":"J. ACM"},{"key":"10.1016\/0304-3975(93)90200-D_BIB4","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1016\/0304-3975(81)90075-X","article-title":"The shortest common supersequence problem over binary alphabet is NP-complete","volume":"16","author":"R\u00e4ih\u00e4","year":"1981","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(93)90200-D_BIB5_1","doi-asserted-by":"crossref","first-page":"565","DOI":"10.1007\/BF01075212","article-title":"Complexity of common subsequence and supersequence problems and related problems","volume":"25","author":"Timkovskii","year":"1990","journal-title":"Cybernetics"},{"key":"10.1016\/0304-3975(93)90200-D_BIB5_2","first-page":"1","article-title":"Complexity of common subsequence and supersequence problems and related problems","volume":"25","author":"Timkovskii","year":"1989","journal-title":"Kibernetika"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439759390200D?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439759390200D?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:21:34Z","timestamp":1555129294000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/030439759390200D"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,2]]},"references-count":6,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1993,2]]}},"alternative-id":["030439759390200D"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(93)90200-d","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1993,2]]}}}