{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T11:03:14Z","timestamp":1757588594680},"reference-count":10,"publisher":"Elsevier BV","issue":"4","license":[{"start":{"date-parts":[[1992,12,1]],"date-time":"1992-12-01T00:00:00Z","timestamp":723168000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information Processing Letters"],"published-print":{"date-parts":[[1992,12]]},"DOI":"10.1016\/0020-0190(92)90084-9","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:37:30Z","timestamp":1027654650000},"page":"195-199","source":"Crossref","is-referenced-by-count":6,"title":["A note on shortest superstrings with flipping"],"prefix":"10.1016","volume":"44","author":[{"given":"Tao","family":"Jiang","sequence":"first","affiliation":[]},{"given":"Ming","family":"Li","sequence":"additional","affiliation":[]},{"given":"Ding-zhu","family":"Du","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(92)90084-9_BIB1","unstructured":"A. Blum, Personal communication"},{"key":"10.1016\/0020-0190(92)90084-9_BIB2","first-page":"328","article-title":"Linear approximation of shortest superstrings","author":"Blum","year":"1991","journal-title":"Proc. 23rd ACM Symp. on Theory of Computing"},{"key":"10.1016\/0020-0190(92)90084-9_BIB3","doi-asserted-by":"crossref","first-page":"50","DOI":"10.1016\/0022-0000(80)90004-5","article-title":"On finding minimal length superstring","volume":"20","author":"Gallant","year":"1980","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0020-0190(92)90084-9_BIB4","series-title":"Computers and Intractability","author":"Garey","year":"1979"},{"key":"10.1016\/0020-0190(92)90084-9_BIB5","author":"Jiang","year":"1991","journal-title":"Towards a DNA sequencing theory"},{"key":"10.1016\/0020-0190(92)90084-9_BIB6","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1109\/FSCS.1990.89531","article-title":"Towards a DNA sequencing theory","author":"Li","year":"1990","journal-title":"Proc. 31st IEEE Symp. on Found. of Computer Science"},{"key":"10.1016\/0020-0190(92)90084-9_BIB7","first-page":"53","article-title":"Algorithms for some string matching problems arising in molecular genetics","author":"Peltola","year":"1983","journal-title":"Proc. IFIP Congress, Information Processing 83"},{"key":"10.1016\/0020-0190(92)90084-9_BIB8","series-title":"Data Compression: Methods and Theory","author":"Storer","year":"1988"},{"key":"10.1016\/0020-0190(92)90084-9_BIB9","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1016\/0304-3975(88)90167-3","article-title":"A greedy approximation algorithm for constructing shortest common superstrings","volume":"57","author":"Tarhio","year":"1988","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0020-0190(92)90084-9_BIB10","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0890-5401(89)90044-8","article-title":"Approximation algorithms for the shortest common superstring problem","volume":"83","author":"Turner","year":"1989","journal-title":"Inform. and Comput."}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019092900849?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019092900849?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,2,5]],"date-time":"2020-02-05T10:40:16Z","timestamp":1580899216000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0020019092900849"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,12]]},"references-count":10,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1992,12]]}},"alternative-id":["0020019092900849"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(92)90084-9","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1992,12]]}}}