{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,11,10]],"date-time":"2026-11-10T21:29:20Z","timestamp":1794346160851,"version":"4.9.0"},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540716808","type":"print"},{"value":"9783540716815","type":"electronic"}],"license":[{"start":{"date-parts":[[2007,1,1]],"date-time":"2007-01-01T00:00:00Z","timestamp":1167609600000},"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":[[2007]]},"DOI":"10.1007\/978-3-540-71681-5_24","type":"book-chapter","created":{"date-parts":[[2007,5,17]],"date-time":"2007-05-17T12:07:05Z","timestamp":1179403625000},"page":"339-353","source":"Crossref","is-referenced-by-count":1,"title":["Rearrangements in Genomes with Centromeres Part I: Translocations"],"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":"24_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":"24_CR2","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":"24_CR3","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"},{"issue":"3","key":"24_CR4","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)","journal-title":"SIAM Journal of Computing"},{"key":"24_CR5","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 (2006)"},{"key":"24_CR6","series-title":"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.) Comparative Genomics. LNCS (LNBI), vol.\u00a04205, pp. 87\u201398. Springer, Heidelberg (2006)"},{"issue":"6","key":"24_CR7","doi-asserted-by":"publisher","first-page":"627","DOI":"10.1023\/B:CHRO.0000036594.38997.59","volume":"12","author":"J. Perry","year":"2004","unstructured":"Perry, J., Slater, H.R., Choo, K.H.A.: Centric fission\u2013simple and complex mechanisms. Chromosome Research\u00a012(6), 627\u2013640 (2004)","journal-title":"Chromosome Research"},{"issue":"1","key":"24_CR8","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1101\/gr.8.1.1","volume":"8","author":"J.B. Searle","year":"1998","unstructured":"Searle, J.B.: Speciation, chromosomes, and genomes. Genome Research\u00a08(1), 1\u20133 (1998)","journal-title":"Genome Research"},{"issue":"8","key":"24_CR9","doi-asserted-by":"publisher","first-page":"584","DOI":"10.1038\/35084512","volume":"2","author":"B.A. Sullivan","year":"2001","unstructured":"Sullivan, B.A., Blower, M.D., Karpen, G.H.: Determining centromere identity: Cyclical stories and forking paths. Nature Reviews Genetics\u00a02(8), 584\u2013596 (2001)","journal-title":"Nature Reviews Genetics"}],"container-title":["Lecture Notes in Computer Science","Research in Computational Molecular Biology"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-71681-5_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T09:24:46Z","timestamp":1558257886000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-71681-5_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007]]},"ISBN":["9783540716808","9783540716815"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-71681-5_24","relation":{"is-part-of":[{"id-type":"doi","id":"https:\/\/doi.org\/10.1007\/978-3-540-71681-5","asserted-by":"object"}]},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007]]}}}