{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T20:06:08Z","timestamp":1743019568817,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642200359"},{"type":"electronic","value":"9783642200366"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"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":[[2011]]},"DOI":"10.1007\/978-3-642-20036-6_13","type":"book-chapter","created":{"date-parts":[[2011,3,23]],"date-time":"2011-03-23T22:49:24Z","timestamp":1300920564000},"page":"124-133","source":"Crossref","is-referenced-by-count":3,"title":["Weighted Genomic Distance Can Hardly Impose a Bound on the Proportion of Transpositions"],"prefix":"10.1007","author":[{"given":"Shuai","family":"Jiang","sequence":"first","affiliation":[]},{"given":"Max A.","family":"Alekseyev","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"8","key":"13_CR1","doi-asserted-by":"publisher","first-page":"1117","DOI":"10.1089\/cmb.2008.0080","volume":"15","author":"M.A. Alekseyev","year":"2008","unstructured":"Alekseyev, M.A.: Multi-Break Rearrangements and Breakpoint Re-uses: from Circular to Linear Genomes. Journal of Computational Biology\u00a015(8), 1117\u20131131 (2008)","journal-title":"Journal of Computational Biology"},{"issue":"11","key":"13_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 Computational Biology\u00a03(11), e209 (2007)","journal-title":"PLoS Computational Biology"},{"issue":"2-3","key":"13_CR3","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1016\/j.tcs.2008.01.013","volume":"395","author":"M.A. Alekseyev","year":"2008","unstructured":"Alekseyev, M.A., Pevzner, P.A.: Multi-Break Rearrangements and Chromosomal Evolution. Theoretical Computer Science\u00a0395(2-3), 193\u2013202 (2008)","journal-title":"Theoretical Computer Science"},{"issue":"5","key":"13_CR4","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. Journal of Computational Biology\u00a014(5), 615\u2013636 (2007)","journal-title":"Journal of Computational Biology"},{"key":"13_CR5","doi-asserted-by":"publisher","first-page":"272","DOI":"10.1137\/S0097539793250627","volume":"25","author":"V. Bafna","year":"1996","unstructured":"Bafna, V., Pevzner, P.A.: Genome rearrangements and sorting by reversals. SIAM Journal on Computing\u00a025, 272\u2013289 (1996)","journal-title":"SIAM Journal on Computing"},{"issue":"1","key":"13_CR6","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 genome rearrangement. Gene\u00a0172(1), GC11\u2013GC17 (1996)","journal-title":"Gene"},{"issue":"4","key":"13_CR7","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1016\/S0020-0190(96)00155-X","volume":"60","author":"D.A. Christie","year":"1996","unstructured":"Christie, D.A.: Sorting permutations by block-interchanges. Information Processing Letters\u00a060(4), 165\u2013169 (1996)","journal-title":"Information Processing Letters"},{"key":"13_CR8","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1109\/TCBB.2006.44","volume":"3","author":"I. Elias","year":"2006","unstructured":"Elias, I., Hartman, T.: A 1.375-approximation algorithm for sorting by transpositions. IEEE\/ACM Transactions on Computational Biology and Bioinformatics\u00a03, 369\u2013379 (2006)","journal-title":"IEEE\/ACM Transactions on Computational Biology and Bioinformatics"},{"key":"13_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1007\/3-540-44696-6_18","volume-title":"Algorithms in Bioinformatics","author":"N. Eriksen","year":"2001","unstructured":"Eriksen, N.: (1\u2009+\u2009\u03b5)-Approximation of Sorting by Reversals and Transpositions. In: Gascuel, O., Moret, B.M.E. (eds.) WABI 2001. LNCS, vol.\u00a02149, pp. 227\u2013237. Springer, Heidelberg (2001)"},{"key":"13_CR10","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.: Combinatorics of Genome Rearrangements. The MIT Press, Cambridge (2009)"},{"key":"13_CR11","doi-asserted-by":"crossref","unstructured":"Hannenhalli, S., Pevzner, P.: Transforming men into mouse (polynomial algorithm for genomic distance problem). In: Proceedings of the 36th Annual Symposium on Foundations of Computer Science, pp. 581\u2013592 (1995)","DOI":"10.1109\/SFCS.1995.492588"},{"key":"#cr-split#-13_CR12.1","doi-asserted-by":"crossref","unstructured":"Hannenhalli, S., Pevzner, P.A.: Transforming Cabbage into Turnip (polynomial algorithm for sorting signed permutations by reversals). In: Proceedings of the 27th Annual ACM Symposium on the Theory of Computing, pp. 178-189 (1995)","DOI":"10.1145\/225058.225112"},{"key":"#cr-split#-13_CR12.2","doi-asserted-by":"crossref","unstructured":"full version appeared in Journal of ACM 46, 1-27 (1995)","DOI":"10.1145\/202511.202523"},{"key":"13_CR13","doi-asserted-by":"publisher","first-page":"224","DOI":"10.1137\/S0895480103433550","volume":"19","author":"A.J. Radcliffe","year":"2005","unstructured":"Radcliffe, A.J., Scott, A.D., Wilmer, E.L.: Reversals and Transpositions Over Finite Alphabets. SIAM J. Discrete Math.\u00a019, 224\u2013244 (2005)","journal-title":"SIAM J. Discrete Math."},{"key":"13_CR14","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, 3340\u20133346 (2005)","journal-title":"Bioinformatics"}],"container-title":["Lecture Notes in Computer Science","Research in Computational Molecular Biology"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-20036-6_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,4]],"date-time":"2025-03-04T17:16:56Z","timestamp":1741108616000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-20036-6_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642200359","9783642200366"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-20036-6_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}