{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,27]],"date-time":"2025-06-27T01:40:03Z","timestamp":1750988403261,"version":"3.41.0"},"publisher-location":"Cham","reference-count":17,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319711461"},{"type":"electronic","value":"9783319711478"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","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":[[2017]]},"DOI":"10.1007\/978-3-319-71147-8_38","type":"book-chapter","created":{"date-parts":[[2017,11,15]],"date-time":"2017-11-15T13:33:21Z","timestamp":1510752801000},"page":"509-517","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["On the Linearization of Scaffolds Sharing Repeated Contigs"],"prefix":"10.1007","author":[{"given":"Mathias","family":"Weller","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Annie","family":"Chateau","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rodolphe","family":"Giroudeau","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,11,16]]},"reference":[{"key":"38_CR1","doi-asserted-by":"crossref","unstructured":"Phillippy, A.M.: New advances in sequence assembly. Genome Res. 27(5), xi\u2013xiii (2017)","DOI":"10.1101\/gr.223057.117"},{"issue":"1","key":"38_CR2","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1038\/nrg3117","volume":"13","author":"TJ Treangen","year":"2012","unstructured":"Treangen, T.J., Salzberg, S.L.: Repetitive DNA and next-generation sequencing: computational challenges and solutions. Nat. Rev. Genet. 13(1), 36\u201346 (2012)","journal-title":"Nat. Rev. Genet."},{"issue":"8","key":"38_CR3","doi-asserted-by":"publisher","first-page":"3391","DOI":"10.1021\/cr0683008","volume":"107","author":"H Tang","year":"2007","unstructured":"Tang, H.: Genome assembly, rearrangement, and repeats. Chem. Rev. 107(8), 3391\u20133406 (2007)","journal-title":"Chem. Rev."},{"issue":"6","key":"38_CR4","doi-asserted-by":"publisher","first-page":"520","DOI":"10.1038\/hdy.2009.165","volume":"104","author":"E Lerat","year":"2010","unstructured":"Lerat, E.: Identifying repeats and transposable elements in sequenced genomes: how to find your way through the dense forest of programs. Heredity 104(6), 520\u2013533 (2010)","journal-title":"Heredity"},{"issue":"10","key":"38_CR5","doi-asserted-by":"publisher","first-page":"S11","DOI":"10.1186\/1471-2164-16-S10-S11","volume":"16","author":"Y Anselmetti","year":"2015","unstructured":"Anselmetti, Y., Berry, V., Chauve, C., Chateau, A., Tannier, E., B\u00e9rard, S.: Ancestral gene synteny reconstruction improves extant species scaffolding. BMC Genomics 16(10), S11 (2015)","journal-title":"BMC Genomics"},{"key":"38_CR6","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1186\/1471-2105-11-345","volume":"11","author":"A Dayarian","year":"2010","unstructured":"Dayarian, A., Michael, T.P., Sengupta, A.M.: SOPRA: scaffolding algorithm for paired reads via statistical optimization. BMC Bioinform. 11, 345 (2010)","journal-title":"BMC Bioinform."},{"issue":"11","key":"38_CR7","doi-asserted-by":"publisher","first-page":"1429","DOI":"10.1093\/bioinformatics\/bts175","volume":"28","author":"AA Gritsenko","year":"2012","unstructured":"Gritsenko, A.A., Nijkamp, J.F., Reinders, M.J.T., de Ridder, D.: GRASS: a generic algorithm for scaffolding next-generation sequencing assemblies. Bioinformatics 28(11), 1429\u20131437 (2012)","journal-title":"Bioinformatics"},{"issue":"4","key":"38_CR8","doi-asserted-by":"publisher","first-page":"428","DOI":"10.1093\/bioinformatics\/bts716","volume":"29","author":"N Donmez","year":"2013","unstructured":"Donmez, N., Brudno, M.L.: SCARPA: scaffolding reads with practical algorithms. Bioinformatics 29(4), 428\u2013434 (2013)","journal-title":"Bioinformatics"},{"issue":"1","key":"38_CR9","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1186\/1471-2105-15-281","volume":"15","author":"K Sahlin","year":"2014","unstructured":"Sahlin, K., Vezzi, F., Nystedt, B., Lundeberg, J., Arvestad, L.: BESST - efficient scaffolding of large fragmented assemblies. BMC Bioinform. 15(1), 281 (2014)","journal-title":"BMC Bioinform."},{"key":"38_CR10","doi-asserted-by":"publisher","first-page":"14515","DOI":"10.1038\/ncomms14515","volume":"8","author":"MD Cao","year":"2017","unstructured":"Cao, M.D., Nguyen, S.H., Ganesamoorthy, D., Elliott, A.G., Cooper, M.A., Coin, L.J.M.: Scaffolding and completing genome assemblies in real-time with nanopore sequencing. Nat. Commun. 8, 14515 (2017)","journal-title":"Nat. Commun."},{"key":"38_CR11","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1016\/j.tcs.2015.06.023","volume":"595","author":"A Chateau","year":"2015","unstructured":"Chateau, A., Giroudeau, R.: A complexity and approximation framework for the maximization scaffolding problem. Theoret. Comput. Sci. 595, 92\u2013106 (2015)","journal-title":"Theoret. Comput. Sci."},{"issue":"Suppl. 14","key":"38_CR12","doi-asserted-by":"publisher","first-page":"S2","DOI":"10.1186\/1471-2105-16-S14-S2","volume":"16","author":"M Weller","year":"2015","unstructured":"Weller, M., Chateau, A., Giroudeau, R.: Exact approaches for scaffolding. BMC Bioinform. 16(Suppl. 14), S2 (2015)","journal-title":"BMC Bioinform."},{"key":"38_CR13","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)"},{"key":"38_CR14","doi-asserted-by":"crossref","unstructured":"Crescenzi, P.: A short guide to approximation preserving reductions. In: Proceedings of 12th CCC, pp. 262\u2013273 (1997)","DOI":"10.1109\/CCC.1997.612321"},{"issue":"1","key":"38_CR15","doi-asserted-by":"publisher","first-page":"439","DOI":"10.4007\/annals.2005.162.439","volume":"162","author":"I Dinur","year":"2005","unstructured":"Dinur, I., Safra, S.: On the hardness of approximation minimum vertex cover. Ann. Math. 162(1), 439\u2013485 (2005)","journal-title":"Ann. Math."},{"issue":"3","key":"38_CR16","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1016\/j.jcss.2007.06.019","volume":"74","author":"S Khot","year":"2008","unstructured":"Khot, S., Regev, O.: Vertex cover might be hard to approximate to within 2-epsilon. J. Comput. Syst. Sci. 74(3), 335\u2013349 (2008)","journal-title":"J. Comput. Syst. Sci."},{"issue":"2","key":"38_CR17","doi-asserted-by":"publisher","first-page":"559","DOI":"10.1016\/j.jcss.2011.07.001","volume":"78","author":"M Weller","year":"2012","unstructured":"Weller, M., Komusiewicz, C., Niedermeier, R., Uhlmann, J.: On making directed graphs transitive. J. Comput. Syst. Sci. 78(2), 559\u2013574 (2012)","journal-title":"J. Comput. Syst. Sci."}],"container-title":["Lecture Notes in Computer Science","Combinatorial Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-71147-8_38","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,27]],"date-time":"2025-06-27T01:01:17Z","timestamp":1750986077000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-71147-8_38"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319711461","9783319711478"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-71147-8_38","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]},"assertion":[{"value":"16 November 2017","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"COCOA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Combinatorial Optimization and Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Shanghai","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2017","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 December 2017","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 December 2017","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cocoa2017","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/anl.sjtu.edu.cn\/cocoa2017\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}