{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T12:25:50Z","timestamp":1742991950924,"version":"3.40.3"},"publisher-location":"Cham","reference-count":16,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030046507"},{"type":"electronic","value":"9783030046514"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"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":[[2018]]},"DOI":"10.1007\/978-3-030-04651-4_7","type":"book-chapter","created":{"date-parts":[[2018,11,15]],"date-time":"2018-11-15T19:56:50Z","timestamp":1542311810000},"page":"94-107","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["New Results About the Linearization of Scaffolds Sharing Repeated Contigs"],"prefix":"10.1007","author":[{"given":"Dorine","family":"Tabary","sequence":"first","affiliation":[]},{"given":"Tom","family":"Davot","sequence":"additional","affiliation":[]},{"given":"Mathias","family":"Weller","sequence":"additional","affiliation":[]},{"given":"Annie","family":"Chateau","sequence":"additional","affiliation":[]},{"given":"Rodolphe","family":"Giroudeau","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,11,16]]},"reference":[{"issue":"3","key":"7_CR1","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1142\/S0218195912500045","volume":"22","author":"MD Berg","year":"2012","unstructured":"Berg, M.D., Khosravi, A.: Optimal binary space partitions for segments in the plane. Int. J. Comput. Geom. Appl. 22(3), 187\u2013206 (2012)","journal-title":"Int. J. Comput. Geom. Appl."},{"key":"7_CR2","unstructured":"Berman, P., Karpinski, M., Scott, A.D.: Approximation hardness and satisfiability of bounded occurrence instances of SAT. Electronic Colloquium on Computational Complexity (ECCC), vol. 10, no. 022 (2003)"},{"issue":"3","key":"7_CR3","doi-asserted-by":"publisher","first-page":"415","DOI":"10.1007\/s10577-015-9499-z","volume":"23","author":"MA Biscotti","year":"2015","unstructured":"Biscotti, M.A., Olmo, E., Heslop-Harrison, J.S.: Repetitive DNA in eukaryotic genomes. Chromosome Res. 23(3), 415\u2013420 (2015)","journal-title":"Chromosome Res."},{"key":"7_CR4","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. Theor. Comput. Sci. 595, 92\u2013106 (2015). https:\/\/doi.org\/10.1016\/j.tcs.2015.06.023","journal-title":"Theor. Comput. Sci."},{"key":"7_CR5","doi-asserted-by":"crossref","unstructured":"Davot, T., Chateau, A., Giroudeau, R., Weller, M.: On the hardness of approximating the linearization of scaffolds sharing repeated contigs, Accepted to RecombCG 2018","DOI":"10.1007\/978-3-030-00834-5_5"},{"issue":"4","key":"7_CR6","doi-asserted-by":"publisher","first-page":"798","DOI":"10.1145\/502090.502098","volume":"48","author":"J H\u00e5stad","year":"2001","unstructured":"H\u00e5stad, J.: Some optimal inapproximability results. J. ACM 48(4), 798\u2013859 (2001)","journal-title":"J. ACM"},{"issue":"3","key":"7_CR7","doi-asserted-by":"publisher","first-page":"R42","DOI":"10.1186\/gb-2014-15-3-r42","volume":"15","author":"M Hunt","year":"2014","unstructured":"Hunt, M., Newbold, C., Berriman, M., Otto, T.: A comprehensive evaluation of assembly scaffolding tools. Genome Biol. 15(3), R42 (2014)","journal-title":"Genome Biol."},{"issue":"9","key":"7_CR8","doi-asserted-by":"publisher","first-page":"e80","DOI":"10.1093\/nar\/gku210","volume":"42","author":"P Koch","year":"2014","unstructured":"Koch, P., Platzer, M., Downie, B.R.: RepARK-de novo creation of repeat libraries from whole-genome NGS reads. Nucleic Acids Res. 42(9), e80 (2014)","journal-title":"Nucleic Acids Res."},{"key":"7_CR9","doi-asserted-by":"crossref","unstructured":"Mandric, I., Lindsay, J., M\u0103ndoiu, I.I., Zelikovsky, A.: Scaffolding algorithms. In: M\u0103ndoiu, I., Zelikovsky, A. (eds.) Computational Methods for Next Generation Sequencing Data Analysis, Chap. 5, pp. 107\u2013132. Wiley (2016)","DOI":"10.1002\/9781119272182"},{"issue":"3","key":"7_CR10","doi-asserted-by":"publisher","first-page":"425","DOI":"10.1016\/0022-0000(91)90023-X","volume":"43","author":"CH Papadimitriou","year":"1991","unstructured":"Papadimitriou, C.H., Yannakakis, M.: Optimization, approximation, and complexity classes. J. Comput. Syst. Sci. 43(3), 425\u2013440 (1991)","journal-title":"J. Comput. Syst. Sci."},{"key":"7_CR11","doi-asserted-by":"publisher","first-page":"242","DOI":"10.1186\/1471-2105-12-242","volume":"12","author":"N Philippe","year":"2011","unstructured":"Philippe, N., Salson, M., Lecroq, T., L\u00e9onard, M., Commes, T., Rivals, E.: Querying large read collections in main memory: a versatile data structure. BMC Bioinform. 12, 242 (2011). https:\/\/doi.org\/10.1186\/1471-2105-12-242","journal-title":"BMC Bioinform."},{"issue":"1","key":"7_CR12","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1186\/1471-2164-13-341","volume":"13","author":"M Quail","year":"2012","unstructured":"Quail, M., et al.: A tale of three next generation sequencing platforms: comparison of ion torrent, pacific biosciences and illumina miseq sequencers. BMC Genomics 13(1), 341 (2012)","journal-title":"BMC Genomics"},{"issue":"8","key":"7_CR13","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":"7_CR14","doi-asserted-by":"publisher","first-page":"1771","DOI":"10.1007\/s00453-018-0405-x","volume":"80","author":"M Weller","year":"2018","unstructured":"Weller, M., Chateau, A., Dallard, C., Giroudeau, R.: Scaffolding problems revisited: complexity, approximation and fixed parameter tractable algorithms, and some special cases. Algorithmica 80(6), 1771\u20131803 (2018)","journal-title":"Algorithmica"},{"issue":"Suppl. 14","key":"7_CR15","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":"7_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1007\/978-3-319-71147-8_38","volume-title":"Combinatorial Optimization and Applications","author":"M Weller","year":"2017","unstructured":"Weller, M., Chateau, A., Giroudeau, R.: On the linearization of scaffolds sharing repeated contigs. In: Gao, X., Du, H., Han, M. (eds.) COCOA 2017. LNCS, vol. 10628, pp. 509\u2013517. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-71147-8_38"}],"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-030-04651-4_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T15:47:07Z","timestamp":1710344827000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-04651-4_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783030046507","9783030046514"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-04651-4_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"16 November 2018","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":"Atlanta, GA","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 December 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 December 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cocoa2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/spacl.kennesaw.edu\/cocoa2018\/cfp.html","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}