{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T18:42:02Z","timestamp":1725475322570},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540490241"},{"type":"electronic","value":"9783540684237"}],"license":[{"start":{"date-parts":[[2006,1,1]],"date-time":"2006-01-01T00:00:00Z","timestamp":1136073600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11925903_9","type":"book-chapter","created":{"date-parts":[[2006,12,13]],"date-time":"2006-12-13T16:03:04Z","timestamp":1166025784000},"page":"111-126","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Viral Genome Compression"],"prefix":"10.1007","author":[{"given":"Lucian","family":"Ilie","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Liviu","family":"Tinta","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Cristian","family":"Popescu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kathleen A.","family":"Hill","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"9_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"494","DOI":"10.1007\/3-540-60220-8_88","volume-title":"Proc. 5th Internat. Workshop on Algorithms and Data Structures","author":"C. Armen","year":"1995","unstructured":"Armen, C., Stein, C.: Improved length bounds for the shortest superstring problem. In: Proc. 5th Internat. Workshop on Algorithms and Data Structures 1995. LNCS, vol.\u00a0955, pp. 494\u2013505. Springer, Berlin (1995)"},{"key":"9_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1007\/3-540-61258-0_8","volume-title":"Combinatorial Pattern Matching","author":"C. Armen","year":"1996","unstructured":"Armen, C., Stein, C.: A \n                    \n                      \n                    \n                    $2\\frac{2}{3}$\n                   approximation algorithm for the shortest superstring problem. In: Hirschberg, D.S., Meyers, G. (eds.) CPM 1996. LNCS, vol.\u00a01075, pp. 87\u2013101. Springer, Heidelberg (1996)"},{"issue":"4","key":"9_CR3","doi-asserted-by":"crossref","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. J. Assoc. Comput. Mach.\u00a041(4), 630\u2013647 (1994)","journal-title":"J. Assoc. Comput. Mach."},{"key":"9_CR4","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, 340\u2013353 (1997)","journal-title":"J. Algorithms"},{"key":"9_CR5","volume-title":"Principles of Molecular Virology","author":"A.J. Cann","year":"2001","unstructured":"Cann, A.J.: Principles of Molecular Virology, 3rd edn. Elsevier Academic Press, London, San Diego (2001)","edition":"3"},{"key":"9_CR6","doi-asserted-by":"publisher","first-page":"1696","DOI":"10.1093\/bioinformatics\/18.12.1696","volume":"18","author":"X. Chen","year":"2002","unstructured":"Chen, X., Li, M., Ma, B., Tromp, J.: DNACompress: fast and effective DNA sequence compression. Bioinformatics\u00a018, 1696\u20131698 (2002)","journal-title":"Bioinformatics"},{"key":"9_CR7","volume-title":"Jewels of Stringology","author":"M. Crochemore","year":"2003","unstructured":"Crochemore, M., Rytter, W.: Jewels of Stringology. World Scientific Publisher, Singapore (2003)"},{"key":"9_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1007\/3-540-58218-5_9","volume-title":"Proc. First Scandinavian Workshop on Algorithm Theory","author":"A. Czumaj","year":"1994","unstructured":"Czumaj, A., Gasieniec, L., Piotrow, M., Rytter, W.: Parallel and sequential approximations of shortest superstrings. In: Proc. First Scandinavian Workshop on Algorithm Theory. LNCS, vol.\u00a0824, pp. 95\u2013106. Springer, Berlin (1994)"},{"key":"9_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"102","DOI":"10.1007\/978-3-540-30500-2_10","volume-title":"Implementation and Application of Automata","author":"M. Daley","year":"2005","unstructured":"Daley, M., McQuillan, I.: Viral Gene Compression: Complexity and Verification. In: Domaratzki, M., Okhotin, A., Salomaa, K., Yu, S. (eds.) CIAA 2004. LNCS, vol.\u00a03317, pp. 102\u2013112. Springer, Heidelberg (2005)"},{"issue":"1","key":"9_CR10","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 Comput. and Syst. Sci.\u00a020(1), 50\u201358 (1980)","journal-title":"Journal of Comput. and Syst. Sci."},{"key":"9_CR11","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1109\/SFCS.1994.365696","volume-title":"Proc. 35th Annual IEEE Symposium on Foundations of Computer Science","author":"R. Kosaraju","year":"1994","unstructured":"Kosaraju, R., Park, J., Stein, C.: Long tours and short superstrings. In: Proc. 35th Annual IEEE Symposium on Foundations of Computer Science, pp. 166\u2013177. IEEE Computer Society Press, Los Alamitos (1994)"},{"key":"9_CR12","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1080\/08948550214053","volume":"7","author":"D.C. Krakauer","year":"2002","unstructured":"Krakauer, D.C.: Evolutionary principles of genomic compression. Comments on Theor. Biol.\u00a07, 215\u2013236 (2002)","journal-title":"Comments on Theor. Biol."},{"key":"9_CR13","volume-title":"Introduction to Bioinformatics","author":"A. Lesk","year":"2002","unstructured":"Lesk, A.: Introduction to Bioinformatics. Oxford University Press, Oxford (2002)"},{"key":"9_CR14","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9781107326019","volume-title":"Algebraic Combinatorics on Words","author":"M. Lothaire","year":"2002","unstructured":"Lothaire, M.: Algebraic Combinatorics on Words. Cambridge University Press, Cambridge (2002)"},{"key":"9_CR15","unstructured":"Storer, J.: Data Compression: Methods and Theory. Computer Science Press (1988)"},{"issue":"3","key":"9_CR16","doi-asserted-by":"publisher","first-page":"954","DOI":"10.1137\/S0097539796324661","volume":"29","author":"Z. Sweedyk","year":"1999","unstructured":"Sweedyk, Z.: A \n                    \n                      \n                    \n                    $2\\frac{1}{2}$\n                  -approximation algorithms for shortest superstring. SIAM J. Comput.\u00a029(3), 954\u2013986 (1999)","journal-title":"SIAM J. Comput."},{"key":"9_CR17","first-page":"158","volume-title":"Proc. 34th Annual IEEE Symposium on Foundations of Computer Science","author":"S. Teng","year":"1993","unstructured":"Teng, S., Yao, F.: Approximating shortest superstrings. In: Proc. 34th Annual IEEE Symposium on Foundations of Computer Science, pp. 158\u2013165. IEEE Computer Society Press, Los Alamitos (1993)"}],"container-title":["Lecture Notes in Computer Science","DNA Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11925903_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,3,17]],"date-time":"2020-03-17T19:14:55Z","timestamp":1584472495000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11925903_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540490241","9783540684237"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/11925903_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]},"assertion":[{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}