{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,28]],"date-time":"2025-05-28T17:40:02Z","timestamp":1748454002882,"version":"3.41.0"},"publisher-location":"Cham","reference-count":27,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319199283"},{"type":"electronic","value":"9783319199290"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"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":[[2015]]},"DOI":"10.1007\/978-3-319-19929-0_34","type":"book-chapter","created":{"date-parts":[[2015,6,15]],"date-time":"2015-06-15T13:09:49Z","timestamp":1434373789000},"page":"396-409","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Sorting by Cuts, Joins and Whole Chromosome Duplications"],"prefix":"10.1007","author":[{"given":"Ron","family":"Zeira","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ron","family":"Shamir","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,6,16]]},"reference":[{"issue":"Suppl 1","key":"34_CR1","doi-asserted-by":"publisher","first-page":"S9","DOI":"10.1186\/1471-2105-10-S1-S9","volume":"10","author":"M Bader","year":"2009","unstructured":"Bader, M.: Sorting by reversals, block interchanges, tandem duplications, and deletions. BMC Bioinform. 10(Suppl 1), S9 (2009)","journal-title":"BMC Bioinform."},{"issue":"Suppl 1","key":"34_CR2","doi-asserted-by":"publisher","first-page":"S27","DOI":"10.1186\/1471-2105-11-S1-S27","volume":"11","author":"M Bader","year":"2010","unstructured":"Bader, M.: Genome rearrangements with duplications. BMC Bioinform. 11(Suppl 1), S27 (2010)","journal-title":"BMC Bioinform."},{"issue":"1","key":"34_CR3","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1016\/j.semcancer.2006.10.006","volume":"17","author":"J Bayani","year":"2007","unstructured":"Bayani, J., Selvarajah, S., Maire, G., Vukovic, B., Al-Romaih, K., Zielenska, M., Squire, J.A.: Genomic mechanisms and measurement of structural and numerical instability in cancer cells. Semin. Cancer Biol. 17(1), 5\u201318 (2007)","journal-title":"Semin. Cancer Biol."},{"key":"34_CR4","series-title":"Lecture Notes in Computer Science (Lecture Notes in Bioinformatics)","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.) WABI 2006. LNCS (LNBI), vol. 4175, pp. 163\u2013173. Springer, Heidelberg (2006)"},{"issue":"1","key":"34_CR5","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1109\/TCBB.2012.168","volume":"10","author":"P Biller","year":"2013","unstructured":"Biller, P., Feij\u00e3o, P., Meidanis, J.: Rearrangement-based phylogeny using the single-cut-or-join operation. IEEE\/ACM Trans. Comput. Biol. Bioinform. 10(1), 122\u2013134 (2013)","journal-title":"IEEE\/ACM Trans. Comput. Biol. Bioinform."},{"issue":"7","key":"34_CR6","doi-asserted-by":"publisher","first-page":"1093","DOI":"10.1105\/tpc.12.7.1093","volume":"12","author":"G Blanc","year":"2000","unstructured":"Blanc, G., Barakat, A., Guyot, R., Cooke, R., Delseny, M.: Extensive duplication and reshuffling in the arabidopsis genome. Plant cell 12(7), 1093\u20131101 (2000)","journal-title":"Plant cell"},{"issue":"3","key":"34_CR7","doi-asserted-by":"publisher","first-page":"1148","DOI":"10.1137\/110851390","volume":"26","author":"L Bulteau","year":"2012","unstructured":"Bulteau, L., Fertin, G., Rusu, I.: Sorting by transpositions is difficult. SIAM J. Discrete Math. 26(3), 1148\u20131180 (2012)","journal-title":"SIAM J. Discrete Math."},{"key":"34_CR8","doi-asserted-by":"crossref","unstructured":"Caprara, A.: Sorting by reversals is difficult. In: Proceedings of the First Annual International Conference on Computational Molecular Biology (RECOMB), pp. 75\u201383, New York, USA (1997)","DOI":"10.1145\/267521.267531"},{"issue":"4","key":"34_CR9","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1016\/S0020-0190(96)00155-X","volume":"60","author":"DA Christie","year":"1996","unstructured":"Christie, D.A.: Sorting permutations by block-interchanges. Inf. Process. Lett. 60(4), 165\u2013169 (1996)","journal-title":"Inf. Process. Lett."},{"key":"34_CR10","volume-title":"Introduction to algorithms","author":"TH Cormen","year":"2001","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C., et al.: Introduction to algorithms, vol. 2. MIT press, Cambridge (2001)"},{"key":"34_CR11","doi-asserted-by":"crossref","unstructured":"Dias, Z., Meidanis, J.: Genome rearrangements distance by fusion, fission, and transposition is easy. In: International Symposium on String Processing and Information Retrieval, pp. 250. IEEE Computer Society (2001)","DOI":"10.1109\/SPIRE.2001.989776"},{"issue":"5","key":"34_CR12","doi-asserted-by":"publisher","first-page":"1318","DOI":"10.1109\/TCBB.2011.34","volume":"8","author":"P Feij\u00e3o","year":"2011","unstructured":"Feij\u00e3o, P., Meidanis, J.: SCJ: a breakpoint-like distance that simplifies several rearrangement problems. IEEE\/ACM Trans. Comput. Biol. Bioinform. 8(5), 1318\u20131329 (2011)","journal-title":"IEEE\/ACM Trans. Comput. Biol. Bioinform."},{"key":"34_CR13","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. MIT Press, Cambridge (2009)"},{"issue":"1\u20133","key":"34_CR14","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1016\/S0166-218X(96)00061-3","volume":"71","author":"S Hannenhalli","year":"1996","unstructured":"Hannenhalli, S.: Polynomial-time algorithm for computing translocation distance between genomes. Discrete Appl. Math. 71(1\u20133), 137\u2013151 (1996)","journal-title":"Discrete Appl. Math."},{"key":"34_CR15","doi-asserted-by":"crossref","unstructured":"Hannenhalli, S., Pevzner, P.A.: Transforming cabbage into turnip. In: Proceedings of the Twenty-Seventh Annual ACM Symposium on Theory of Computing (STOC), vol. 46, pp. 178\u2013189, New York, USA (1995)","DOI":"10.1145\/225058.225112"},{"issue":"1","key":"34_CR16","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1089\/cmb.2013.0004","volume":"21","author":"J Kov\u00e1\u010d","year":"2014","unstructured":"Kov\u00e1\u010d, J.: On the complexity of rearrangement problems under the breakpoint distance. J. Comput. Biol. 21(1), 1\u201315 (2014)","journal-title":"J. Comput. Biol."},{"issue":"1","key":"34_CR17","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1186\/1471-2105-7-295","volume":"7","author":"CL Lu","year":"2006","unstructured":"Lu, C.L., Huang, Y.L., Wang, T.C., Chiu, H.-T.: Analysis of circular genome rearrangement by fusions, fissions and block-interchanges. BMC Bioinform. 7(1), 295 (2006)","journal-title":"BMC Bioinform."},{"key":"34_CR18","first-page":"670","volume":"7","author":"CVG Mira","year":"2007","unstructured":"Mira, C.V.G., Meidanis, J.: Sorting by block-interchanges and signed reversals. ITNG 7, 670\u2013676 (2007)","journal-title":"ITNG"},{"issue":"10","key":"34_CR19","doi-asserted-by":"publisher","first-page":"1445","DOI":"10.1089\/cmb.2009.0083","volume":"16","author":"M Ozery-Flato","year":"2009","unstructured":"Ozery-Flato, M., Shamir, R.: Sorting cancer karyotypes by elementary operations. J. Comput. Biol. 16(10), 1445\u20131460 (2009)","journal-title":"J. Comput. Biol."},{"issue":"4","key":"34_CR20","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1016\/0020-0190(79)90023-1","volume":"8","author":"J Plesnik","year":"1979","unstructured":"Plesnik, J.: The NP-completeness of the Hamiltonian cycle problem in planar digraphs with degree bound two. Inf. Process. Lett. 8(4), 199\u2013201 (1979)","journal-title":"Inf. Process. Lett."},{"issue":"9","key":"34_CR21","doi-asserted-by":"publisher","first-page":"1185","DOI":"10.1089\/cmb.2011.0136","volume":"18","author":"OT Savard","year":"2011","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)","journal-title":"J. Comput. Biol."},{"issue":"Suppl 19","key":"34_CR22","doi-asserted-by":"publisher","first-page":"S13","DOI":"10.1186\/1471-2105-13-S19-S13","volume":"13","author":"M Shao","year":"2012","unstructured":"Shao, M., Lin, Y.: Approximating the edit distance for genomes with duplicate genes under DCJ, insertion and deletion. BMC Bioinform. 13(Suppl 19), S13 (2012)","journal-title":"BMC Bioinform."},{"issue":"Suppl 15","key":"34_CR23","doi-asserted-by":"publisher","first-page":"S9","DOI":"10.1186\/1471-2105-14-S15-S9","volume":"14","author":"M Shao","year":"2013","unstructured":"Shao, M., Lin, Y., Moret, B.: Sorting genomes with rearrangements and segmental duplications through trajectory graphs. BMC Bioinform. 14(Suppl 15), S9 (2013)","journal-title":"BMC Bioinform."},{"key":"34_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"280","DOI":"10.1007\/978-3-319-05269-4_22","volume-title":"Research in Computational Molecular Biology","author":"M Shao","year":"2014","unstructured":"Shao, M., Lin, Y., Moret, B.: An exact algorithm to compute the DCJ distance for genomes with duplicate genes. In: Sharan, R. (ed.) RECOMB 2014. LNCS, vol. 8394, pp. 280\u2013292. Springer, Heidelberg (2014)"},{"issue":"1","key":"34_CR25","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1186\/1471-2105-10-120","volume":"10","author":"E Tannier","year":"2009","unstructured":"Tannier, E., Zheng, C., Sankoff, D.: Multichromosomal median and halving problems under different genomic distances. BMC Bioinform. 10(1), 120 (2009)","journal-title":"BMC Bioinform."},{"issue":"9","key":"34_CR26","doi-asserted-by":"publisher","first-page":"1065","DOI":"10.1089\/cmb.2011.0087","volume":"18","author":"R Warren","year":"2011","unstructured":"Warren, R., Sankoff, D.: Genome aliquoting revisited. J. Comput. Biol. 18(9), 1065\u20131075 (2011)","journal-title":"J. Comput. Biol."},{"issue":"16","key":"34_CR27","doi-asserted-by":"publisher","first-page":"3340","DOI":"10.1093\/bioinformatics\/bti535","volume":"21","author":"S Yancopoulos","year":"2005","unstructured":"Yancopoulos, S., Attie, O., Friedberg, R.: Efficient sorting of genomic permutations by translocation, inversion and block interchange. Bioinformatics 21(16), 3340\u20133346 (2005)","journal-title":"Bioinformatics"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Pattern Matching"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-19929-0_34","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,28]],"date-time":"2025-05-28T16:58:08Z","timestamp":1748451488000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-19929-0_34"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319199283","9783319199290"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-19929-0_34","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"16 June 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}