{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,30]],"date-time":"2025-06-30T11:26:24Z","timestamp":1751282784896},"reference-count":11,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1996,10,1]],"date-time":"1996-10-01T00:00:00Z","timestamp":844128000000},"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":6133,"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":[[1996,10]]},"DOI":"10.1016\/0304-3975(95)00138-7","type":"journal-article","created":{"date-parts":[[2003,4,30]],"date-time":"2003-04-30T21:37:28Z","timestamp":1051738648000},"page":"233-246","source":"Crossref","is-referenced-by-count":2,"title":["Consistent subsequences and supersequences"],"prefix":"10.1016","volume":"165","author":[{"given":"Campbell","family":"Fraser","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(95)00138-7_BIB1","series-title":"Computers and Intractability: A Guide to the Theory of NP-completeness","author":"Garey","year":"1979"},{"key":"10.1016\/0304-3975(95)00138-7_BIB2","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1006\/inco.1996.0011","article-title":"Maximal common subsequences and minimal common supersequences","volume":"124","author":"Fraser","year":"1996","journal-title":"Inform. Comput."},{"key":"10.1016\/0304-3975(95)00138-7_BIB3","doi-asserted-by":"crossref","first-page":"363","DOI":"10.1016\/0304-3975(93)90167-R","article-title":"On the complexity of learning strings and sequences","volume":"119","author":"Jiang","year":"1992","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(95)00138-7_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)00138-7_BIB5","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1016\/0304-3975(93)90200-D","article-title":"The shortest common nonsubsequences problem is NP-complete","volume":"108","author":"Middendorf","year":"1993","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(95)00138-7_BIB6","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1016\/0304-3975(92)00074-2","article-title":"More on the complexity of common superstring and supersequence problems","volume":"125","author":"Middendorf","year":"1994","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(95)00138-7_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)00138-7_BIB8","unstructured":"A.R. Rubinov and V.G. Timkovsky, String non-inclusion optimisation problems, SIAM J. Discrete Math. submitted."},{"key":"10.1016\/0304-3975(95)00138-7_BIB9_1","first-page":"1","article-title":"Complexity of common subsequence and supersequence problems and related problems","volume":"5","author":"Timkovsky","year":"1989","journal-title":"Kibernetika"},{"key":"10.1016\/0304-3975(95)00138-7_BIB9_2","doi-asserted-by":"crossref","first-page":"565","DOI":"10.1007\/BF01075212","volume":"25","author":"Timkovsky","year":"1990","journal-title":"Cybernetics"},{"key":"10.1016\/0304-3975(95)00138-7_BIB10","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1016\/0304-3975(94)00257-J","article-title":"On the approximation of longest common non-supersequences and shortest common non-subsequences","volume":"143","author":"Zhang","year":"1995","journal-title":"Theoret. Comput. Sci."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397595001387?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397595001387?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,26]],"date-time":"2019-04-26T17:58:00Z","timestamp":1556301480000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397595001387"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,10]]},"references-count":11,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1996,10]]}},"alternative-id":["0304397595001387"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(95)00138-7","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1996,10]]}}}