{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:38:04Z","timestamp":1759639084634},"reference-count":8,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1988,4,1]],"date-time":"1988-04-01T00:00:00Z","timestamp":575856000000},"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":9238,"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":[[1988,4]]},"DOI":"10.1016\/0304-3975(88)90167-3","type":"journal-article","created":{"date-parts":[[2002,10,10]],"date-time":"2002-10-10T17:44:32Z","timestamp":1034271872000},"page":"131-145","source":"Crossref","is-referenced-by-count":98,"title":["A greedy approximation algorithm for constructing shortest common superstrings"],"prefix":"10.1016","volume":"57","author":[{"given":"Jorma","family":"Tarhio","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Esko","family":"Ukkonen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(88)90167-3_BIB1","doi-asserted-by":"crossref","first-page":"546","DOI":"10.1145\/1780.1802","article-title":"Optimization of parser tables for portable compilers","volume":"6","author":"Dencker","year":"1984","journal-title":"ACM TOPLAS"},{"key":"10.1016\/0304-3975(88)90167-3_BIB2","series-title":"Ph.D. Thesis","article-title":"String compression algorithms","author":"Gallant","year":"1982"},{"year":"1979","series-title":"Computers and Intractability","author":"Garey","key":"10.1016\/0304-3975(88)90167-3_BIB3"},{"key":"10.1016\/0304-3975(88)90167-3_BIB4","doi-asserted-by":"crossref","first-page":"363","DOI":"10.1002\/net.3230090406","article-title":"The greedy travelling salesman's problem","volume":"9","author":"Jenkyns","year":"1979","journal-title":"Networks"},{"key":"10.1016\/0304-3975(88)90167-3_BIB5","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1137\/0206024","article-title":"Fast pattern matching in strings","volume":"6","author":"Knuth","year":"1977","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0304-3975(88)90167-3_BIB6","series-title":"Tech. Rept. TR-233","article-title":"A note on complexity of the superstring problem","author":"Maier","year":"1977"},{"key":"10.1016\/0304-3975(88)90167-3_BIB7","series-title":"Information Processing 83 (Proc. of the IFIP Congress 1983)","first-page":"53","article-title":"Algorithms for some string matching problems arising in molecular genetics","author":"Peltola","year":"1983"},{"key":"10.1016\/0304-3975(88)90167-3_BIB8","doi-asserted-by":"crossref","first-page":"606","DOI":"10.1145\/359168.359175","article-title":"Storing a sparse table","volume":"22","author":"Tarjan","year":"1979","journal-title":"Comm. ACM"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397588901673?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397588901673?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T17:59:46Z","timestamp":1555178386000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397588901673"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1988,4]]},"references-count":8,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1988,4]]}},"alternative-id":["0304397588901673"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(88)90167-3","relation":{},"ISSN":["0304-3975"],"issn-type":[{"type":"print","value":"0304-3975"}],"subject":[],"published":{"date-parts":[[1988,4]]}}}