{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T13:47:40Z","timestamp":1725544060844},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540354550"},{"type":"electronic","value":"9783540354611"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11780441_24","type":"book-chapter","created":{"date-parts":[[2006,6,30]],"date-time":"2006-06-30T11:02:51Z","timestamp":1151665371000},"page":"258-269","source":"Crossref","is-referenced-by-count":15,"title":["An $O(n^{3\/2}\\sqrt{\\log (n)})$ Algorithm for Sorting by Reciprocal Translocations"],"prefix":"10.1007","author":[{"given":"Michal","family":"Ozery-Flato","sequence":"first","affiliation":[]},{"given":"Ron","family":"Shamir","sequence":"additional","affiliation":[]}],"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"},{"key":"24_CR4","first-page":"581","volume-title":"Proc. FOCS 1995","author":"S. Hannenhalli","year":"1995","unstructured":"Hannenhalli, S., Pevzner, P.: Transforming men into mice (polynomial algorithm for genomic distance problems). In: Proc. FOCS 1995, pp. 581\u2013592. IEEE Computer Society Press, Los Alamitos (1995)"},{"issue":"3","key":"24_CR5","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"},{"issue":"3","key":"24_CR6","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)","journal-title":"Journal of Computer and System Sciences"},{"key":"24_CR7","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)"},{"key":"24_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)"},{"key":"24_CR9","doi-asserted-by":"crossref","unstructured":"Tannier, E., Bergeron, A., Sagot, M.: Advances on sorting by reversals. Discrete Applied Mathematics (to appear)","DOI":"10.1016\/j.dam.2005.02.033"},{"key":"24_CR10","doi-asserted-by":"crossref","unstructured":"Wang, L., Zhu, D., Liu, X., Ma, S.: An O(n2) algorithm for signed translocation problem. In: Proc. APBC, pp. 349\u2013358 (2005)","DOI":"10.1142\/9781860947322_0035"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Pattern Matching"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11780441_24.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T03:16:16Z","timestamp":1619493376000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11780441_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540354550","9783540354611"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/11780441_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}