{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,30]],"date-time":"2025-06-30T11:26:33Z","timestamp":1751282793712},"reference-count":10,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1995,7,1]],"date-time":"1995-07-01T00:00:00Z","timestamp":804556800000},"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":6591,"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":[[1995,7]]},"DOI":"10.1016\/0304-3975(95)00014-n","type":"journal-article","created":{"date-parts":[[2003,4,25]],"date-time":"2003-04-25T06:09:04Z","timestamp":1051250944000},"page":"317-327","source":"Crossref","is-referenced-by-count":7,"title":["On finding minimal, maximal, and consistent sequences over a binary alphabet"],"prefix":"10.1016","volume":"145","author":[{"given":"Martin","family":"Middendorf","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(95)00014-N_BIB1","series-title":"Proc. 33rd IEEE Symp. on Foundations of Computer Science","first-page":"14","article-title":"Proof verification and hardness of approximation problems","author":"Arora","year":"1992"},{"key":"10.1016\/0304-3975(95)00014-N_BIB2","doi-asserted-by":"crossref","unstructured":"C.B. Fraser, R.W. Irving and M. Middendorf, Maximal common subsequences and minimal common supersequences, Inform. and Comput., submitted.","DOI":"10.1006\/inco.1996.0011"},{"key":"10.1016\/0304-3975(95)00014-N_BIB3","doi-asserted-by":"crossref","first-page":"336","DOI":"10.1016\/0304-3975(93)90167-R","article-title":"On the complexity of learning strings and supersequences","volume":"119","author":"Jiang","year":"1993","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(95)00014-N_BIB4","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(95)00014-N_BIB5","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1016\/0304-3975(93)90200-D","article-title":"The shortest common nonsubsequence problem is NP-complete","volume":"108","author":"Middendorf","year":"1993","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(95)00014-N_BIB6","series-title":"Proc. 20th ACM Symp. on Theory of Computing","first-page":"229","article-title":"Optimization, Approximation and Complexity Classes","author":"Papadimitriou","year":"1988"},{"key":"10.1016\/0304-3975(95)00014-N_BIB7","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(95)00014-N_BIB8","unstructured":"A.R. Rubinov and V.G. Timkovsky, String Non-Inclusion Optimization Problems, submitted."},{"key":"10.1016\/0304-3975(95)00014-N_BIB9","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":"Timkovsky","year":"1990","journal-title":"Cybernetics"},{"key":"10.1016\/0304-3975(95)00014-N_BIB10_1","unstructured":"L. Zhang, The approximation of longest common non-supersequences and shortest common non-subsequences is hard, Unpublished Manuscript."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439759500014N?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439759500014N?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,16]],"date-time":"2019-04-16T00:55:00Z","timestamp":1555376100000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/030439759500014N"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,7]]},"references-count":10,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1995,7]]}},"alternative-id":["030439759500014N"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(95)00014-n","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1995,7]]}}}