{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,29]],"date-time":"2025-09-29T00:05:17Z","timestamp":1759104317900,"version":"3.44.0"},"reference-count":24,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[1998,11,1]],"date-time":"1998-11-01T00:00:00Z","timestamp":909878400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[1998,11,1]],"date-time":"1998-11-01T00:00:00Z","timestamp":909878400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[1999,2,16]],"date-time":"1999-02-16T00:00:00Z","timestamp":919123200000},"content-version":"vor","delay-in-days":107,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[1998,11]]},"DOI":"10.1016\/s0166-218x(98)00065-1","type":"journal-article","created":{"date-parts":[[2003,5,12]],"date-time":"2003-05-12T19:10:20Z","timestamp":1052766620000},"page":"29-57","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":7,"title":["A 2 superstring approximation algorithm"],"prefix":"10.1016","volume":"88","author":[{"given":"Chris","family":"Armen","sequence":"first","affiliation":[]},{"given":"Clifford","family":"Stein","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0166-218X(98)00065-1_BIB1","doi-asserted-by":"crossref","DOI":"10.1349\/ddlp.1386","article-title":"Approximation algorithms for the shortest superstring problem","author":"Armen","year":"1995"},{"key":"10.1016\/S0166-218X(98)00065-1_BIB2","series-title":"Proceedings of Workshop on Algorithms and Data Structures","first-page":"494","article-title":"Improved length bounds for the shortest superstring problem","author":"Armen","year":"1995"},{"issue":"2","key":"10.1016\/S0166-218X(98)00065-1_BIB3","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1089\/cmb.1995.2.307","article-title":"Short superstrings and the structure of overlapping strings","volume":"2","author":"Armen","year":"1995","journal-title":"J. Comput. Biol."},{"issue":"4","key":"10.1016\/S0166-218X(98)00065-1_BIB4","doi-asserted-by":"crossref","first-page":"630","DOI":"10.1145\/179812.179818","article-title":"Linear approximation of shortest superstrings","volume":"41","author":"Blum","year":"1994","journal-title":"J. ACM"},{"issue":"2","key":"10.1016\/S0166-218X(98)00065-1_BIB5","doi-asserted-by":"crossref","first-page":"340","DOI":"10.1006\/jagm.1997.0861","article-title":"Rotations of periodic strings and short superstrings","volume":"24","author":"Breslauer","year":"1997","journal-title":"J. Algorithms"},{"year":"1990","series-title":"Introduction to Algorithms","author":"Cormen","key":"10.1016\/S0166-218X(98)00065-1_BIB6"},{"key":"10.1016\/S0166-218X(98)00065-1_BIB7","series-title":"Proceedings of 4th Scandinavian Workshop on Algorithm Theory","first-page":"95","article-title":"Parallel and sequential approximations of shortest superstrings","author":"Czumaj","year":"1994"},{"year":"1988","series-title":"Computational Molecular Biology, Sources and Methods for Sequence Analysis","key":"10.1016\/S0166-218X(98)00065-1_BIB8"},{"key":"10.1016\/S0166-218X(98)00065-1_BIB9","first-page":"109","article-title":"Uniqueness theorems for periodic functions","volume":"vol. 16","author":"Fine","year":"1965"},{"key":"10.1016\/S0166-218X(98)00065-1_BIB10","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1002\/net.3230120103","article-title":"On the worst case performance of some algorithms for the asymmetric travelling salesman problem","volume":"12","author":"Frieze","year":"1982","journal-title":"Networks"},{"key":"10.1016\/S0166-218X(98)00065-1_BIB11","doi-asserted-by":"crossref","first-page":"50","DOI":"10.1016\/0022-0000(80)90004-5","article-title":"On finding minimal length superstrings","volume":"20","author":"Gallant","year":"1980","journal-title":"J. Comput. System Sci."},{"issue":"41","key":"10.1016\/S0166-218X(98)00065-1_BIB12","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1016\/0020-0190(92)90176-V","article-title":"An efficient algorithm for the all pairs suffix-prefix problem","author":"Gusfield","year":"1992","journal-title":"Inform. Process. Lett."},{"issue":"134","key":"10.1016\/S0166-218X(98)00065-1_BIB13","doi-asserted-by":"crossref","first-page":"473","DOI":"10.1016\/0304-3975(94)90249-6","article-title":"Approximating shortest superstrings with constraints","author":"Jiang","year":"1994","journal-title":"Theoret. Comput. Sci."},{"article-title":"Exact and approximation algorithms for DNA sequence reconstruction","year":"1991","author":"Kececioglu","key":"10.1016\/S0166-218X(98)00065-1_BIB14"},{"issue":"1\/2","key":"10.1016\/S0166-218X(98)00065-1_BIB15","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1007\/BF01188580","article-title":"Combinatorial algorithms for dna sequence assembly","volume":"13","author":"Kececioglu","year":"1995","journal-title":"Algorithmica"},{"key":"10.1016\/S0166-218X(98)00065-1_BIB16","series-title":"Proceedings of the 35th Annual Symposium on Foundations of Computer Science","article-title":"Long tours and short superstrings","author":"Kosaraju","year":"1994"},{"key":"10.1016\/S0166-218X(98)00065-1_BIB17","series-title":"Proceedings of the 31st Annual Symposium on Foundations of Computer Science","first-page":"125","article-title":"Towards a DNA sequencing theory (Learning a string)","author":"Li","year":"1990"},{"year":"1982","series-title":"Combinatorial Optimization, Algorithms and Complexity","author":"Papadimitriou","key":"10.1016\/S0166-218X(98)00065-1_BIB18"},{"key":"10.1016\/S0166-218X(98)00065-1_BIB19","series-title":"Proceedings of the IFIP Congress","first-page":"53","article-title":"Algorithms for some string matching problems arising in molecular genetics","author":"Peltola","year":"1983"},{"year":"1994","series-title":"String Searching Algorithms","author":"Stephen","key":"10.1016\/S0166-218X(98)00065-1_BIB20"},{"year":"1988","series-title":"Data Compression: Methods and Theory","author":"Storer","key":"10.1016\/S0166-218X(98)00065-1_BIB21"},{"key":"10.1016\/S0166-218X(98)00065-1_BIB22","unstructured":"Z Sweedyk, A 2\u221212 approximation algorithm for shortest superstring, SIAM J. Comput., to appear."},{"key":"10.1016\/S0166-218X(98)00065-1_BIB23","series-title":"Proceedings of the 34th Annual Symposium on Foundations of Computer Science","first-page":"158","article-title":"Approximating shortest superstrings","author":"Teng","year":"1993"},{"key":"10.1016\/S0166-218X(98)00065-1_BIB24","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. Comput."}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X98000651?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X98000651?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,9,28]],"date-time":"2025-09-28T11:56:39Z","timestamp":1759060599000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X98000651"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,11]]},"references-count":24,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1998,11]]}},"alternative-id":["S0166218X98000651"],"URL":"https:\/\/doi.org\/10.1016\/s0166-218x(98)00065-1","relation":{},"ISSN":["0166-218X"],"issn-type":[{"type":"print","value":"0166-218X"}],"subject":[],"published":{"date-parts":[[1998,11]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"A  superstring approximation algorithm","name":"articletitle","label":"Article Title"},{"value":"Discrete Applied Mathematics","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/S0166-218X(98)00065-1","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 1998 Published by Elsevier B.V.","name":"copyright","label":"Copyright"}]}}