{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T16:18:33Z","timestamp":1743092313677,"version":"3.40.3"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319167053"},{"type":"electronic","value":"9783319167060"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-16706-0_29","type":"book-chapter","created":{"date-parts":[[2015,3,25]],"date-time":"2015-03-25T08:54:01Z","timestamp":1427273641000},"page":"281-292","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Gap Filling as Exact Path Length Problem"],"prefix":"10.1007","author":[{"given":"Leena","family":"Salmela","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kristoffer","family":"Sahlin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Veli","family":"M\u00e4kinen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alexandru I.","family":"Tomescu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,3,26]]},"reference":[{"issue":"6","key":"29_CR1","doi-asserted-by":"publisher","first-page":"R56","DOI":"10.1186\/gb-2012-13-6-r56","volume":"13","author":"M Boetzer","year":"2012","unstructured":"Boetzer, M., Pirovano, W.: Toward almost closed genomes with GapFiller. Genome Biology 13(6), R56 (2012)","journal-title":"Genome Biology"},{"issue":"20","key":"29_CR2","doi-asserted-by":"publisher","first-page":"2959","DOI":"10.1093\/bioinformatics\/btu406","volume":"30","author":"E Drezen","year":"2014","unstructured":"Drezen, E., et al.: GATB: genome assembly & analysis tool box. Bioinformatics 30(20), 2959\u20132961 (2014)","journal-title":"Bioinformatics"},{"key":"29_CR3","doi-asserted-by":"crossref","unstructured":"Durbin, R., et al.: Biological Sequence Analysis: Probabilistic Models of Proteins and Nucleic Acids. Cambridge University Press (1998)","DOI":"10.1017\/CBO9780511790492"},{"issue":"3","key":"29_CR4","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1017\/S0963548300000675","volume":"2","author":"ME Dyer","year":"1993","unstructured":"Dyer, M.E., et al.: A mildly exponential time algorithm for approximating the number of solutions to a multidimensional knapsack problem. Combinatorics, Probability & Computing 2(3), 271\u2013284 (1993)","journal-title":"Combinatorics, Probability & Computing"},{"key":"29_CR5","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"MR 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":"29_CR6","doi-asserted-by":"publisher","first-page":"1513","DOI":"10.1073\/pnas.1017351108","volume":"108","author":"S Gnerre","year":"2010","unstructured":"Gnerre, S., et al.: High-quality draft assemblies of mammalian genomes from massively parallel sequence data. Proceedings of the National Academy of Sciences 108(4), 1513\u20131518 (2010)","journal-title":"Proceedings of the National Academy of Sciences"},{"issue":"8","key":"29_CR7","doi-asserted-by":"publisher","first-page":"1072","DOI":"10.1093\/bioinformatics\/btt086","volume":"29","author":"A Gurevich","year":"2013","unstructured":"Gurevich, A., et al.: QUAST: quality assessment tool for genome assemblies. Bioinformatics 29(8), 1072\u20131075 (2013)","journal-title":"Bioinformatics"},{"key":"29_CR8","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/978-1-4684-2001-2_9","volume-title":"Complexity of Computer Computations","author":"RM Karp","year":"1972","unstructured":"Karp, R.M.: Reducibility among combinatorial problems. In: Miller, R.E., Thatcher, J.W. (eds.) Complexity of Computer Computations, pp. 85\u2013103. Plenum Press, New York (1972)"},{"issue":"2","key":"29_CR9","doi-asserted-by":"publisher","first-page":"R12","DOI":"10.1186\/gb-2004-5-2-r12","volume":"5","author":"S Kurtz","year":"2004","unstructured":"Kurtz, S., et al.: Versatile and open software for comparing large genomes. Genome Biology 5(2), R12 (2004)","journal-title":"Genome Biology"},{"issue":"3","key":"29_CR10","doi-asserted-by":"publisher","first-page":"R25","DOI":"10.1186\/gb-2009-10-3-r25","volume":"10","author":"B Langmead","year":"2009","unstructured":"Langmead, B., et al.: Ultrafast and memory-efficient alignment of short DNA sequences to the human genome. Genome Biology 10(3), R25 (2009)","journal-title":"Genome Biology"},{"issue":"14","key":"29_CR11","doi-asserted-by":"publisher","first-page":"1754","DOI":"10.1093\/bioinformatics\/btp324","volume":"25","author":"H Li","year":"2009","unstructured":"Li, H., Durbin, R.: Fast and accurate short read alignment with Burrows-Wheeler transform. Bioinformatics 25(14), 1754\u20131760 (2009)","journal-title":"Bioinformatics"},{"key":"29_CR12","doi-asserted-by":"crossref","unstructured":"Luo, R., et al.: SOAPdenovo2: an empirically improved memory-efficient short-read de novo assembler. GigaScience 1(18) (2012)","DOI":"10.1186\/2047-217X-1-18"},{"issue":"suppl. 14","key":"29_CR13","doi-asserted-by":"publisher","first-page":"S8","DOI":"10.1186\/1471-2105-13-S14-S8","volume":"13","author":"F Nadalin","year":"2012","unstructured":"Nadalin, F., et al.: GapFiller: a de novo assembly approach to fill the gap within paired reads. BMC Bioinformatics 13(suppl. 14), S8 (2012)","journal-title":"BMC Bioinformatics"},{"issue":"1","key":"29_CR14","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1006\/jagm.2001.1201","volume":"42","author":"M Nyk\u00e4nen","year":"2002","unstructured":"Nyk\u00e4nen, M., Ukkonen, E.: The exact path length problem. J. Algorithms 42(1), 41\u201353 (2002)","journal-title":"J. Algorithms"},{"issue":"2","key":"29_CR15","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1093\/bib\/bbs086","volume":"15","author":"S Pabinger","year":"2013","unstructured":"Pabinger, S., et al.: A survey of tools for variant analysis of next-generation genome sequencing data. Briefings in Bioinformatics 15(2), 256\u2013278 (2013)","journal-title":"Briefings in Bioinformatics"},{"issue":"suppl. 1","key":"29_CR16","doi-asserted-by":"publisher","first-page":"S225","DOI":"10.1093\/bioinformatics\/17.suppl_1.S225","volume":"17","author":"PA Pevzner","year":"2001","unstructured":"Pevzner, P.A., Tang, H.: Fragment assembly with double-barreled data. Bioinformatics 17(suppl. 1), S225\u2013S233 (2001)","journal-title":"Bioinformatics"},{"issue":"3","key":"29_CR17","doi-asserted-by":"publisher","first-page":"557","DOI":"10.1101\/gr.131383.111","volume":"22","author":"SL Salzberg","year":"2012","unstructured":"Salzberg, S.L., et al.: GAGE: A critical evaluation of genome assemblies and assembly algorithms. Genome Research 22(3), 557\u2013567 (2012)","journal-title":"Genome Research"},{"key":"29_CR18","doi-asserted-by":"publisher","first-page":"549","DOI":"10.1101\/gr.126953.111","volume":"22","author":"JT Simpson","year":"2012","unstructured":"Simpson, J.T., Durbin, R.: Efficient de novo assembly of large genomes using compressed data structures. Genome Research 22, 549\u2013556 (2012)","journal-title":"Genome Research"},{"key":"29_CR19","doi-asserted-by":"publisher","first-page":"1117","DOI":"10.1101\/gr.089532.108","volume":"19","author":"J Simpson","year":"2009","unstructured":"Simpson, J., et al.: ABySS: A parallel assembler for short read sequence data. Genome Research 19, 1117\u20131123 (2009)","journal-title":"Genome Research"},{"issue":"1","key":"29_CR20","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1186\/1471-2105-12-95","volume":"12","author":"J Wetzel","year":"2011","unstructured":"Wetzel, J., et al.: Assessing the benefits of using mate-pairs to resolve repeats in de novo short-read prokaryotic assemblies. BMC Bioinformatics 12(1), 95 (2011)","journal-title":"BMC Bioinformatics"}],"container-title":["Lecture Notes in Computer Science","Research in Computational Molecular Biology"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-16706-0_29","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,31]],"date-time":"2023-01-31T02:32:00Z","timestamp":1675132320000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-16706-0_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319167053","9783319167060"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-16706-0_29","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"26 March 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}