{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:33:03Z","timestamp":1725557583952},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642135088"},{"type":"electronic","value":"9783642135095"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-13509-5_27","type":"book-chapter","created":{"date-parts":[[2010,6,22]],"date-time":"2010-06-22T09:19:57Z","timestamp":1277198397000},"page":"299-309","source":"Crossref","is-referenced-by-count":4,"title":["Algorithms for Three Versions of the Shortest Common Superstring Problem"],"prefix":"10.1007","author":[{"given":"Maxime","family":"Crochemore","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marek","family":"Cygan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Costas","family":"Iliopoulos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marcin","family":"Kubica","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jakub","family":"Radoszewski","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wojciech","family":"Rytter","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tomasz","family":"Wale\u0144","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"27_CR1","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 2 2\/3-approximation algorithm for the shortest superstring problem. In: Hirschberg, D.S., Myers, G. (eds.) CPM 1996. LNCS, vol.\u00a01075, pp. 87\u2013101. Springer, Heidelberg (1996)"},{"issue":"4","key":"27_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. J. ACM\u00a041(4), 630\u2013647 (1994)","journal-title":"J. ACM"},{"issue":"2","key":"27_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. Journal of Algorithms\u00a024(2), 340\u2013353 (1997)","journal-title":"Journal of Algorithms"},{"key":"27_CR4","doi-asserted-by":"publisher","DOI":"10.1142\/9789812778222","volume-title":"Jewels of Stringology","author":"M. Crochemore","year":"2002","unstructured":"Crochemore, M., Rytter, W.: Jewels of Stringology. World Scientific Publishing Company, Singapore (2002)"},{"issue":"11","key":"27_CR5","doi-asserted-by":"publisher","first-page":"1697","DOI":"10.1101\/gr.6435207","volume":"17","author":"J.C. Dohm","year":"2007","unstructured":"Dohm, J.C., Lottaz, C., Borodina, T., Himmelbauer, H.: SHARCGS, a fast and highly accurate short-read assembly algorithm for de novo genomic sequencing. Genome research\u00a017(11), 1697\u20131706 (2007)","journal-title":"Genome research"},{"key":"27_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"196","DOI":"10.1007\/978-3-540-39658-1_20","volume-title":"Algorithms - ESA 2003","author":"F. Eisenbrand","year":"2003","unstructured":"Eisenbrand, F.: Fast integer programming in fixed dimension. In: Di Battista, G., Zwick, U. (eds.) ESA 2003. LNCS, vol.\u00a02832, pp. 196\u2013207. Springer, Heidelberg (2003)"},{"issue":"1","key":"27_CR7","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. J. Comput. Syst. Sci.\u00a020(1), 50\u201358 (1980)","journal-title":"J. Comput. Syst. Sci."},{"key":"27_CR8","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman & Co., New York (1979)"},{"issue":"4","key":"27_CR9","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1016\/0020-0190(92)90176-V","volume":"41","author":"D. Gusfield","year":"1992","unstructured":"Gusfield, D., Landau, G.M., Schieber, B.: An efficient algorithm for the all pairs suffix-prefix problem. Inf. Process. Lett.\u00a041(4), 181\u2013185 (1992)","journal-title":"Inf. Process. Lett."},{"key":"27_CR10","volume-title":"Introduction to Automata Theory, Languages and Computation","author":"J.E. Hopcroft","year":"1979","unstructured":"Hopcroft, J.E., Ullman, J.D.: Introduction to Automata Theory, Languages and Computation. Addison-Wesley, Reading (1979)"},{"issue":"4","key":"27_CR11","doi-asserted-by":"publisher","first-page":"538","DOI":"10.1287\/moor.8.4.538","volume":"8","author":"H.W. Lenstra Jr.","year":"1983","unstructured":"Lenstra Jr., H.W.: Integer programming with a fixed number of variables. Mathematics of Operations Research\u00a08(4), 538\u2013548 (1983)","journal-title":"Mathematics of Operations Research"},{"issue":"11","key":"27_CR12","doi-asserted-by":"publisher","first-page":"1851","DOI":"10.1101\/gr.078212.108","volume":"18","author":"H. Li","year":"2008","unstructured":"Li, H., Ruan, J., Durbin, R.: Mapping short DNA sequencing reads and calling variants using mapping quality scores. Genome Research\u00a018(11), 1851\u20131858 (2008)","journal-title":"Genome Research"},{"issue":"5461","key":"27_CR13","doi-asserted-by":"publisher","first-page":"2196","DOI":"10.1126\/science.287.5461.2196","volume":"287","author":"E.W. Myers","year":"2000","unstructured":"Myers, E.W., et al.: A whole-genome assembly of drosophila. Science\u00a0287(5461), 2196\u20132204 (2000)","journal-title":"Science"},{"issue":"5","key":"27_CR14","doi-asserted-by":"publisher","first-page":"484","DOI":"10.1371\/journal.pone.0000484","volume":"2","author":"A. Sundquist","year":"2007","unstructured":"Sundquist, A., Ronaghi, M., Tang, H., Pevzner, P., Batzoglou, S.: Whole-genome sequencing and assembly with high-throughput, short-read technologies. PLoS ONE\u00a02(5), e484 (2007)","journal-title":"PLoS ONE"},{"issue":"1","key":"27_CR15","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. Theor. Comput. Sci.\u00a057(1), 131\u2013145 (1988)","journal-title":"Theor. Comput. Sci."},{"issue":"4","key":"27_CR16","doi-asserted-by":"publisher","first-page":"500","DOI":"10.1093\/bioinformatics\/btl629","volume":"23","author":"R.L. Warren","year":"2007","unstructured":"Warren, R.L., Sutton, G.G., Jones, S.J., Holt, R.A.: Assembling millions of short DNA sequences using SSAKE. Bioinformatics\u00a023(4), 500\u2013501 (2007)","journal-title":"Bioinformatics"},{"issue":"5","key":"27_CR17","doi-asserted-by":"publisher","first-page":"821","DOI":"10.1101\/gr.074492.107","volume":"18","author":"D.R. Zerbino","year":"2008","unstructured":"Zerbino, D.R., Birney, E.: Velvet: algorithms for de novo short read assembly using de Bruijn graphs. Genome research\u00a018(5), 821\u2013829 (2008)","journal-title":"Genome research"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Pattern Matching"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-13509-5_27.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,30]],"date-time":"2021-04-30T12:05:57Z","timestamp":1619784357000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-13509-5_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642135088","9783642135095"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-13509-5_27","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}