{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,8]],"date-time":"2025-12-08T22:04:07Z","timestamp":1765231447235},"reference-count":7,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1994,3,1]],"date-time":"1994-03-01T00:00:00Z","timestamp":762480000000},"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":7078,"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":[[1994,3]]},"DOI":"10.1016\/0304-3975(92)00074-2","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:47:37Z","timestamp":1027655257000},"page":"205-228","source":"Crossref","is-referenced-by-count":39,"title":["More on the complexity of common superstring and supersequence problems"],"prefix":"10.1016","volume":"125","author":[{"given":"Martin","family":"Middendorf","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(92)00074-2_BIB1","first-page":"50","article-title":"On finding minimal length superstrings","volume":"20","author":"Gallant","year":"1980","journal-title":"JCCS"},{"key":"10.1016\/0304-3975(92)00074-2_BIB2","series-title":"Computers and Intractability","author":"Garey","year":"1979"},{"key":"10.1016\/0304-3975(92)00074-2_BIB3","doi-asserted-by":"crossref","first-page":"676","DOI":"10.1137\/0211056","article-title":"Hamilton paths in grid graphs","volume":"11","author":"Itai","year":"1982","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0304-3975(92)00074-2_BIB4","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1137\/0206004","article-title":"Polynomial complete consecutive information retrieval problems","volume":"6","author":"Kou","year":"1977","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0304-3975(92)00074-2_BIB5","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(92)00074-2_BIB6","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(92)00074-2_BIB7","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"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397592000742?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397592000742?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:26:48Z","timestamp":1555129608000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397592000742"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,3]]},"references-count":7,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1994,3]]}},"alternative-id":["0304397592000742"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(92)00074-2","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1994,3]]}}}