{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T22:33:47Z","timestamp":1743028427792,"version":"3.40.3"},"publisher-location":"Cham","reference-count":10,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030181734"},{"type":"electronic","value":"9783030181741"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"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":[[2019]]},"DOI":"10.1007\/978-3-030-18174-1_2","type":"book-chapter","created":{"date-parts":[[2019,5,20]],"date-time":"2019-05-20T10:15:30Z","timestamp":1558347330000},"page":"25-38","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["New Polynomial-Time Algorithm Around the Scaffolding Problem"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4203-5140","authenticated-orcid":false,"given":"Tom","family":"Davot","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4760-8171","authenticated-orcid":false,"given":"Annie","family":"Chateau","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6756-2361","authenticated-orcid":false,"given":"Rodolphe","family":"Giroudeau","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9653-3690","authenticated-orcid":false,"given":"Mathias","family":"Weller","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,4,13]]},"reference":[{"key":"2_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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, Cham (2014). \n                      https:\/\/doi.org\/10.1007\/978-3-319-07953-0_4"},{"key":"2_CR2","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":"2_CR3","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1007\/978-3-319-39817-4_3","volume-title":"Frontiers in Algorithmics","author":"Z Chen","year":"2016","unstructured":"Chen, Z., Harada, Y., Machida, E., Guo, F., Wang, L.: Better approximation algorithms for scaffolding problems. In: Zhu, D., Bereg, S. (eds.) FAW 2016. LNCS, pp. 17\u201328. Springer, Cham (2016). \n                      https:\/\/doi.org\/10.1007\/978-3-319-39817-4_3"},{"key":"2_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"294","DOI":"10.1007\/978-3-319-48749-6_22","volume-title":"Combinatorial Optimization and Applications","author":"C Dallard","year":"2016","unstructured":"Dallard, C., Weller, M., Chateau, A., Giroudeau, R.: Instance guaranteed ratio on greedy heuristic for genome scaffolding. In: Chan, T.-H.H., Li, M., Wang, L. (eds.) COCOA 2016. LNCS, vol. 10043, pp. 294\u2013308. Springer, Cham (2016). \n                      https:\/\/doi.org\/10.1007\/978-3-319-48749-6_22"},{"key":"2_CR5","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. 5). In: M\u0103ndoiu, I., Zelikovsky, A. (eds.) Computational Methods for Next Generation Sequencing Data Analysis. Wiley, Hoboken (2016)"},{"issue":"2","key":"2_CR6","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1038\/nprot.2016.182","volume":"12","author":"ER Mardis","year":"2017","unstructured":"Mardis, E.R.: DNA sequencing technologies: 2006\u20132016. Nat. Protoc. 12(2), 213\u2013218 (2017)","journal-title":"Nat. Protoc."},{"issue":"1","key":"2_CR7","doi-asserted-by":"publisher","first-page":"541","DOI":"10.1186\/s12864-017-3927-8","volume":"18","author":"JR Miller","year":"2017","unstructured":"Miller, J.R., et al.: Hybrid assembly with long and short reads improves discovery of gene family expansions. BMC Genomics 18(1), 541 (2017)","journal-title":"BMC Genomics"},{"issue":"6","key":"2_CR8","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). \n                      https:\/\/doi.org\/10.1007\/s00453-018-0405-x","journal-title":"Algorithmica"},{"issue":"Suppl. 14","key":"2_CR9","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":"2_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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., Kim, D., Wu, W., Li, W., Du, D.-Z. (eds.) COCOA 2015. LNCS, vol. 9486, pp. 409\u2013423. Springer, Cham (2015). \n                      https:\/\/doi.org\/10.1007\/978-3-319-26626-8_30"}],"container-title":["Lecture Notes in Computer Science","Algorithms for Computational Biology"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-18174-1_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,22]],"date-time":"2019-05-22T16:12:08Z","timestamp":1558541528000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-18174-1_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030181734","9783030181741"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-18174-1_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"13 April 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"AlCoB","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Algorithms for Computational Biology","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Berkeley, CA","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":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28 May 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 May 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"alcob2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/alcob2019.irdta.eu\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"30","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"15","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"50% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"2","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"One paper of an invited talk is included.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}}]}}