{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T15:16:51Z","timestamp":1743088611151,"version":"3.40.3"},"publisher-location":"London","reference-count":20,"publisher":"Springer London","isbn-type":[{"type":"print","value":"9781447152972"},{"type":"electronic","value":"9781447152989"}],"license":[{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-1-4471-5298-9_10","type":"book-chapter","created":{"date-parts":[[2013,9,17]],"date-time":"2013-09-17T09:20:12Z","timestamp":1379409612000},"page":"207-243","source":"Crossref","is-referenced-by-count":2,"title":["The Emperor Has No Caps! A Comparison of DCJ and Algebraic Distances"],"prefix":"10.1007","author":[{"given":"Joao","family":"Meidanis","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sophia","family":"Yancopoulos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"10_CR1","doi-asserted-by":"publisher","first-page":"615","DOI":"10.1089\/cmb.2007.R006","volume":"14","author":"M. Bader","year":"2007","unstructured":"Bader, M., Ohlebusch, E.: Sorting by weighted reversals, transpositions, and inverted transpositions. J. Comput. Biol. 14, 615\u2013636 (2007)","journal-title":"J. Comput. Biol."},{"key":"10_CR2","doi-asserted-by":"crossref","unstructured":"Bafna, V., Pevzner, P.: Sorting by transpositions. SIAM J. Discrete Math. 224\u2013240 (1998)","DOI":"10.1137\/S089548019528280X"},{"key":"10_CR3","first-page":"148","volume-title":"Proceedings of the 34th Annual IEEE Symposium on Foundations of Computer Science","author":"V. Bafna","year":"1993","unstructured":"Bafna, V., Pevzner, P.A.: Genome rearrangements and sorting by reversals. In: Proceedings of the 34th Annual IEEE Symposium on Foundations of Computer Science, vol. 46, pp. 148\u2013157. IEEE Press, New York (1993)"},{"key":"10_CR4","volume-title":"Algorithms in Bioinformatics Proceedings of WABI 2006","author":"A. Bergeron","year":"2006","unstructured":"Bergeron, A., Mixtacki, J., Stoye, J.: A unifying view of genome rearrangements. In: Moret,\u00a0B. (ed.) Algorithms in Bioinformatics Proceedings of WABI 2006 (2006)"},{"key":"10_CR5","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1016\/0378-1119(95)00878-0","volume":"172","author":"M. Blanchette","year":"1996","unstructured":"Blanchette, M., Kunisawa, T., Sankoff, D.: Parametric analysis of genome rearrangement. Gene 172, 11\u201317 (1996)","journal-title":"Gene"},{"key":"10_CR6","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1016\/S0020-0190(96)00155-X","volume":"60","author":"D. Christie","year":"1996","unstructured":"Christie, D.: Sorting permutations by block interchanges. Inf. Process. Lett. 60, 165\u2013169 (1996)","journal-title":"Inf. Process. Lett."},{"key":"10_CR7","doi-asserted-by":"crossref","first-page":"28","DOI":"10.1093\/genetics\/23.1.28","volume":"23","author":"T. Dobzhansky","year":"1984","unstructured":"Dobzhansky, T., Sturtevant, A.H.: Inversions in the chromosomes of Drosophila pseudoobscura. Genetics 23, 28\u201364 (1984)","journal-title":"Genetics"},{"issue":"5","key":"10_CR8","doi-asserted-by":"publisher","first-page":"1318","DOI":"10.1109\/TCBB.2011.34","volume":"8","author":"P. Feijao","year":"2011","unstructured":"Feijao, P., Meidanis, J.: SCJ: a breakpoint-like distance that simplifies several rearrangement problems. IEEE\/ACM Trans. Comput. Biol. Bioinform. 8(5), 1318\u20131329 (2011). doi:10.1109\/TCBB.2011.34.","journal-title":"IEEE\/ACM Trans. Comput. Biol. Bioinform."},{"issue":"PrePrints","key":"10_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1109\/TCBB.2012.161","volume":"99","author":"P. Feijao","year":"2012","unstructured":"Feijao, P., Meidanis, J.: Extending the algebraic formalism for genome rearrangements to include linear chromosomes. IEEE\/ACM Trans. Comput. Biol. Bioinform. 99(PrePrints), 1 (2012). doi:10.1109\/TCBB.2012.161","journal-title":"IEEE\/ACM Trans. Comput. Biol. Bioinform."},{"key":"10_CR10","first-page":"385","volume-title":"Bioinformatics, Methods in Molecular Biology","author":"R. Friedberg","year":"2008","unstructured":"Friedberg, R., Darling, A.E., Yancopoulos, S.: Genome rearrangement by the double cut and join operation. In: Keith, J.M. (ed.) Bioinformatics, Methods in Molecular Biology, vol. 452, pp. 385\u2013416. Humana Press, Clifton (2008)"},{"issue":"1","key":"10_CR11","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 46(1), 1\u201327 (1999). Previously appeared at Proc. of the 27th Annual Symposium on the Theory of Computing (STOC 95), Las Vegas, Nevada, pp. 178\u2013189 (1995)","journal-title":"J. ACM"},{"key":"10_CR12","first-page":"581","volume-title":"Proc. of the 36 Annual Symposium on Foundations of Computer Science","author":"S. Hannenhalli","year":"1995","unstructured":"Hannenhalli, S., Pevzner, P.A.: Transforming mice into men (polynomial algorithm for genomic distance problem). In: Proc. of the 36 Annual Symposium on Foundations of Computer Science (FOCS 95), Milwaukee, Wisconsin, pp. 581\u2013592 (1995)"},{"key":"10_CR13","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1007\/978-94-011-4309-7_20","volume-title":"Comparative Genomics","author":"J. Meidanis","year":"2000","unstructured":"Meidanis, J., Dias, Z.: An alternative algebraic formalism for genome rearrangements. In: Sankoff, D., Nadeau, J. (eds.) Comparative Genomics, pp. 213\u2013223. Kluwer Academic, Dordrecht (2000)"},{"key":"10_CR14","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 81, 814\u2013818 (1984)","journal-title":"Proc. Natl. Acad. Sci. USA"},{"key":"10_CR15","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, Third Annual Symposium","author":"D. Sankoff","year":"1992","unstructured":"Sankoff, D.: Edit distance for genome comparison based on non-local operations. In: Combinatorial Pattern Matching, Third Annual Symposium. Lecture Notes in Computer Science, vol. 644, pp. 121\u2013135. Springer, Berlin (1992)"},{"key":"10_CR16","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1016\/S0092-8240(89)80051-5","volume":"51","author":"D. Sankoff","year":"1989","unstructured":"Sankoff, D., Goldstein, M.: Probabilistic models for genome shuffling. Bull. Math. Biol. 51, 117\u2013124 (1989)","journal-title":"Bull. Math. Biol."},{"key":"10_CR17","doi-asserted-by":"publisher","first-page":"428","DOI":"10.1016\/0076-6879(90)83028-8","volume":"183","author":"D. Sankoff","year":"1990","unstructured":"Sankoff, D., Cedergren, R., Abel, Y.: Genome divergence through gene rearrangement. Methods Enzymol. 183, 428\u2013438 (1990)","journal-title":"Methods Enzymol."},{"key":"10_CR18","doi-asserted-by":"publisher","first-page":"6575","DOI":"10.1073\/pnas.89.14.6575","volume":"89","author":"D. Sankoff","year":"1992","unstructured":"Sankoff, D., Leduc, G., Antoine, N., Paquin, B., Lang, B.F., Gene, C.R.: Order comparisons for phylogenetic inference: evolution of the mitochondrial genome. Proc. Natl. Acad. Sci. USA 89, 6575\u20136579 (1992)","journal-title":"Proc. Natl. Acad. Sci. USA"},{"key":"10_CR19","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. 65, 587\u2013609 (2002)","journal-title":"J. Comput. Syst. Sci."},{"issue":"16","key":"10_CR20","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, in version and block interchange. Bioinformatics 21(16), 3340\u20133346 (2005)","journal-title":"Bioinformatics"}],"container-title":["Computational Biology","Models and Algorithms for Genome Evolution"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-1-4471-5298-9_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,19]],"date-time":"2023-02-19T15:57:18Z","timestamp":1676822238000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-1-4471-5298-9_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9781447152972","9781447152989"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-1-4471-5298-9_10","relation":{},"ISSN":["1568-2684"],"issn-type":[{"type":"print","value":"1568-2684"}],"subject":[],"published":{"date-parts":[[2013]]}}}