{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,17]],"date-time":"2025-01-17T09:43:02Z","timestamp":1737106982702,"version":"3.33.0"},"publisher-location":"Berlin, Heidelberg","reference-count":6,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540413486"},{"type":"electronic","value":"9783540444114"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/3-540-44411-4_18","type":"book-chapter","created":{"date-parts":[[2007,6,18]],"date-time":"2007-06-18T22:52:31Z","timestamp":1182207151000},"page":"298-306","source":"Crossref","is-referenced-by-count":0,"title":["On the Approximation Ratio of the Group-Merge Algorithm for the Shortest Common Superstring Problem"],"prefix":"10.1007","author":[{"given":"Dirk","family":"Bongartz","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2002,1,22]]},"reference":[{"issue":"4","key":"18_CR1","doi-asserted-by":"publisher","first-page":"630","DOI":"10.1145\/179812.179818","volume":"41","author":"A. Blum","year":"1994","unstructured":"Blum, A., Jiang, T., Li, M., Tromp, J., Yannakakis, M.: Linear approximation for shortest superstrings. In: Journal of the ACM 41(4), pp. 630\u2013647, July 1994. 298, 299, 300, 303","journal-title":"Journal of the ACM"},{"key":"18_CR2","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1016\/0022-0000(80)90004-5","volume":"20","author":"J. Gallant","year":"1980","unstructured":"Gallant, J., Maier, D., Storer, J. A.: On Finding Minimal Length superstrings. In: Journal of Computer and System Sciences 20, pp. 50\u201358, 1980. 298, 303","journal-title":"Journal of Computer and System Sciences"},{"key":"18_CR3","doi-asserted-by":"crossref","unstructured":"Li, M.: Toward a DNA sequencing theory. In: Proc. 31st IEEE Symp. on Foundation of Computer Science, pp. 125\u2013134, 1990. 298, 300, 303","DOI":"10.1109\/FSCS.1990.89531"},{"key":"18_CR4","doi-asserted-by":"crossref","first-page":"387","DOI":"10.1007\/BF01192694","volume":"29","author":"T. Jiang","year":"1996","unstructured":"Jiang, T., Li, M.: DNA Sequencing and String Learning. In: Mathematical Systems Theory 29, pp. 387\u2013405, 1996. 298, 299, 300, 301, 302","journal-title":"Mathematical Systems Theory"},{"issue":"3","key":"18_CR5","doi-asserted-by":"publisher","first-page":"954","DOI":"10.1137\/S0097539796324661","volume":"29","author":"Z. Sweedyk","year":"1999","unstructured":"Sweedyk, Z.: A 2 1\/2-approximation algorithm for shortest superstring. In: SIAM Journal on Computing 29 (3), pp. 954\u201386, 1999. 298","journal-title":"SIAM Journal on Computing"},{"key":"18_CR6","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1016\/0304-3975(88)90167-3","volume":"57","author":"J. Tarhio","year":"1988","unstructured":"Tarhio, J., Ukkonen, E.: A greedy approximation algorithm for constructing shortest common superstrings. In: Theoretical Computer Science 57, pp. 131\u2013145, 1988. 300, 303, 305","journal-title":"Theoretical Computer Science"}],"container-title":["Lecture Notes in Computer Science","SOFSEM 2000: Theory and Practice of Informatics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44411-4_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,17]],"date-time":"2025-01-17T09:00:30Z","timestamp":1737104430000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44411-4_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540413486","9783540444114"],"references-count":6,"URL":"https:\/\/doi.org\/10.1007\/3-540-44411-4_18","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2000]]}}}