{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T07:34:39Z","timestamp":1742974479022,"version":"3.40.3"},"publisher-location":"Cham","reference-count":35,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031062193"},{"type":"electronic","value":"9783031062209"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-06220-9_7","type":"book-chapter","created":{"date-parts":[[2022,5,14]],"date-time":"2022-05-14T12:10:26Z","timestamp":1652530226000},"page":"105-123","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["The Complexity of\u00a0Finding Common Partitions of\u00a0Genomes with\u00a0Predefined Block Sizes"],"prefix":"10.1007","author":[{"given":"Manuel","family":"Lafond","sequence":"first","affiliation":[]},{"given":"Adiesha","family":"Liyanage","sequence":"additional","affiliation":[]},{"given":"Binhai","family":"Zhu","sequence":"additional","affiliation":[]},{"given":"Peng","family":"Zou","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,5,15]]},"reference":[{"key":"7_CR1","doi-asserted-by":"crossref","unstructured":"Ram\u00edrez Alfons\u00edn, J.L.: The Diophantine Frobenius Problem. OUP, Oxford (2005)","DOI":"10.1093\/acprof:oso\/9780198568209.001.0001"},{"issue":"10","key":"7_CR2","first-page":"1","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 Genomics 16(10), 1\u201313 (2015)","journal-title":"BMC Genomics"},{"key":"7_CR3","doi-asserted-by":"crossref","unstructured":"Bourque, G., Pevzner, P.A., Tesler. G.: Reconstructing the genomic architecture of ancestral mammals: lessons from human, mouse, and rat genomes. Genome Res. 14(4):507\u2013516 (2004)","DOI":"10.1101\/gr.1975204"},{"key":"7_CR4","doi-asserted-by":"publisher","unstructured":"Bulteau, L., Fertin, G., Jiang, M., Rusu, I.: Tractability and approximability of maximal strip recovery. Theor. Comput. Sci. 440\u2013441, 14\u201328 (2012). https:\/\/doi.org\/10.1016\/j.tcs.2012.04.034","DOI":"10.1016\/j.tcs.2012.04.034"},{"key":"7_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-40453-5_1","volume-title":"Algorithms in Bioinformatics","author":"BME Moret","year":"2013","unstructured":"Moret, B.M.E.: Extending the reach of phylogenetic inference. In: Darling, A., Stoye, J. (eds.) WABI 2013. LNCS, vol. 8126, pp. 1\u20132. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-40453-5_1"},{"key":"7_CR6","doi-asserted-by":"publisher","unstructured":"Bulteau, L., Fertin, G., Rusu, I.: Maximal strip recovery problem with gaps: hardness and approximation algorithms. J. Discrete Algorithms 19, 1\u201322 (2013). https:\/\/doi.org\/10.1016\/j.jda.2012.12.006","DOI":"10.1016\/j.jda.2012.12.006"},{"key":"7_CR7","doi-asserted-by":"crossref","unstructured":"Bulteau, L., Komusiewicz, C.: Minimum common string partition parameterized by partition size is fixed-parameter tractable. In: Proceedings of 25th ACM-SIAM Symposium on Discrete Algorithms, SODA2014, pp. 102\u2013121. SIAM (2014)","DOI":"10.1137\/1.9781611973402.8"},{"key":"7_CR8","doi-asserted-by":"publisher","unstructured":"Bulteau, L., Weller, M.: Parameterized algorithms in bioinformatics: an overview. Algorithms 12(12), 256 (2019). https:\/\/doi.org\/10.3390\/a12120256","DOI":"10.3390\/a12120256"},{"key":"7_CR9","doi-asserted-by":"publisher","unstructured":"Chen, X., Zheng, J., Zheng, F., Nan, P., Zhong, Y., Lonardi, S., Jiang, T.: Assignment of orthologous genes via genome rearrangement. IEEE\/ACM Trans. Computational Biology and Bioinformatics 2(4), 302\u2013315 (2005). https:\/\/doi.org\/10.1109\/TCBB.2005.48. https:\/\/doi.org\/10.1109\/TCBB.2005.48","DOI":"10.1109\/TCBB.2005.48 10.1109\/TCBB.2005.48"},{"key":"7_CR10","doi-asserted-by":"publisher","unstructured":"Chen, Z., Fu, B., Jiang, M., Zhu, B.: On recovering syntenic blocks from comparative maps. J. Comb. Optim. 18(3):307\u2013318 (2009). https:\/\/doi.org\/10.1007\/s10878-009-9233-x","DOI":"10.1007\/s10878-009-9233-x"},{"key":"7_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1007\/978-3-540-74126-8_26","volume-title":"Algorithms in Bioinformatics","author":"V Choi","year":"2007","unstructured":"Choi, V., Zheng, C., Zhu, Q., Sankoff, D.: Algorithms for the extraction of synteny blocks from comparative maps. In: Giancarlo, R., Hannenhalli, S. (eds.) WABI 2007. LNCS, vol. 4645, pp. 277\u2013288. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-74126-8_26"},{"key":"7_CR12","doi-asserted-by":"publisher","unstructured":"Chrobak, M., Kolman, P., Sgall, J.: The greedy algorithm for the minimum common string partition problem. ACM Trans. Algorithms 1(2), 350\u2013366 (2005). https:\/\/doi.org\/10.1145\/1103963.1103971","DOI":"10.1145\/1103963.1103971"},{"key":"7_CR13","doi-asserted-by":"publisher","unstructured":"Damaschke, P.: Minimum common string partition parameterized. In: Crandall, K.A., Lagergren, J. (eds.) WABI 2008. LNCS, vol. 5251, pp. 87\u201398. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-87361-7_8","DOI":"10.1007\/978-3-540-87361-7_8"},{"key":"7_CR14","doi-asserted-by":"crossref","unstructured":"Delabre, M., et al.: Evolution through segmental duplications and losses: a super-reconciliation approach. Algorithms Mol. Biol. 15, 1\u201315 (2020)","DOI":"10.1186\/s13015-020-00171-4"},{"issue":"9","key":"7_CR15","doi-asserted-by":"publisher","first-page":"2747","DOI":"10.1093\/molbev\/msaa114","volume":"37","author":"G Drillon","year":"2020","unstructured":"Drillon, G., Champeimont, R., Oteri, F., Fischer, G., Carbone, A.: Phylogenetic reconstruction based on synteny block and gene adjacencies. Mol. biol. Evol. 37(9), 2747\u20132762 (2020)","journal-title":"Mol. biol. Evol."},{"key":"7_CR16","doi-asserted-by":"crossref","unstructured":"Eichler, E.E., Sankoff, D.: Structural dynamics of eukaryotic chromosome evolution. Science 301(5634), 793\u2013797 (2003)","DOI":"10.1126\/science.1086132"},{"key":"7_CR17","unstructured":"Ganczorz, M., Gawrychowski, P., Jez, A., Kociumaka, T.: Edit distance with block operations. In: Proceedings of ESA\u20192018, LIPIcs, vol. 112, pp. 33:1\u201333:14. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik (2018)"},{"key":"7_CR18","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability, vol. 174. Freeman, San Francisco (1979)"},{"key":"7_CR19","doi-asserted-by":"crossref","unstructured":"Goldstein, A., Kolman, P., Zheng. J.: Minimum common string partition problem: hardness and approximations. Eur. J. Comb. 12 (2005)","DOI":"10.37236\/1947"},{"key":"7_CR20","doi-asserted-by":"crossref","unstructured":"Goodstadt, L., Ponting, C.P.: Phylogenetic reconstruction of orthology, paralogy, and conserved synteny for dog and human. PLoS Comput. Biol. 2(9), e133 (2006)","DOI":"10.1371\/journal.pcbi.0020133"},{"key":"7_CR21","doi-asserted-by":"publisher","unstructured":"Hu, S., Li, W., Wang, J.: An improved kernel for the complementary maximal strip recovery problem. In: Xu, D., Du, D., Du, D. (eds.) COCOON 2015. LNCS, vol. 9198, pp. 601\u2013608. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-21398-9_47","DOI":"10.1007\/978-3-319-21398-9_47"},{"key":"7_CR22","unstructured":"Jiang, H., Guo, J., Zhu, D., Zhu, B.: A 2-approximation algorithm for the complementary maximal strip recovery problem. In: Pisanti, N., Pissis, S.P. (eds.) 30th Annual Symposium on Combinatorial Pattern Matching, CPM 2019, 18\u201320 June 2019, Pisa, Italy, vol. 128 LIPIcs, pp. 5:1\u20135:13. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2019). https:\/\/doi.org\/10.4230\/LIPIcs.CPM.2019.5"},{"key":"7_CR23","doi-asserted-by":"crossref","unstructured":"Jiang, H., Li, Z., Lin, G., Wang, L., Zhu, B.: Exact and approximation algorithms for the complementary maximal strip recovery problem. J. Comb. Optim. 23(4), 493\u2013506 (2012). https:\/\/doi.org\/10.1007\/s10878-010-9366-y","DOI":"10.1007\/s10878-010-9366-y"},{"key":"7_CR24","doi-asserted-by":"crossref","unstructured":"Jiang, H., Zhu, B.: A linear kernel for the complementary maximal strip recovery problem. J. Comput. Syst. Sci. 80(7), 1350\u20131358 (2014). https:\/\/doi.org\/10.1016\/j.jcss.2014.03.005","DOI":"10.1016\/j.jcss.2014.03.005"},{"key":"7_CR25","doi-asserted-by":"publisher","unstructured":"Jiang, H., Zhu, B., Zhu, D., Zhu, H.: Minimum common string partition revisited. J. Comb. Optim. 23(4), 519\u2013527 (2012). https:\/\/doi.org\/10.1007\/s10878-010-9370-2","DOI":"10.1007\/s10878-010-9370-2"},{"key":"7_CR26","doi-asserted-by":"crossref","unstructured":"Jiang, M.: Inapproximability of maximal strip recovery. Theor. Comput. Sci., 412(29), 3759\u20133774 (2011). https:\/\/doi.org\/10.1016\/j.tcs.2011.04.021","DOI":"10.1016\/j.tcs.2011.04.021"},{"key":"7_CR27","doi-asserted-by":"crossref","unstructured":"Lafond, M., Semeria, M., Swenson, K.M., Tannier, E., El-Mabrouk, N.: Gene tree correction guided by orthology. BMC Bioinform. 14, 1\u20139 (2013)","DOI":"10.1186\/1471-2105-14-S15-S5"},{"key":"7_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1007\/978-3-030-86692-1_5","volume-title":"String Processing and Information Retrieval","author":"M Lafond","year":"2021","unstructured":"Lafond, M., Zhu, B.: Permutation-constrained common string partitions with applications. In: Lecroq, T., Touzet, H. (eds.) SPIRE 2021. LNCS, vol. 12944, pp. 47\u201360. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-86692-1_5"},{"key":"7_CR29","doi-asserted-by":"crossref","unstructured":"Lechner, M., et al.: Orthology detection combining clustering and synteny for very large datasets. PLoS ONE 9(8), e105015 (2014)","DOI":"10.1371\/journal.pone.0105015"},{"key":"7_CR30","doi-asserted-by":"crossref","unstructured":"Lewin, M.: A bound for a solution of a linear diophantine problem. J. Lond. Math. Soc. 2(1), 61\u201369 (1972)","DOI":"10.1112\/jlms\/s2-6.1.61"},{"key":"7_CR31","doi-asserted-by":"publisher","unstructured":"Li, W., Liu, H., Wang, J., Xiang, L., Yang, Y.: An improved linear kernel for complementary maximal strip recovery: simpler and smaller. Theor. Comput. Sci., 786, 55\u201366 (2019). https:\/\/doi.org\/10.1016\/j.tcs.2018.04.020","DOI":"10.1016\/j.tcs.2018.04.020"},{"key":"7_CR32","doi-asserted-by":"publisher","unstructured":"Lin, G., Goebel, R., Li, Z., Wang, L.: An improved approximation algorithm for the complementary maximal strip recovery problem. J. Comput. Syst. Sci. 78(3), 720\u2013730 (2012). https:\/\/doi.org\/10.1016\/j.jcss.2011.10.014","DOI":"10.1016\/j.jcss.2011.10.014"},{"issue":"4","key":"7_CR33","doi-asserted-by":"publisher","first-page":"573","DOI":"10.1007\/s00454-001-0047-6","volume":"26","author":"Cristopher Moore and John Michael Robson","year":"2001","unstructured":"Cristopher Moore and John Michael Robson: Hard tiling problems with simple tiles. Discrete Comput. Geom. 26(4), 573\u2013590 (2001)","journal-title":"Discrete Comput. Geom."},{"key":"7_CR34","doi-asserted-by":"publisher","unstructured":"Wang, L., Zhu, B.: On the tractability of maximal strip recovery. J. Comput. Biol. 17(7), 907\u2013914 (2010). https:\/\/doi.org\/10.1089\/cmb.2009.0084","DOI":"10.1089\/cmb.2009.0084"},{"key":"7_CR35","doi-asserted-by":"publisher","unstructured":"Zheng, C., Zhu, Q., Sankoff, D.: Removing noise and ambiguities from comparative maps in rearrangement analysis. IEEE ACM Trans. Comput. Biol. Bioinform. 4(4), 515\u2013522 (2007). https:\/\/doi.org\/10.1145\/1322075.1322077","DOI":"10.1145\/1322075.1322077"}],"container-title":["Lecture Notes in Computer Science","Comparative Genomics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-06220-9_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,14]],"date-time":"2022-05-14T12:11:26Z","timestamp":1652530286000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-06220-9_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031062193","9783031062209"],"references-count":35,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-06220-9_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"15 May 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"RECOMB-CG","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"RECOMB International Workshop on Comparative Genomics","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"La Jolla, 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":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 May 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 May 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"rcg2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/recombcg2022.usask.ca\/","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":"28","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":"18","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":"0","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":"64% - 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":"4","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":"2","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":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}