{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T17:53:57Z","timestamp":1743098037013,"version":"3.40.3"},"publisher-location":"Cham","reference-count":15,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319212326"},{"type":"electronic","value":"9783319212333"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-21233-3_2","type":"book-chapter","created":{"date-parts":[[2015,7,27]],"date-time":"2015-07-27T16:30:47Z","timestamp":1438014647000},"page":"13-24","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Implicit Transpositions in Shortest DCJ Scenarios"],"prefix":"10.1007","author":[{"given":"Shuai","family":"Jiang","sequence":"first","affiliation":[]},{"given":"Max A.","family":"Alekseyev","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,7,28]]},"reference":[{"issue":"8","key":"2_CR1","doi-asserted-by":"publisher","first-page":"1117","DOI":"10.1089\/cmb.2008.0080","volume":"15","author":"MA Alekseyev","year":"2008","unstructured":"Alekseyev, M.A.: Multi-break rearrangements and breakpoint re-uses: from circular to linear genomes. J. Comput. Biol. 15(8), 1117\u20131131 (2008)","journal-title":"J. Comput. Biol."},{"issue":"2","key":"2_CR2","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1016\/j.tcs.2008.01.013","volume":"395","author":"MA Alekseyev","year":"2008","unstructured":"Alekseyev, M.A., Pevzner, P.A.: Multi-break rearrangements and chromosomal evolution. Theor. Comput. Sci. 395(2), 193\u2013202 (2008)","journal-title":"Theor. Comput. Sci."},{"key":"2_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"471","DOI":"10.1007\/978-3-319-16483-0_46","volume-title":"Bioinformatics and Biomedical Engineering","author":"N Alexeev","year":"2015","unstructured":"Alexeev, N., Aidagulov, R., Alekseyev, M.A.: A computational method for the rate estimation of evolutionary transpositions. In: Ortu\u00f1o, F., Rojas, I. (eds.) IWBBIO 2015, Part I. LNCS, vol. 9043, pp. 471\u2013480. Springer, Heidelberg (2015)"},{"issue":"5","key":"2_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. J. Comput. Biol. 14(5), 615\u2013636 (2007)","journal-title":"J. Comput. Biol."},{"issue":"9","key":"2_CR5","doi-asserted-by":"publisher","first-page":"1145","DOI":"10.1089\/cmb.2010.0109","volume":"17","author":"MD Braga","year":"2010","unstructured":"Braga, M.D., Stoye, J.: The solution space of sorting by DCJ. J. Comput. Biol. 17(9), 1145\u20131165 (2010)","journal-title":"J. Comput. Biol."},{"key":"2_CR6","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+\\epsilon )$$-approximation of sorting by reversals and transpositions. In: Gascuel, O., Moret, B.M. (eds.) WABI 2001. LNCS, vol. 2149, pp. 227\u2013237. Springer, Heidelberg (2001)"},{"key":"2_CR7","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)"},{"key":"2_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1007\/978-3-642-20036-6_13","volume-title":"Research in Computational Molecular Biology","author":"S Jiang","year":"2011","unstructured":"Jiang, S., Alekseyev, M.A.: Weighted genomic distance can hardly impose a bound on the proportion of transpositions. In: Bafna, V., Sahinalp, S.C. (eds.) RECOMB 2011. LNCS, vol. 6577, pp. 124\u2013133. Springer, Heidelberg (2011)"},{"key":"2_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1007\/978-3-662-44753-6_8","volume-title":"Algorithms in Bioinformatics","author":"S Jiang","year":"2014","unstructured":"Jiang, S., Alekseyev, M.A.: Linearization of median genomes under DCJ. In: Brown, D., Morgenstern, B. (eds.) WABI 2014. LNCS, vol. 8701, pp. 97\u2013106. Springer, Heidelberg (2014)"},{"key":"2_CR10","doi-asserted-by":"crossref","unstructured":"Kasprzyk, A.: BioMart: driving a paradigm change in biological data management. Database 2011, bar049 (2011)","DOI":"10.1093\/database\/bar049"},{"issue":"9","key":"2_CR11","doi-asserted-by":"publisher","first-page":"1129","DOI":"10.1089\/cmb.2010.0126","volume":"17","author":"A Ouangraoua","year":"2010","unstructured":"Ouangraoua, A., Bergeron, A.: Combinatorial structure of genome rearrangements scenarios. J. Comput. Biol. 17(9), 1129\u20131144 (2010)","journal-title":"J. Comput. Biol."},{"key":"2_CR12","series-title":"Lecture Notes in Computer Science (Lecture Notes in Bioinformatics)","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1007\/11864127_8","volume-title":"Comparative Genomics","author":"M Ozery-Flato","year":"2006","unstructured":"Ozery-Flato, M., Shamir, R.: Sorting by translocations via reversals theory. In: Bourque, G., El-Mabrouk, N. (eds.) RECOMB-CG 2006. LNCS (LNBI), vol. 4205, pp. 87\u201398. Springer, Heidelberg (2006)"},{"issue":"6","key":"2_CR13","doi-asserted-by":"publisher","first-page":"1325","DOI":"10.1111\/j.0014-3820.2003.tb00340.x","volume":"57","author":"J Ranz","year":"2003","unstructured":"Ranz, J., Gonz\u00e1lez, J., Casals, F., Ruiz, A.: Low occurrence of gene transposition events during the evolution of the genus Drosophila. Evolution 57(6), 1325\u20131335 (2003)","journal-title":"Evolution"},{"issue":"15","key":"2_CR14","first-page":"1","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(15), 1\u20138 (2013)","journal-title":"BMC Bioinform."},{"issue":"16","key":"2_CR15","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","Algorithms for Computational Biology"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-21233-3_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,21]],"date-time":"2023-02-21T09:40:27Z","timestamp":1676972427000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-21233-3_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319212326","9783319212333"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-21233-3_2","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":"28 July 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}