{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,30]],"date-time":"2025-06-30T11:26:25Z","timestamp":1751282785707},"reference-count":14,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1995,6,1]],"date-time":"1995-06-01T00:00:00Z","timestamp":801964800000},"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":6621,"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,6]]},"DOI":"10.1016\/0304-3975(94)00257-j","type":"journal-article","created":{"date-parts":[[2003,5,13]],"date-time":"2003-05-13T00:04:58Z","timestamp":1052784298000},"page":"353-362","source":"Crossref","is-referenced-by-count":4,"title":["On the approximation of longest common nonsupersequences and shortest common nonsubsequences"],"prefix":"10.1016","volume":"143","author":[{"given":"Louxin","family":"Zhang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(94)00257-J_BIB1","series-title":"Proc. 23rd ACM Symp. on Theory of Computing","first-page":"328","article-title":"Linear approximation of shortest superstrings","author":"Blum","year":"1991"},{"key":"10.1016\/0304-3975(94)00257-J_BIB2","unstructured":"P. Bonizzoni, M. Duella and G. Mauri, Approximation complexity of longest common subsequence and shortest common supersequence over fixed alphabet, Technical Report 117\/94, Universit\u00e0 degli Studi Milano, Italy."},{"key":"10.1016\/0304-3975(94)00257-J_BIB3","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1016\/0004-3702(92)90016-Q","article-title":"Theory and algorithms for plan merging","volume":"57","author":"Foulser","year":"1992","journal-title":"Artificial Intelligence"},{"key":"10.1016\/0304-3975(94)00257-J_BIB4","series-title":"Computers and Intractability","author":"Garey","year":"1979"},{"key":"10.1016\/0304-3975(94)00257-J_BIB5","doi-asserted-by":"crossref","first-page":"363","DOI":"10.1016\/0304-3975(93)90167-R","article-title":"On the complexity of the learning strings and sequences","volume":"119","author":"Jiang","year":"1993","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(94)00257-J_BIB6","unstructured":"T. Jiang and M. Li, On the approximation of shortest common supersequences and longest common subsequences, submitted for publication."},{"key":"10.1016\/0304-3975(94)00257-J_BIB7","series-title":"Computational Molecular Biology, Sources and Methods for Sequence Analysis","year":"1988"},{"key":"10.1016\/0304-3975(94)00257-J_BIB8","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(94)00257-J_BIB9","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(94)00257-J_BIB10","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(94)00257-J_BIB11","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1016\/0304-3975(81)90075-X","article-title":"The shortest common supersequences 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(94)00257-J_BIB12","unstructured":"A. Rubinov and V. Timkovsky, String non-inclusion optimization problems, SIAM J. Discrete Math., in print."},{"key":"10.1016\/0304-3975(94)00257-J_BIB13","series-title":"Data Compression: Methods and Theory","author":"Storer","year":"1988"},{"key":"10.1016\/0304-3975(94)00257-J_BIB14","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"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439759400257J?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439759400257J?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,29]],"date-time":"2019-04-29T03:23:12Z","timestamp":1556508192000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/030439759400257J"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,6]]},"references-count":14,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1995,6]]}},"alternative-id":["030439759400257J"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(94)00257-j","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1995,6]]}}}