{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,19]],"date-time":"2025-03-19T12:14:00Z","timestamp":1742386440949},"publisher-location":"Berlin, Heidelberg","reference-count":27,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642047435"},{"type":"electronic","value":"9783642047442"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-04744-2_8","type":"book-chapter","created":{"date-parts":[[2009,9,23]],"date-time":"2009-09-23T13:16:13Z","timestamp":1253711773000},"page":"84-97","source":"Crossref","is-referenced-by-count":1,"title":["Rearrangement Models and Single-Cut Operations"],"prefix":"10.1007","author":[{"given":"Paul","family":"Medvedev","sequence":"first","affiliation":[]},{"given":"Jens","family":"Stoye","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"8_CR1","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1177\/117693430800400004","volume":"4","author":"Z. Adam","year":"2008","unstructured":"Adam, Z., Sankoff, D.: The ABCs of MGR with DCJ. Evol. Bioinform.\u00a04, 69\u201374 (2008)","journal-title":"Evol. Bioinform."},{"issue":"11","key":"8_CR2","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1371\/journal.pcbi.0030209","volume":"3","author":"M.A. Alekseyev","year":"2007","unstructured":"Alekseyev, M.A., Pevzner, P.A.: Are there rearrangement hotspots in the human genome? PLoS Comput. Biol.\u00a03(11), e209 (2007)","journal-title":"PLoS Comput. Biol."},{"key":"8_CR3","unstructured":"Alekseyev, M.A., Pevzner, P.A.: Whole genome duplications, multi-break rearrangements, and genome halving problem. In: SODA, pp. 665\u2013679 (2007)"},{"issue":"5","key":"8_CR4","doi-asserted-by":"publisher","first-page":"483","DOI":"10.1089\/106652701753216503","volume":"8","author":"D.A. Bader","year":"2001","unstructured":"Bader, D.A., Moret, B.M.E., Yan, M.: A linear-time algorithm for computing inversion distance between signed permutations with an experimental study. J. Comp. Biol.\u00a08(5), 483\u2013491 (2001)","journal-title":"J. Comp. Biol."},{"key":"8_CR5","series-title":"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.\u00a04175, pp. 163\u2013173. Springer, Heidelberg (2006)"},{"key":"8_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1007\/978-3-540-69068-9_8","volume-title":"Combinatorial Pattern Matching","author":"A. Bergeron","year":"2008","unstructured":"Bergeron, A., Mixtacki, J., Stoye, J.: HP distance via double cut and join distance. In: Ferragina, P., Landau, G.M. (eds.) CPM 2008. LNCS, vol.\u00a05029, pp. 56\u201368. Springer, Heidelberg (2008)"},{"key":"8_CR7","series-title":"Lecture Notes in Bioinformatics","doi-asserted-by":"publisher","first-page":"226","DOI":"10.1007\/978-3-540-87989-3_17","volume-title":"Comparative Genomics","author":"A. Bergeron","year":"2008","unstructured":"Bergeron, A., Mixtacki, J., Stoye, J.: On computing the breakpoint reuse rate in rearrangement scenarios. In: Nelson, C.E., Vialette, S. (eds.) RECOMB-CG 2008. LNCS (LNBI), vol.\u00a05267, pp. 226\u2013240. Springer, Heidelberg (2008)"},{"issue":"2","key":"8_CR8","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1016\/0166-218X(94)00009-3","volume":"61","author":"D.S. Cohen","year":"1995","unstructured":"Cohen, D.S., Blum, M.: On the problem of sorting burnt pancakes. Discr. Appl. Math.\u00a061(2), 105\u2013120 (1995)","journal-title":"Discr. Appl. Math."},{"key":"8_CR9","doi-asserted-by":"crossref","first-page":"28","DOI":"10.1093\/genetics\/23.1.28","volume":"23","author":"T. Dobzhansky","year":"1938","unstructured":"Dobzhansky, T., Sturtevant, A.H.: Inversions in the chromosomes of Drosophila Pseudoobscura. Genetics\u00a023, 28\u201364 (1938)","journal-title":"Genetics"},{"key":"8_CR10","series-title":"LNBI","first-page":"85","volume-title":"WABI 2009","author":"P. Feij\u00e3o","year":"2009","unstructured":"Feij\u00e3o, P., Meidanis, J.: SCJ: A novel rearrangement operation for which sorting, genome median and genome halving problems are easy. In: Salzberg, S.L., Warnow, T. (eds.) WABI 2009. LNCS (LNBI), vol.\u00a05724, pp. 85\u201396. Springer, Heidelberg (2009)"},{"key":"8_CR11","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1016\/0012-365X(79)90068-2","volume":"27","author":"W. Gates","year":"1979","unstructured":"Gates, W., Papadimitiou, C.: Bounds for sorting by prefix reversals. Discr. Math.\u00a027, 47\u201357 (1979)","journal-title":"Discr. Math."},{"key":"8_CR12","first-page":"581","volume-title":"Proceedings of FOCS 1995","author":"S. Hannenhalli","year":"1995","unstructured":"Hannenhalli, S., Pevzner, P.A.: Transforming men into mice (polynomial algorithm for genomic distance problem). In: Proceedings of FOCS 1995, pp. 581\u2013592. IEEE Press, Los Alamitos (1995)"},{"issue":"1","key":"8_CR13","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/300515.300516","volume":"46","author":"S. Hannenhalli","year":"1999","unstructured":"Hannenhalli, S., Pevzner, P.A.: Transforming cabbage into turnip: Polynomial algorithm for sorting signed permutations by reversals. J. ACM\u00a046(1), 1\u201327 (1999); First appeared in STOC 1995 Proceedings","journal-title":"J. ACM"},{"key":"8_CR14","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1016\/j.ipl.2007.04.011","volume":"104","author":"G. Jean","year":"2007","unstructured":"Jean, G., Nikolski, M.: Genome rearrangements: a correct algorithm for optimal capping. Inf. Process. Lett.\u00a0104, 14\u201320 (2007)","journal-title":"Inf. Process. Lett."},{"key":"8_CR15","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1093\/bioinformatics\/btn148","volume":"24","author":"Y. Lin","year":"2008","unstructured":"Lin, Y., Moret, B.M.E.: Estimating true evolutionary distances under the DCJ model. Bioinformatics\u00a024, i114\u2013i122 (2008); Proceedings of ISMB 2008","journal-title":"Bioinformatics"},{"issue":"12","key":"8_CR16","doi-asserted-by":"publisher","first-page":"1557","DOI":"10.1101\/gr.5383506","volume":"16","author":"J. Ma","year":"2006","unstructured":"Ma, J., Zhang, L., Suh, B.B., Raney, B.J., Burhans, R.C., Kent, W.J., Blanchette, M., Haussler, D., Miller, W.: Reconstructing contiguous regions of an ancestral genome. Genome Research\u00a016(12), 1557\u20131565 (2006)","journal-title":"Genome Research"},{"key":"8_CR17","unstructured":"Meidanis, J., Walter, M.E.M.T., Dias, Z.: Reversal distance of signed circular chromosomes. In: Technical Report IC\u201300-23. Institute of Computing, University of Campinas (2000)"},{"key":"8_CR18","series-title":"Lecture Notes in Computer Science","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.) COCOON 2008. LNCS, vol.\u00a05092, pp. 276\u2013286. Springer, Heidelberg (2008)"},{"key":"8_CR19","doi-asserted-by":"publisher","first-page":"814","DOI":"10.1073\/pnas.81.3.814","volume":"81","author":"J.H. Nadeau","year":"1984","unstructured":"Nadeau, J.H., Taylor, B.A.: Lengths of chromosomal segments conserved since divergence of man and mouse. Proc. Natl. Acad. Sci. USA\u00a081, 814\u2013818 (1984)","journal-title":"Proc. Natl. Acad. Sci. USA"},{"issue":"1","key":"8_CR20","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1142\/S0219720003000198","volume":"1","author":"M. Ozery-Flato","year":"2003","unstructured":"Ozery-Flato, M., Shamir, R.: Two notes on genome rearrangements. J. Bioinf. Comput. Biol.\u00a01(1), 71\u201394 (2003)","journal-title":"J. Bioinf. Comput. Biol."},{"key":"8_CR21","doi-asserted-by":"crossref","unstructured":"Pevzner, P.A., Tesler, G.: Transforming men into mice: the Nadeau-Taylor chromosomal breakage model revisited. In: Proceedings of RECOMB 2003, pp. 247\u2013256 (2003)","DOI":"10.1145\/640075.640108"},{"key":"8_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1007\/3-540-56024-6_10","volume-title":"Combinatorial Pattern Matching","author":"D. Sankoff","year":"1992","unstructured":"Sankoff, D.: Edit distances for genome comparison based on non-local operations. In: Apostolico, A., Galil, Z., Manber, U., Crochemore, M. (eds.) CPM 1992. LNCS, vol.\u00a0644, pp. 121\u2013135. Springer, Heidelberg (1992)"},{"key":"8_CR23","first-page":"428","volume-title":"Molecular Evolution: Computer Analysis of Protein and Nucleic Acid Sequences, Meth. Enzymol., ch. 26","author":"D. Sankoff","year":"1990","unstructured":"Sankoff, D., Cedergren, R., Abel, Y.: Genomic divergence through gene rearrangement. In: Doolittle, R.F. (ed.) Molecular Evolution: Computer Analysis of Protein and Nucleic Acid Sequences, Meth. Enzymol., ch. 26, vol.\u00a0183, pp. 428\u2013438. Academic Press, San Diego (1990)"},{"issue":"6","key":"8_CR24","doi-asserted-by":"publisher","first-page":"812","DOI":"10.1089\/cmb.2005.12.812","volume":"12","author":"D. Sankoff","year":"2005","unstructured":"Sankoff, D., Trinh, P.: Chromosomal breakpoint reuse in genome sequence rearrangement. J. of Comput. Biol.\u00a012(6), 812\u2013821 (2005)","journal-title":"J. of Comput. Biol."},{"issue":"6-7","key":"8_CR25","doi-asserted-by":"publisher","first-page":"881","DOI":"10.1016\/j.dam.2005.02.033","volume":"155","author":"E. Tannier","year":"2007","unstructured":"Tannier, E., Bergeron, A., Sagot, M.-F.: Advances on sorting by reversals. Discr. Appl. Math.\u00a0155(6-7), 881\u2013888 (2007)","journal-title":"Discr. Appl. Math."},{"issue":"3","key":"8_CR26","doi-asserted-by":"publisher","first-page":"587","DOI":"10.1016\/S0022-0000(02)00011-9","volume":"65","author":"G. Tesler","year":"2002","unstructured":"Tesler, G.: Efficient algorithms for multichromosomal genome rearrangements. J. Comput. Syst. Sci.\u00a065(3), 587\u2013609 (2002)","journal-title":"J. Comput. Syst. Sci."},{"issue":"16","key":"8_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\u00a021(16), 3340\u20133346 (2005)","journal-title":"Bioinformatics"}],"container-title":["Lecture Notes in Computer Science","Comparative Genomics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-04744-2_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,11]],"date-time":"2021-10-11T03:10:53Z","timestamp":1633921853000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-04744-2_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642047435","9783642047442"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-04744-2_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}