{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,11]],"date-time":"2025-02-11T05:12:32Z","timestamp":1739250752124,"version":"3.37.0"},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642024689"},{"type":"electronic","value":"9783642024696"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-02469-6_32","type":"book-chapter","created":{"date-parts":[[2009,6,27]],"date-time":"2009-06-27T09:11:03Z","timestamp":1246093863000},"page":"1526-1531","source":"Crossref","is-referenced-by-count":0,"title":["Generalized Greedy Algorithm for Shortest Superstring"],"prefix":"10.1007","author":[{"given":"Zhengjun","family":"Cao","sequence":"first","affiliation":[]},{"given":"Lihua","family":"Liu","sequence":"additional","affiliation":[]},{"given":"Olivier","family":"Markowitch","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"32_CR1","doi-asserted-by":"crossref","unstructured":"Armen, C., Stein, C.: A 2 2\/3-approximation algorithm for the shortest superstring problem. In: CPM, pp. 87\u2013101 (1996)","DOI":"10.1007\/3-540-61258-0_8"},{"issue":"4","key":"32_CR2","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 of shortest superstrings. Journal of ACM\u00a041(4), 630\u2013647 (1994)","journal-title":"Journal of ACM"},{"issue":"2","key":"32_CR3","doi-asserted-by":"publisher","first-page":"340","DOI":"10.1006\/jagm.1997.0861","volume":"24","author":"D. Breslauer","year":"1997","unstructured":"Breslauer, D., Jiang, T., Jiang, Z.: Rotations of periodic strings and short superstrings. J. Algorithms\u00a024(2), 340\u2013353 (1997)","journal-title":"J. Algorithms"},{"key":"32_CR4","doi-asserted-by":"crossref","unstructured":"Czumaj, A., Gasieniec, L., Piotrow, M., Rytter, W.: Parallel and sequential approximations of shortest superstrings. In: Scandinavian Workshop on Algorithm Theory, pp. 95\u2013106 (1994)","DOI":"10.1007\/3-540-58218-5_9"},{"issue":"1","key":"32_CR5","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1016\/j.ipl.2004.09.012","volume":"93","author":"H. Kaplan","year":"2005","unstructured":"Kaplan, H., Shafrir, N.: The greedy algorithm for shortest superstrings. Inf. Process. Lett.\u00a093(1), 13\u201317 (2005)","journal-title":"Inf. Process. Lett."},{"volume-title":"Computational Molecular Biology, sources and methods for sequence analysis","year":"1988","key":"32_CR6","unstructured":"Lesk, A. (ed.): Computational Molecular Biology, sources and methods for sequence analysis. Oxford University Press, Oxford (1988)"},{"key":"32_CR7","doi-asserted-by":"crossref","unstructured":"Li, M.: Towards a DNA sequencing theory. In: 31st IEEE Symp. on Foundations of Computer Science, pp. 125\u2013134 (1990)","DOI":"10.1109\/FSCS.1990.89531"},{"key":"32_CR8","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.: On finding minimal length superstrings. Journal of Computer and System Sciences\u00a020, 50\u201358 (1980)","journal-title":"Journal of Computer and System Sciences"},{"key":"32_CR9","unstructured":"Peltola, H., Soderlund, H., Tarhio, J., Ukkonen, E.: Algorithms for some string matching problems arising in molecular genetics. In: Proc. IFIP Congress, pp. 53\u201364 (1983)"},{"issue":"3","key":"32_CR10","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. SIAM J. Comput.\u00a029(3), 954\u2013986 (1999)","journal-title":"SIAM J. Comput."},{"key":"32_CR11","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1007\/978-3-662-04565-7","volume-title":"Approximation algorithm","author":"V. Vazirani","year":"2003","unstructured":"Vazirani, V.: Approximation algorithm, pp. 61\u201366. Springer, Heidelberg (2003)"}],"container-title":["Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering","Complex Sciences"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-02469-6_32","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,10]],"date-time":"2025-02-10T12:45:49Z","timestamp":1739191549000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-02469-6_32"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642024689","9783642024696"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-02469-6_32","relation":{},"ISSN":["1867-8211","1867-822X"],"issn-type":[{"type":"print","value":"1867-8211"},{"type":"electronic","value":"1867-822X"}],"subject":[],"published":{"date-parts":[[2009]]}}}