{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T03:48:28Z","timestamp":1790826508728,"version":"4.1.0"},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540445296","type":"print"},{"value":"9783540445302","type":"electronic"}],"license":[{"start":{"date-parts":[[2006,1,1]],"date-time":"2006-01-01T00:00:00Z","timestamp":1136073600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11864127_8","type":"book-chapter","created":{"date-parts":[[2006,9,22]],"date-time":"2006-09-22T00:41:57Z","timestamp":1158885717000},"page":"87-98","source":"Crossref","is-referenced-by-count":9,"title":["Sorting by Translocations Via Reversals Theory"],"prefix":"10.1007","author":[{"given":"Michal","family":"Ozery-Flato","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ron","family":"Shamir","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"issue":"5","key":"8_CR1","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. Journal of Computational Biology\u00a08(5), 483\u2013491 (2001)","journal-title":"Journal of Computational Biology"},{"issue":"2","key":"8_CR2","doi-asserted-by":"publisher","first-page":"134","DOI":"10.1016\/j.dam.2004.04.010","volume":"146","author":"A. Bergeron","year":"2005","unstructured":"Bergeron, A.: A very elementary presentation of the Hannenhalli-Pevzner theory. Discrete Applied Mathematics\u00a0146(2), 134\u2013145 (2005)","journal-title":"Discrete Applied Mathematics"},{"issue":"2","key":"8_CR3","doi-asserted-by":"publisher","first-page":"567","DOI":"10.1089\/cmb.2006.13.567","volume":"13","author":"A. Bergeron","year":"2006","unstructured":"Bergeron, A., Mixtacki, J., Stoye, J.: On sorting by translocations. Journal of Computational Biology\u00a013(2), 567\u2013578 (2006)","journal-title":"Journal of Computational Biology"},{"key":"8_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"168","DOI":"10.1007\/3-540-61258-0_14","volume-title":"Combinatorial Pattern Matching","author":"P. Berman","year":"1996","unstructured":"Berman, P., Hannenhalli, S.: Fast sorting by reversal. In: Hirschberg, D.S., Meyers, G. (eds.) CPM 1996. LNCS, vol.\u00a01075, pp. 168\u2013185. Springer, Heidelberg (1996)"},{"key":"8_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 algorithm for computing translocation distance between genomes. Discrete Applied Mathematics\u00a071, 137\u2013151 (1996)","journal-title":"Discrete Applied Mathematics"},{"key":"8_CR6","first-page":"581","volume-title":"36th Annual Symposium on Foundations of Computer Science (FOCS 1995)","author":"S. Hannenhalli","year":"1995","unstructured":"Hannenhalli, S., Pevzner, P.: Transforming men into mice (polynomial algorithm for genomic distance problems). In: 36th Annual Symposium on Foundations of Computer Science (FOCS 1995), pp. 581\u2013592. IEEE Computer Society Press, Los Alamitos (1995)"},{"key":"8_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/300515.300516","volume":"46","author":"S. Hannenhalli","year":"1999","unstructured":"Hannenhalli, S., Pevzner, P.: Transforming cabbage into turnip: Polynomial algorithm for sorting signed permutations by reversals. Journal of the ACM\u00a046, 1\u201327 (1999); Preliminary version in Proceedings of the Twenty-Seventh Annual ACM Symposium on Theory of Computing 1995 (STOC 1995), pp. 178\u2013189 (1995)","journal-title":"Journal of the ACM"},{"issue":"3","key":"8_CR8","doi-asserted-by":"publisher","first-page":"880","DOI":"10.1137\/S0097539798334207","volume":"29","author":"H. Kaplan","year":"2000","unstructured":"Kaplan, H., Shamir, R., Tarjan, R.E.: Faster and simpler algorithm for sorting signed permutations by reversals. SIAM Journal of Computing\u00a029(3), 880\u2013892 (2000); Preliminary version in Proceedings of the eighth annual ACM-SIAM Symposium on Discrete Algorithms 1997 (SODA 1997), pp. 344\u2013351. ACM Press, New York (1997)","journal-title":"SIAM Journal of Computing"},{"issue":"3","key":"8_CR9","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1016\/j.jcss.2004.12.002","volume":"70","author":"H. Kaplan","year":"2005","unstructured":"Kaplan, H., Verbin, E.: Sorting signed permutations by reversals, revisited. Journal of Computer and System Sciences\u00a070(3), 321\u2013341 (2005); A preliminary version appeared in Proc. CPM 2003, pp. 170\u2013185. Springer, Heidelberg (2003)","journal-title":"Journal of Computer and System Sciences"},{"key":"8_CR10","first-page":"604","volume-title":"Proceedings of the 6th Annual Symposium on Discrete Algorithms","author":"J.D. Kececioglu","year":"1995","unstructured":"Kececioglu, J.D., Ravi, R.: Of mice and men: Algorithms for evolutionary distances between genomes with translocation. In: Proceedings of the 6th Annual Symposium on Discrete Algorithms, pp. 604\u2013613. ACM Press, New York (1995)"},{"issue":"3","key":"8_CR11","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(3), 814\u2013818 (1984)","journal-title":"Proc. Natl. Acad. Sci. USA"},{"key":"8_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"258","DOI":"10.1007\/11780441_24","volume-title":"Combinatorial Pattern Matching","author":"M. Ozery-Flato","year":"2006","unstructured":"Ozery-Flato, M., Shamir, R.: An \n                  \n                    \n                  \n                  $O(n^{3\/2}\\sqrt{\\log (n)})$\n                 algorithm for sorting by reciprocal translocations. In: Lewenstein, M., Valiente, G. (eds.) CPM 2006. LNCS, vol.\u00a04009, pp. 258\u2013269. Springer, Heidelberg (accepted, 2006), Available at: \n                  \n                    http:\/\/www.cs.tau.ac.il\/~ozery\/srt_cpm06.pdf"},{"key":"8_CR13","unstructured":"Tannier, E., Bergeron, A., Sagot, M.: Advances on sorting by reversals. Discrete Applied Mathematics (to appear)"}],"container-title":["Lecture Notes in Computer Science","Comparative Genomics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11864127_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T13:48:31Z","timestamp":1558273711000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11864127_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540445296","9783540445302"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/11864127_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006]]}}}