{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,14]],"date-time":"2026-09-14T20:47:16Z","timestamp":1789418836099,"version":"build-2803163510"},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540258667","type":"print"},{"value":"9783540319504","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11415770_47","type":"book-chapter","created":{"date-parts":[[2010,7,13]],"date-time":"2010-07-13T03:44:50Z","timestamp":1278992690000},"page":"615-629","source":"Crossref","is-referenced-by-count":18,"title":["On Sorting by Translocations"],"prefix":"10.1007","author":[{"given":"Anne","family":"Bergeron","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Julia","family":"Mixtacki","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jens","family":"Stoye","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"47_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"388","DOI":"10.1007\/978-3-540-27801-6_29","volume-title":"Combinatorial Pattern Matching","author":"A. Bergeron","year":"2004","unstructured":"Bergeron, A., Mixtacki, J., Stoye, J.: Reversal distance without hurdles and fortresses. In: Sahinalp, S.C., Muthukrishnan, S.M., Dogrusoz, U. (eds.) CPM 2004. LNCS, vol.\u00a03109, pp. 388\u2013399. Springer, Heidelberg (2004)"},{"key":"47_CR2","doi-asserted-by":"crossref","first-page":"262","DOI":"10.1093\/oso\/9780198566106.003.0010","volume-title":"Mathematics of Evolution and Phylogeny, ch. 10","author":"A. Bergeron","year":"2005","unstructured":"Bergeron, A., Mixtacki, J., Stoye, J.: The inversion distance problem. In: Gascuel, O. (ed.) Mathematics of Evolution and Phylogeny, ch. 10, pp. 262\u2013290. Oxford University Press, Oxford (2005)"},{"key":"47_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1007\/3-540-45071-8_9","volume-title":"Computing and Combinatorics","author":"A. Bergeron","year":"2003","unstructured":"Bergeron, A., Stoye, J.: On the similarity of sets of permutations and its applications to genome comparison. In: Warnow, T.J., Zhu, B. (eds.) COCOON 2003. LNCS, vol.\u00a02697, pp. 68\u201379. Springer, Heidelberg (2003)"},{"key":"47_CR4","doi-asserted-by":"crossref","first-page":"520","DOI":"10.1038\/nature01262","volume":"420","author":"Mouse Genome Sequencing Consortium","year":"2002","unstructured":"Mouse Genome\u00a0Sequencing Consortium. Initial sequencing and comparative analysis of the mouse genome. Nature\u00a0420, 520\u2013562 (2002)","journal-title":"Nature"},{"issue":"1-3","key":"47_CR5","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.\u00a071(1-3), 137\u2013151 (1996)","journal-title":"Discrete Appl. Math."},{"key":"47_CR6","first-page":"581","volume-title":"FOCS 1995 Proceedings","author":"S. Hannenhalli","year":"1995","unstructured":"Hannenhalli, S., Pevzner, P.A.: Transforming men into mice, polynomial algorithm for genomic distance problem. In: FOCS 1995 Proceedings, pp. 581\u2013592. IEEE Press, Los Alamitos (1995)"},{"key":"47_CR7","unstructured":"Kececioglu, J.D., Ravi, R.: Of mice and men: Algorithms for evolutionary distances between genomes with translocation. In: Proceedings of the sixth ACM-SIAM Symposium on Discrete Algorithm. pp. 604\u2013613. Society of Industrial and Applied Mathematics (1995)"},{"key":"47_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1007\/978-3-540-27801-6_24","volume-title":"Combinatorial Pattern Matching","author":"G. Li","year":"2004","unstructured":"Li, G., Qi, X., Wang, X., Zhu, B.: A linear-time algorithm for computing translocation distance between signed genomes. In: Sahinalp, S.C., Muthukrishnan, S.M., Dogrusoz, U. (eds.) CPM 2004. LNCS, vol.\u00a03109, pp. 323\u2013332. Springer, Heidelberg (2004)"},{"issue":"1","key":"47_CR9","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."},{"issue":"3","key":"47_CR10","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."}],"container-title":["Lecture Notes in Computer Science","Research in Computational Molecular Biology"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11415770_47.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,28]],"date-time":"2024-03-28T08:03:12Z","timestamp":1711612992000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11415770_47"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540258667","9783540319504"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/11415770_47","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005]]}}}