{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,11]],"date-time":"2024-09-11T14:30:17Z","timestamp":1726065017632},"publisher-location":"Cham","reference-count":17,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030389185"},{"type":"electronic","value":"9783030389192"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"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":[[2020]]},"DOI":"10.1007\/978-3-030-38919-2_41","type":"book-chapter","created":{"date-parts":[[2020,1,16]],"date-time":"2020-01-16T12:03:18Z","timestamp":1579176198000},"page":"505-518","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Linearizing Genomes: Exact Methods and Local Search"],"prefix":"10.1007","author":[{"given":"Tom","family":"Davot","sequence":"first","affiliation":[]},{"given":"Annie","family":"Chateau","sequence":"additional","affiliation":[]},{"given":"Rodolphe","family":"Giroudeau","sequence":"additional","affiliation":[]},{"given":"Mathias","family":"Weller","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,1,17]]},"reference":[{"key":"41_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"376","DOI":"10.1007\/978-3-319-59776-8_30","volume-title":"Integration of AI and OR Techniques in Constraint Programming","author":"M Abseher","year":"2017","unstructured":"Abseher, M., Musliu, N., Woltran, S.: htd \u2013 a free, open-source framework for (customized) tree decompositions and\u00a0beyond. In: Salvagnin, D., Lombardi, M. (eds.) CPAIOR 2017. LNCS, vol. 10335, pp. 376\u2013386. Springer, Cham (2017). \nhttps:\/\/doi.org\/10.1007\/978-3-319-59776-8_30"},{"issue":"3","key":"41_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."},{"key":"41_CR3","doi-asserted-by":"publisher","unstructured":"Bongartz, P.: Resolving repeat families with long reads. BMC Bioinform. 20(232) (2019). \nhttps:\/\/doi.org\/10.1186\/s12859-019-2807-4\n\n. ISSN 1471-2105","DOI":"10.1186\/s12859-019-2807-4"},{"key":"41_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":"1","key":"41_CR5","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1016\/0022-0000(88)90046-3","volume":"37","author":"DS Johnson","year":"1988","unstructured":"Johnson, D.S., Papadimitriou, C.H., Yannakakis, M.: How easy is local search? J. Comput. Syst. Sci. 37(1), 79\u2013100 (1988)","journal-title":"J. Comput. Syst. Sci."},{"key":"41_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0045375","volume-title":"Treewidth, Computations and Approximations","author":"T Kloks","year":"1994","unstructured":"Kloks, T.: Treewidth, Computations and Approximations. Lecture Notes in Computer Science, vol. 842. Springer, Heidelberg (1994). \nhttps:\/\/doi.org\/10.1007\/BFb0045375"},{"issue":"4","key":"41_CR7","doi-asserted-by":"publisher","first-page":"742","DOI":"10.1137\/0219052","volume":"19","author":"M Krentel","year":"1990","unstructured":"Krentel, M.: On finding and verifying locally optimal solutions. SIAM J. Comput. 19(4), 742\u2013749 (1990)","journal-title":"SIAM J. Comput."},{"key":"41_CR8","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. 5). In: M\u0103ndoiu, I., Zelikovsky, A. (eds.) Computational Methods for Next Generation Sequencing Data Analysis, pp. 107\u2013132. Wiley, Hoboken (2016)"},{"issue":"1","key":"41_CR9","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1137\/0220004","volume":"20","author":"AA Sch\u00e4ffer","year":"1991","unstructured":"Sch\u00e4ffer, A.A., Yannakakis, M.: Simple local search problems that are hard to solve. SIAM J. Comput. 20(1), 56\u201387 (1991)","journal-title":"SIAM J. Comput."},{"key":"41_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"94","DOI":"10.1007\/978-3-030-04651-4_7","volume-title":"Combinatorial Optimization and Applications","author":"D Tabary","year":"2018","unstructured":"Tabary, D., Davot, T., Weller, M., Chateau, A., Giroudeau, R.: New results about the linearization of scaffolds sharing repeated contigs. In: Kim, D., Uma, R.N., Zelikovsky, A. (eds.) COCOA 2018. LNCS, vol. 11346, pp. 94\u2013107. Springer, Cham (2018). \nhttps:\/\/doi.org\/10.1007\/978-3-030-04651-4_7"},{"issue":"8","key":"41_CR11","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":"6","key":"41_CR12","doi-asserted-by":"publisher","first-page":"1345","DOI":"10.1109\/TCBB.2015.2418753","volume":"12","author":"AI Tomescu","year":"2015","unstructured":"Tomescu, A.I., Gagie, T., Popa, A., Rizzi, R., Kuosmanen, A., M\u00e4kinen, V.: Explaining a weighted DAG with few paths for solving genome-guided multi-assembly. IEEE\/ACM Trans. Comput. Biol. Bioinform. 12(6), 1345\u20131354 (2015)","journal-title":"IEEE\/ACM Trans. Comput. Biol. Bioinform."},{"issue":"24","key":"41_CR13","doi-asserted-by":"publisher","first-page":"3491","DOI":"10.1093\/bioinformatics\/btu437","volume":"30","author":"Ajay Ummat","year":"2014","unstructured":"Ummat, A., Bashir, A.: Resolving complex tandem repeats with long reads. Bioinformatics 30(24), 3491\u20133498 (2014). \nhttps:\/\/doi.org\/10.1093\/bioinformatics\/btu437\n\n. ISSN 1367-4803","journal-title":"Bioinformatics"},{"issue":"Suppl 14","key":"41_CR14","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":"41_CR15","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). \nhttps:\/\/doi.org\/10.1007\/978-3-319-71147-8_38"},{"issue":"6","key":"41_CR16","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":"41_CR17","unstructured":"Weller, M., Chateau, A., Giroudeau, R., Poss, M.: Scaffolding with repeated contigs using flow formulations (2018)"}],"container-title":["Lecture Notes in Computer Science","SOFSEM 2020: Theory and Practice of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-38919-2_41","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,16]],"date-time":"2020-01-16T12:15:01Z","timestamp":1579176901000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-38919-2_41"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030389185","9783030389192"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-38919-2_41","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"17 January 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SOFSEM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Current Trends in Theory and Practice of Informatics","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Limassol","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Cyprus","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 January 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 January 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"46","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sofsem2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/cyprusconferences.org\/sofsem2020\/","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 (provided by the conference organizers)"}},{"value":"Easychair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"125","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"40","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"17","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"32% - 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 (provided by the conference organizers)"}},{"value":"2.9","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.8","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}