{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T03:41:41Z","timestamp":1740109301523,"version":"3.37.3"},"reference-count":37,"publisher":"Springer Science and Business Media LLC","issue":"7","license":[{"start":{"date-parts":[[2021,5,2]],"date-time":"2021-05-02T00:00:00Z","timestamp":1619913600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,5,2]],"date-time":"2021-05-02T00:00:00Z","timestamp":1619913600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"name":"ANR Projet Investissements d\u2019Avenir en bioinformatique IBC"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[2021,7]]},"DOI":"10.1007\/s00453-021-00819-6","type":"journal-article","created":{"date-parts":[[2021,5,3]],"date-time":"2021-05-03T16:51:45Z","timestamp":1620060705000},"page":"2063-2095","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Producing Genomic Sequences after Genome Scaffolding with Ambiguous Paths: Complexity, Approximation and Lower Bounds"],"prefix":"10.1007","volume":"83","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4203-5140","authenticated-orcid":false,"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"}]},{"given":"Dorine","family":"Tabary","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,5,2]]},"reference":[{"issue":"10","key":"819_CR1","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 Genom. 16(10), S11 (2015)","journal-title":"BMC Genom."},{"issue":"3","key":"819_CR2","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":"819_CR3","doi-asserted-by":"crossref","unstructured":"Berman, P., Karpinski, M.: On some tighter inapproximability results (extended abstract). In: Proceedings of the 26th International Colloquium on Automata, Languages and Programming, pp. 200\u2013209 (1999)","DOI":"10.1007\/3-540-48523-6_17"},{"key":"819_CR4","unstructured":"Berman, P., Karpinski, M., Scott, A.D.: Approximation hardness and satisfiability of bounded occurrence instances of SAT. In: Electronic Colloquium on Computational Complexity (ECCC) 10(022) (2003)"},{"key":"819_CR5","doi-asserted-by":"publisher","first-page":"1119","DOI":"10.1038\/nbt.2727","volume":"31","author":"JN Burton","year":"2013","unstructured":"Burton, J.N., Adey, A., Patwardhan, R.P., Qiu, R., Kitzman, J.O., Shendure, J.: Chromosome-scale scaffolding of de novo genome assemblies based on chromatin interactions. Nat. Biotechnol. 31, 1119\u20131125 (2013)","journal-title":"Nat. Biotechnol."},{"key":"819_CR6","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":"819_CR7","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)","journal-title":"Theor. Comput. Sci."},{"key":"819_CR8","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1186\/1748-7188-8-22","volume":"8","author":"R Chikhi","year":"2013","unstructured":"Chikhi, R., Rizk, G.: Space-efficient and exact de Bruijn graph representation based on a bloom filter. Algorithms Mol. Biol. 8, 22 (2013)","journal-title":"Algorithms Mol. Biol."},{"key":"819_CR9","unstructured":"Crescenzi, P.: A short guide to approximation preserving reductions. In: Proceedings of the Twelfth Annual IEEE Conference on Computational Complexity, Ulm, Germany, 24\u201327 June 1997, pp 262\u2013273 (1997)"},{"key":"819_CR10","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":"1","key":"819_CR11","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":"4","key":"819_CR12","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"},{"key":"819_CR13","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":"11","key":"819_CR14","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":"819_CR15","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":"819_CR16","doi-asserted-by":"publisher","first-page":"42","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), 42 (2014)","journal-title":"Genome Biol."},{"issue":"4","key":"819_CR17","doi-asserted-by":"publisher","first-page":"512","DOI":"10.1006\/jcss.2001.1774","volume":"63","author":"R Impagliazzo","year":"2001","unstructured":"Impagliazzo, R., Paturi, R., Zane, F.: Which problems have strongly exponential complexity? J. Comput. Syst. Sci. 63(4), 512\u2013530 (2001)","journal-title":"J. Comput. Syst. Sci."},{"issue":"3","key":"819_CR18","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":"1","key":"819_CR19","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1137\/S0097539705447372","volume":"37","author":"S Khot","year":"2007","unstructured":"Khot, S., Kindler, G., Mossel, E., O\u2019Donnell, R.: Optimal inapproximability results for MAX-CUT and other 2-variable CSPs? SIAM J. Comput. 37(1), 319\u2013357 (2007)","journal-title":"SIAM J. Comput."},{"issue":"1","key":"819_CR20","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1073\/pnas.76.1.41","volume":"76","author":"R Kolodner","year":"1979","unstructured":"Kolodner, R., Tewari, K.K.: Inverted repeats in chloroplast DNA from higher plants*. Proc. Natl. Acad. Sci. U. S. A. 76(1), 41\u201345 (1979)","journal-title":"Proc. Natl. Acad. Sci. U. S. A."},{"issue":"21","key":"819_CR21","doi-asserted-by":"publisher","first-page":"2964","DOI":"10.1093\/bioinformatics\/btr520","volume":"27","author":"S Koren","year":"2011","unstructured":"Koren, S., Treangen, T.J., Pop, M.: Bambus 2: scaffolding metagenomes. Bioinformatics 27(21), 2964\u20132971 (2011)","journal-title":"Bioinformatics"},{"issue":"6","key":"819_CR22","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":"16","key":"819_CR23","doi-asserted-by":"publisher","first-page":"2632","DOI":"10.1093\/bioinformatics\/btv211","volume":"31","author":"I Mandric","year":"2015","unstructured":"Mandric, I., Zelikovsky, A.: ScaffMatch: scaffolding algorithm based on maximum weight matching. Bioinformatics 31(16), 2632\u20132638 (2015)","journal-title":"Bioinformatics"},{"key":"819_CR24","first-page":"107","volume-title":"Computational Methods for Next Generation Sequencing Data Analysis","author":"I Mandric","year":"2016","unstructured":"Mandric, I., Lindsay, J., M\u0103ndoiu, I.I., Zelikovsky, A.: Scaffolding algorithms, chap\u00a05. In: M\u0103ndoiu, I., Zelikovsky, A. (eds.) Computational Methods for Next Generation Sequencing Data Analysis, pp. 107\u2013132. Wiley, Hoboken (2016)"},{"issue":"6","key":"819_CR25","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1016\/j.ygeno.2010.03.001","volume":"95","author":"JR Miller","year":"2010","unstructured":"Miller, J.R., Koren, S., Sutton, G.: Assembly algorithms for next-generation sequencing data. Genomics 95(6), 315\u2013327 (2010)","journal-title":"Genomics"},{"issue":"1","key":"819_CR26","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/j.ymgme.2013.04.024","volume":"110","author":"M Morey","year":"2013","unstructured":"Morey, M., Fern\u00e1ndez-Marmiesse, A., Casti\u00f1eiras, D., Fraga, J.M., Couce, M.L., Cocho, J.A.: A glimpse into past, present, and future DNA sequencing. Mol. Genet. Metab. 110(1), 3\u201324 (2013). (Special Issue: Diagnosis)","journal-title":"Mol. Genet. Metab."},{"issue":"7","key":"819_CR27","doi-asserted-by":"publisher","first-page":"587","DOI":"10.1038\/nmeth.3865","volume":"13","author":"Y Mostovoy","year":"2016","unstructured":"Mostovoy, Y., Levy-Sakin, M., Lam, J., Lam, E.T., Hastie, A.R., Marks, P., Lee, J., Chu, C., Lin, C., Dzakula, Z., Cao, H., Schlebusch, S.A., Giorda, K., Schnall-Levin, M., Wall, J.D., Kwok, P.Y.: A hybrid approach for de novo human genome sequence assembly and phasing. Nat. Meth. 13(7), 587\u2013590 (2016)","journal-title":"Nat. Meth."},{"issue":"3","key":"819_CR28","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":"5","key":"819_CR29","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1101\/gr.223057.117","volume":"27","author":"AM Phillippy","year":"2017","unstructured":"Phillippy, A.M.: New advances in sequence assembly. Genome Res. 27(5), 11\u201313 (2017)","journal-title":"Genome Res."},{"issue":"1","key":"819_CR30","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\u2014efficient scaffolding of large fragmented assemblies. BMC Bioinform. 15(1), 281 (2014)","journal-title":"BMC Bioinform."},{"key":"819_CR31","doi-asserted-by":"crossref","unstructured":"Tabary, D., Davot, T., Weller, M., Chateau, A., Giroudeau, R.: New results about the linearization of scaffolds sharing repeated contigs. In: Combinatorial Optimization and Applications\u201412th International Conference, COCOA 2018, Atlanta, GA, USA, 15\u201317 Dec 2018, Proceedings, pp 94\u2013107 (2018)","DOI":"10.1007\/978-3-030-04651-4_7"},{"issue":"8","key":"819_CR32","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":"1","key":"819_CR33","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":"12","key":"819_CR34","doi-asserted-by":"publisher","first-page":"52210","DOI":"10.1371\/journal.pone.0052210","volume":"7","author":"F Vezzi","year":"2012","unstructured":"Vezzi, F., Narzisi, G., Mishra, B.: Reevaluating assembly evaluations with feature response curves: GAGE and assemblathons. PLoS ONE 7(12), 52210 (2012)","journal-title":"PLoS ONE"},{"issue":"Suppl 14","key":"819_CR35","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":"819_CR36","doi-asserted-by":"crossref","unstructured":"Weller, M., Chateau, A., Giroudeau, R.: On the linearization of scaffolds sharing repeated contigs. In: Proceedings of the 11th COCOA\u201917, pp 509\u2013517 (2017)","DOI":"10.1007\/978-3-319-71147-8_38"},{"issue":"5","key":"819_CR37","doi-asserted-by":"publisher","first-page":"821","DOI":"10.1101\/gr.074492.107","volume":"18","author":"DR Zerbino","year":"2008","unstructured":"Zerbino, D.R., Birney, E.: Velvet: algorithms for de novo short read assembly using de Bruijn graphs. Genome Res. 18(5), 821\u2013829 (2008)","journal-title":"Genome Res."}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-021-00819-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00453-021-00819-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-021-00819-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,6,22]],"date-time":"2021-06-22T09:09:17Z","timestamp":1624352957000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00453-021-00819-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,5,2]]},"references-count":37,"journal-issue":{"issue":"7","published-print":{"date-parts":[[2021,7]]}},"alternative-id":["819"],"URL":"https:\/\/doi.org\/10.1007\/s00453-021-00819-6","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"type":"print","value":"0178-4617"},{"type":"electronic","value":"1432-0541"}],"subject":[],"published":{"date-parts":[[2021,5,2]]},"assertion":[{"value":"16 May 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 March 2021","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 May 2021","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}