{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:30:24Z","timestamp":1759638624374,"version":"3.41.0"},"publisher-location":"Cham","reference-count":17,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319266251"},{"type":"electronic","value":"9783319266268"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-26626-8_30","type":"book-chapter","created":{"date-parts":[[2015,12,9]],"date-time":"2015-12-09T09:08:43Z","timestamp":1449652123000},"page":"409-423","source":"Crossref","is-referenced-by-count":6,"title":["On the Complexity of Scaffolding Problems: From Cliques to Sparse Graphs"],"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":[[2015,12,9]]},"reference":[{"key":"30_CR1","unstructured":"Alimonti, P., Ausiello, G., Giovaniello, L., Protasi, M.: On the complexity of approximating weighted satisfiability problems. Technical report, Universit\u00e0 degli Studi di Roma La Sapienza. Rapporto Tecnico RAP 38.97 (1997)"},{"issue":"1\u20133","key":"30_CR2","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1016\/0012-365X(94)00296-U","volume":"152","author":"A Brandst\u00e4dt","year":"1996","unstructured":"Brandst\u00e4dt, A.: Partitions of graphs into one or two independent sets and cliques. Discrete Math. 152(1\u20133), 47\u201354 (1996)","journal-title":"Discrete Math."},{"key":"30_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1007\/978-3-319-07953-0_4","volume-title":"Algorithms for Computational Biology","author":"A Chateau","year":"2014","unstructured":"Chateau, A., Giroudeau, R.: Complexity and polynomial-time approximation algorithms around the scaffolding problem. In: Dediu, A.-H., Mart\u00edn-Vide, C., Truthe, B. (eds.) AlCoB 2014. LNCS, vol. 8542, pp. 47\u201358. Springer, Heidelberg (2014)"},{"key":"30_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)","journal-title":"Theor. Comput. Sci."},{"issue":"2","key":"30_CR5","doi-asserted-by":"publisher","first-page":"216","DOI":"10.1016\/j.ic.2005.05.001","volume":"201","author":"J Chen","year":"2005","unstructured":"Chen, J., Chor, B., Fellows, M., Huang, X., Juedes, D.W., Kanj, I.A., Xia, G.: Tight lower bounds for certain parameterized NP-hard problems. Inf. Comput. 201(2), 216\u2013231 (2005)","journal-title":"Inf. Comput."},{"key":"30_CR6","doi-asserted-by":"crossref","unstructured":"Crescenzi, P.: A short guide to approximation preserving reductions. In: Proceedings of the Twelfth Annual IEEE Conference on Computational Complexity, Ulm, Germany, June 24\u201327, 1997, pp. 262\u2013273 (1997)","DOI":"10.1109\/CCC.1997.612321"},{"key":"30_CR7","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., Sengupta, A.: SOPRA: scaffolding algorithm for paired reads via statistical optimization. BMC Bioinform. 11, 345 (2010)","journal-title":"BMC Bioinform."},{"key":"30_CR8","series-title":"Texts in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4471-5559-1","volume-title":"Fundamentals of Parameterized Complexity","author":"RG Downey","year":"2013","unstructured":"Downey, R.G., Fellows, M.R.: Fundamentals of Parameterized Complexity. Texts in Computer Science. Springer, London (2013)"},{"issue":"11","key":"30_CR9","doi-asserted-by":"publisher","first-page":"1681","DOI":"10.1089\/cmb.2011.0170","volume":"18","author":"S Gao","year":"2011","unstructured":"Gao, S., Sung, W.-K., Nagarajan, N.: Opera: reconstructing optimal genomic scaffolds with high-throughput paired-end sequences. J. Comput. Biol. 18(11), 1681\u20131691 (2011)","journal-title":"J. Comput. Biol."},{"key":"30_CR10","unstructured":"Garey, M.R., Johnson, D.S.: Computers and intractability: a guide to the theory of NP-completeness (1979)"},{"key":"30_CR11","unstructured":"H\u00e5stad, J.: Clique is hard to approximate within $$n^{1-\\varepsilon }$$ n 1 - \u03b5 . Electron. Colloquium Comput. Complex. (ECCC) 4(38) (1997)"},{"issue":"3","key":"30_CR12","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":"4","key":"30_CR13","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."},{"key":"30_CR14","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":"30_CR15","doi-asserted-by":"crossref","unstructured":"Weller, M., Chateau, A., Giroudeau, R.: Exact approaches for scaffolding. Accepted in RECOMBCG 2015, to appear in BMC Bioinformatics 2015a","DOI":"10.1186\/1471-2105-16-S14-S2"},{"key":"30_CR16","doi-asserted-by":"crossref","unstructured":"Weller, M., Chateau, A., Giroudeau, R.: On the implementation of polynomial-time approximation algorithms for scaffold problems. Technical report (2015)","DOI":"10.1007\/978-3-319-07953-0_4"},{"key":"30_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1007\/3-540-36478-1_17","volume-title":"Combinatorial Optimization \u2014 Eureka, You Shrink!","author":"G Woeginger","year":"2003","unstructured":"Woeginger, G.: Exact algorithms for NP-hard problems: a survey. In: J\u00fcnger, M., Reinelt, G., Rinaldi, G. (eds.) Combinatorial Optimization \u2014 Eureka, You Shrink!. LNCS, vol. 2570, pp. 185\u2013207. Springer, Heidelberg (2003)"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Optimization and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-26626-8_30","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,31]],"date-time":"2025-05-31T18:17:51Z","timestamp":1748715471000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-26626-8_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319266251","9783319266268"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-26626-8_30","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]}}}