{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T04:42:11Z","timestamp":1725856931363},"publisher-location":"Cham","reference-count":8,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319398167"},{"type":"electronic","value":"9783319398174"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"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":[[2016]]},"DOI":"10.1007\/978-3-319-39817-4_3","type":"book-chapter","created":{"date-parts":[[2016,5,26]],"date-time":"2016-05-26T09:15:09Z","timestamp":1464254109000},"page":"17-28","source":"Crossref","is-referenced-by-count":2,"title":["Better Approximation Algorithms for Scaffolding Problems"],"prefix":"10.1007","author":[{"given":"Zhi-Zhong","family":"Chen","sequence":"first","affiliation":[]},{"given":"Youta","family":"Harada","sequence":"additional","affiliation":[]},{"given":"Eita","family":"Machida","sequence":"additional","affiliation":[]},{"given":"Fei","family":"Guo","sequence":"additional","affiliation":[]},{"given":"Lusheng","family":"Wang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,5,27]]},"reference":[{"key":"3_CR1","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":"3_CR2","doi-asserted-by":"crossref","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":"3_CR3","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1016\/S0020-0190(98)00102-1","volume":"67","author":"R Hassin","year":"1998","unstructured":"Hassin, R., Rubinstein, S.: An approximation algorithm for the maximum traveling salesman problem. Inf. Process. Lett. 67, 125\u2013130 (1998)","journal-title":"Inf. Process. Lett."},{"key":"3_CR4","doi-asserted-by":"crossref","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.D.: A comprehensive evaluation of assembly scaffolding tools. Genome Biol. 15, R42 (2014)","journal-title":"Genome Biol."},{"key":"3_CR5","doi-asserted-by":"crossref","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, 2632\u20132638 (2015)","journal-title":"Bioinformatics"},{"key":"3_CR6","doi-asserted-by":"crossref","first-page":"D571","DOI":"10.1093\/nar\/gkr1100","volume":"40","author":"I Pagani","year":"2012","unstructured":"Pagani, I., Liolios, K., Jansson, J., Chen, I.-M., Smirnova, T., Nosrat, B., Markowitz, V.M., Kyrpides, N.C.: The genomes on-line database (GOLD) v. 4: status of genomic and metagenomic projects and their associated metadata. Nucleic Acids Res. 40, D571\u2013D579 (2012)","journal-title":"Nucleic Acids Res."},{"key":"3_CR7","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1287\/moor.18.1.1","volume":"18","author":"CH Papadimitriou","year":"1993","unstructured":"Papadimitriou, C.H., Yannakakis, M.: The traveling salesman problem with distances one and two. Math. Oper. Res. 18, 1\u201311 (1993)","journal-title":"Math. Oper. Res."},{"key":"3_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"409","DOI":"10.1007\/978-3-319-26626-8_30","volume-title":"Combinatorial Optimization and Applications","author":"M Weller","year":"2015","unstructured":"Weller, M., Chateau, A., Giroudeau, R.: On the complexity of scaffolding problems: from cliques to sparse graphs. In: Lu, Z., et al. (eds.) COCOA 2015. LNCS, vol. 9486, pp. 409\u2013423. Springer, Heidelberg (2015). doi: 10.1007\/978-3-319-26626-8_30"}],"container-title":["Lecture Notes in Computer Science","Frontiers in Algorithmics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-39817-4_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,24]],"date-time":"2017-06-24T11:05:58Z","timestamp":1498302358000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-39817-4_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319398167","9783319398174"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-39817-4_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}