{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T00:52:52Z","timestamp":1740099172082,"version":"3.37.3"},"publisher-location":"Cham","reference-count":23,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030008338"},{"type":"electronic","value":"9783030008345"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"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":[[2018]]},"DOI":"10.1007\/978-3-030-00834-5_5","type":"book-chapter","created":{"date-parts":[[2018,9,7]],"date-time":"2018-09-07T03:53:16Z","timestamp":1536292396000},"page":"91-107","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["On the Hardness of Approximating Linearization of Scaffolds Sharing Repeated Contigs"],"prefix":"10.1007","author":[{"given":"Tom","family":"Davot","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"}]},{"given":"Mathias","family":"Weller","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,9,8]]},"reference":[{"key":"5_CR1","unstructured":"Berman, P., Karpinski, M., Scott, A.D.: Approximation hardness and satisfiability of bounded occurrence instances of SAT. Electronic Colloquium on Computational Complexity (ECCC), 10(022) (2003)"},{"issue":"3","key":"5_CR2","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."},{"issue":"12","key":"5_CR3","doi-asserted-by":"publisher","first-page":"2050","DOI":"10.1101\/gr.222109.117","volume":"27","author":"DL Cameron","year":"2017","unstructured":"Cameron, D.L., et al.: GRIDSS: sensitive and specific genomic rearrangement detection using positional de Bruijn graph assembly. Genome Res. 27(12), 2050\u20132060 (2017)","journal-title":"Genome Res."},{"key":"5_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":"5_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1007\/978-3-642-33122-0_19","volume-title":"Algorithms in Bioinformatics","author":"R Chikhi","year":"2012","unstructured":"Chikhi, R., Rizk, G.: Space-efficient and exact de Bruijn graph representation based on a bloom filter. In: Raphael, B., Tang, J. (eds.) WABI 2012. LNCS, vol. 7534, pp. 236\u2013248. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-33122-0_19"},{"issue":"9","key":"5_CR6","doi-asserted-by":"publisher","first-page":"1026","DOI":"10.1111\/eva.12178","volume":"7","author":"R Ekblom","year":"2014","unstructured":"Ekblom, R., Wolf, J.B.: A field guide to whole-genome sequencing, assembly and annotation. Evol. Appl. 7(9), 1026\u20131042 (2014)","journal-title":"Evol. Appl."},{"key":"5_CR7","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":"5_CR8","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":"9","key":"5_CR9","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."},{"issue":"5","key":"5_CR10","doi-asserted-by":"publisher","first-page":"589","DOI":"10.1093\/bioinformatics\/btp698","volume":"26","author":"H Li","year":"2010","unstructured":"Li, H., Durbin, R.: Fast and accurate long-read alignment with Burrows-Wheeler transform. Bioinformatics 26(5), 589\u2013595 (2010)","journal-title":"Bioinformatics"},{"issue":"16","key":"5_CR11","doi-asserted-by":"publisher","first-page":"2078","DOI":"10.1093\/bioinformatics\/btp352","volume":"25","author":"H Li","year":"2009","unstructured":"Li, H., et al.: The sequence alignment\/map format and samtools. Bioinformatics 25(16), 2078\u20132079 (2009)","journal-title":"Bioinformatics"},{"issue":"2","key":"5_CR12","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1137\/0211025","volume":"11","author":"D Lichtenstein","year":"1982","unstructured":"Lichtenstein, D.: Planar formulae and their uses. SIAM J. Comput. 11(2), 329\u2013343 (1982)","journal-title":"SIAM J. Comput."},{"key":"5_CR13","first-page":"41","volume":"105","author":"D Lokshtanov","year":"2011","unstructured":"Lokshtanov, D., Marx, D., Saurabh, S.: Lower bounds based on the exponential time hypothesis. Bull. EATCS 105, 41\u201372 (2011)","journal-title":"Bull. EATCS"},{"key":"5_CR14","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, pp. 107\u2013132. Wiley (2016). Chapter 5","DOI":"10.1002\/9781119272182.ch5"},{"issue":"16","key":"5_CR15","doi-asserted-by":"publisher","first-page":"1757","DOI":"10.1093\/bioinformatics\/btn322","volume":"24","author":"A Morgulis","year":"2008","unstructured":"Morgulis, A., Coulouris, G., Raytselis, Y., Madden, T.L., Agarwala, R., Sch\u00e4ffer, A.A.: Database indexing for production megablast searches. Bioinformatics 24(16), 1757\u20131764 (2008). https:\/\/doi.org\/10.1093\/bioinformatics\/btn322","journal-title":"Bioinformatics"},{"issue":"3","key":"5_CR16","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."},{"issue":"1","key":"5_CR17","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1186\/1471-2164-13-341","volume":"13","author":"MA Quail","year":"2012","unstructured":"Quail, M.A.: 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":"5_CR18","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."},{"key":"5_CR19","doi-asserted-by":"crossref","unstructured":"Trevisan, L.: Non-approximability results for optimization problems on bounded degree instances. In: Proceedings on 33rd Annual ACM Symposium on Theory of Computing, 6\u20138 July 2001, Heraklion, Crete, Greece, pp. 453\u2013461 (2001)","DOI":"10.1145\/380752.380839"},{"issue":"Suppl 14","key":"5_CR20","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 Bioinf. 16(Suppl 14), S2 (2015)","journal-title":"BMC Bioinf."},{"key":"5_CR21","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"},{"issue":"6","key":"5_CR22","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"},{"key":"5_CR23","unstructured":"Weller, M., Chateau, A., Giroudeau, R., Poss, M.: Scaffolding with repeated contigs using flow formulations (2018)"}],"container-title":["Lecture Notes in Computer Science","Comparative Genomics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-00834-5_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,4]],"date-time":"2023-09-04T22:53:04Z","timestamp":1693867984000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-00834-5_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783030008338","9783030008345"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-00834-5_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]}}}