{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T10:13:40Z","timestamp":1743156820027,"version":"3.40.3"},"publisher-location":"Cham","reference-count":14,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031369100"},{"type":"electronic","value":"9783031369117"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023]]},"DOI":"10.1007\/978-3-031-36911-7_4","type":"book-chapter","created":{"date-parts":[[2023,7,12]],"date-time":"2023-07-12T15:02:19Z","timestamp":1689174139000},"page":"51-67","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["The Floor Is Lava - Halving Genomes with\u00a0Viaducts, Piers and\u00a0Pontoons"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4508-0078","authenticated-orcid":false,"given":"Leonard","family":"Bohnenk\u00e4mper","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,7,13]]},"reference":[{"key":"4_CR1","doi-asserted-by":"publisher","unstructured":"Avdeyev, P., Alekseyev, M.A.: Linearization of ancestral genomes with duplicated genes. In: Proceedings of the 11th ACM International Conference on Bioinformatics, Computational Biology and Health Informatics. BCB \u201920, Association for Computing Machinery, New York, NY, USA (2020). https:\/\/doi.org\/10.1145\/3388440.3412484","DOI":"10.1145\/3388440.3412484"},{"key":"4_CR2","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1007\/11851561_16","volume-title":"Algorithms in Bioinformatics","author":"A Bergeron","year":"2006","unstructured":"Bergeron, A., Mixtacki, J., Stoye, J.: A unifying view of genome rearrangements. In: B\u00fccher, P., Moret, B.M.E. (eds.) Algorithms in Bioinformatics, pp. 163\u2013173. Springer, Berlin Heidelberg, Berlin, Heidelberg (2006)"},{"key":"4_CR3","doi-asserted-by":"publisher","unstructured":"Bohnenk\u00e4mper, L.: The floor is lava - halving genomes - supplementary material (Mar 2023). https:\/\/doi.org\/10.6084\/m9.figshare.22269697, https:\/\/figshare.com\/articles\/journal_contribution\/supplement-14-03_pdf\/22269697\/1","DOI":"10.6084\/m9.figshare.22269697"},{"key":"4_CR4","doi-asserted-by":"publisher","unstructured":"Bohnenk\u00e4mper, L., Braga, M.D.V., Doerr, D., Stoye, J.: Computing the rearrangement distance of natural genomes. J. Comput. Biol. 28(4), 410\u2013431 (2021). https:\/\/doi.org\/10.1089\/cmb.2020.0434, pMID: 33393848","DOI":"10.1089\/cmb.2020.0434"},{"key":"4_CR5","doi-asserted-by":"publisher","unstructured":"Braga, M.D.V., Willing, E., Stoye, J.: Double cut and join with insertions and deletions. J. Comput. Biol 18(9), 1167\u20131184 (2011). https:\/\/doi.org\/10.1089\/cmb.2011.0118 pMID: 21899423","DOI":"10.1089\/cmb.2011.0118"},{"key":"4_CR6","doi-asserted-by":"crossref","unstructured":"Caprara, A.: Sorting by reversals is difficult. In: Proceedings of The First Annual International Conference On Computational Molecular Biology, pp. 75\u201383 (1997)","DOI":"10.1145\/267521.267531"},{"key":"4_CR7","doi-asserted-by":"publisher","unstructured":"Compeau, P.E.: DCJ-indel sorting revisited. Algorithms for molecular biology : AMB 8(1), 6\u20136 (Mar 2013). https:\/\/doi.org\/10.1186\/1748-7188-8-6, https:\/\/pubmed.ncbi.nlm.nih.gov\/23452758, 23452758[pmid]","DOI":"10.1186\/1748-7188-8-6"},{"key":"4_CR8","doi-asserted-by":"publisher","unstructured":"Dehal, P., Boore, J.L.: Two rounds of whole genome duplication in the ancestral vertebrate. PLoS biology 3(10), e314\u2013e314 (Oct 2005). https:\/\/doi.org\/10.1371\/journal.pbio.0030314, https:\/\/pubmed.ncbi.nlm.nih.gov\/16128622, 16128622[pmid]","DOI":"10.1371\/journal.pbio.0030314"},{"key":"4_CR9","doi-asserted-by":"publisher","DOI":"10.7551\/mitpress\/9780262062824.001.0001","volume-title":"Combinatorics of Genome Rearrangements","author":"G Fertin","year":"2009","unstructured":"Fertin, G., Labarre, A., Rusu, I., Tannier, E., Vialette, S.: Combinatorics of Genome Rearrangements. The MIT Press, Computational Molecular Biology (2009)"},{"key":"4_CR10","doi-asserted-by":"publisher","first-page":"276","DOI":"10.1007\/978-3-540-69733-6_28","volume-title":"Computing and Combinatorics","author":"J Mixtacki","year":"2008","unstructured":"Mixtacki, J.: Genome halving under DCJ revisited. In: Hu, X., Wang, J. (eds.) Computing and Combinatorics, pp. 276\u2013286. Springer, Berlin Heidelberg, Berlin, Heidelberg (2008)"},{"key":"4_CR11","doi-asserted-by":"publisher","unstructured":"Savard, O.T., Gagnon, Y., Bertrand, D., El-Mabrouk, N.: Genome halving and double distance with losses. J. Comput. Biol. 18(9), 1185\u20131199 (2011). https:\/\/doi.org\/10.1089\/cmb.2011.0136pMID: 21899424","DOI":"10.1089\/cmb.2011.0136"},{"key":"4_CR12","doi-asserted-by":"publisher","unstructured":"Scannell, D.R., Byrne, K.P., Gordon, J.L., Wong, S., Wolfe, K.H.: Multiple rounds of speciation associated with reciprocal gene loss in polyploid yeasts. Nature 440(7082), 341\u2013345 (Mar 2006). https:\/\/doi.org\/10.1038\/nature04562","DOI":"10.1038\/nature04562"},{"key":"4_CR13","doi-asserted-by":"publisher","unstructured":"Shao, M., Lin, Y., Moret, B.M.: An exact algorithm to compute the double-cut-and-join distance for genomes with duplicate genes. J. Comput. Biol. 22(5), 425\u2013435 (2015). https:\/\/doi.org\/10.1089\/cmb.2014.0096 pMID: 25517208","DOI":"10.1089\/cmb.2014.0096"},{"key":"4_CR14","doi-asserted-by":"publisher","unstructured":"Yancopoulos, S., Attie, O., Friedberg, R.: Efficient sorting of genomic permutations by translocation, inversion and block interchange. Bioinformatics 21(16), 3340\u20133346 (06 2005). https:\/\/doi.org\/10.1093\/bioinformatics\/bti535","DOI":"10.1093\/bioinformatics\/bti535"}],"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-36911-7_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,7,12]],"date-time":"2023-07-12T15:02:40Z","timestamp":1689174160000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-36911-7_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031369100","9783031369117"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-36911-7_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"13 July 2023","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":"Istanbul","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"T\u00fcrkiye","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 April 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 April 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"rcg2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/recomb-cg.org","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}