{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T11:32:17Z","timestamp":1725795137450},"publisher-location":"Cham","reference-count":17,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319080154"},{"type":"electronic","value":"9783319080161"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"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":[[2014]]},"DOI":"10.1007\/978-3-319-08016-1_12","type":"book-chapter","created":{"date-parts":[[2014,5,30]],"date-time":"2014-05-30T00:18:07Z","timestamp":1401409087000},"page":"128-140","source":"Crossref","is-referenced-by-count":6,"title":["A (1.408+\u03b5)-Approximation Algorithm for Sorting Unsigned Genomes by Reciprocal Translocations"],"prefix":"10.1007","author":[{"given":"Haitao","family":"Jiang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lusheng","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Binhai","family":"Zhu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Daming","family":"Zhu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"12_CR1","doi-asserted-by":"publisher","first-page":"6575","DOI":"10.1073\/pnas.89.14.6575","volume":"89","author":"D. Sankoff","year":"1992","unstructured":"Sankoff, D., Leduc, G., Antoine, N., Paquin, B., Lang, B.F., Cedergren, R.: Gene order comparisons for phylogenetic inference: Evolution of the mitochondrial genome. Proc. Nat. Acad. Sci. USA\u00a089, 6575\u20136579 (1992)","journal-title":"Proc. Nat. Acad. Sci. USA"},{"key":"12_CR2","unstructured":"Kececioglu, J., Ravi, R.: Of Mice and Men: Algorithms for Evolutionary Distances between Genomes with Translocation. In: Proceedings of the 6th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 1995), pp. 604\u2013613 (1995)"},{"issue":"1-3","key":"12_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-time Algorithm for Computing Translocation Distance Between Genomes. Discrete Applied Mathematics\u00a071(1-3), 137\u2013151 (1996)","journal-title":"Discrete Applied Mathematics"},{"issue":"3","key":"12_CR4","doi-asserted-by":"publisher","first-page":"284","DOI":"10.1016\/j.jcss.2004.12.005","volume":"70","author":"L. Wang","year":"2005","unstructured":"Wang, L., Zhu, D., Liu, X., Ma, S.: An O(n2) algorithm for signed translocation. J. Comput. Syst. Sci.\u00a070(3), 284\u2013299 (2005)","journal-title":"J. Comput. Syst. Sci."},{"issue":"4","key":"12_CR5","doi-asserted-by":"publisher","first-page":"344","DOI":"10.1016\/j.jda.2011.04.003","volume":"9","author":"M. Ozery-Flato","year":"2011","unstructured":"Ozery-Flato, M., Shamir, R.: An \n                    \n                      \n                    \n                    $O(n^{\\frac{3}{2}}\\sqrt{log n})$\n                   algorithm for sorting by reciprocal translocations. J. Discrete Algorithms\u00a09(4), 344\u2013357 (2011)","journal-title":"J. Discrete Algorithms"},{"key":"12_CR6","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":"2","key":"12_CR7","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"},{"issue":"1-3","key":"12_CR8","doi-asserted-by":"publisher","first-page":"322","DOI":"10.1016\/j.tcs.2005.09.078","volume":"352","author":"D. Zhu","year":"2006","unstructured":"Zhu, D., Wang, L.: On the complexity of unsigned translocation distance. Theor. Comput. Sci.\u00a0352(1-3), 322\u2013328 (2006)","journal-title":"Theor. Comput. Sci."},{"issue":"7","key":"12_CR9","doi-asserted-by":"publisher","first-page":"1045","DOI":"10.1016\/j.jcss.2007.03.009","volume":"73","author":"Y. Cui","year":"2007","unstructured":"Cui, Y., Wang, L., Zhu, D.: A 1.75-approximation algorithm for unsigned translocation distance. J. Comput. Syst. Sci.\u00a073(7), 1045\u20131059 (2007)","journal-title":"J. Comput. Syst. Sci."},{"issue":"1","key":"12_CR10","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1109\/TCBB.2007.70216","volume":"5","author":"Y. Cui","year":"2008","unstructured":"Cui, Y., Wang, L., Zhu, D., Liu, X.: A (1.5 + \u03b5)-Approximation Algorithm for Unsigned Translocation Distance. IEEE\/ACM Trans. Comput. Biology Bioinform.\u00a05(1), 56\u201366 (2008)","journal-title":"IEEE\/ACM Trans. Comput. Biology Bioinform."},{"key":"12_CR11","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1137\/S089548019731994X","volume":"12","author":"A. Caprara","year":"1999","unstructured":"Caprara, A.: Sorting Permutations by Reversals and Eulerian Cycle Decompositions. SIAM J. Discrete Math.\u00a012, 91\u2013110 (1999)","journal-title":"SIAM J. Discrete Math."},{"key":"12_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"200","DOI":"10.1007\/3-540-45749-6_21","volume-title":"Algorithms - ESA 2002","author":"P. Berman","year":"2002","unstructured":"Berman, P., Hannenhalli, S., Karpinski, M.: 1.375-Approximation Algorithm for Sorting by Reversals. In: M\u00f6hring, R.H., Raman, R. (eds.) ESA 2002. LNCS, vol.\u00a02461, pp. 200\u2013210. Springer, Heidelberg (2002)"},{"issue":"3","key":"12_CR13","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1093\/bioinformatics\/btq674","volume":"27","author":"H. Jiang","year":"2011","unstructured":"Jiang, H., Zhu, B., Zhu, D.: Algorithms for sorting unsigned linear genomes by the DCJ operations. Bioinformatics\u00a027(3), 311\u2013316 (2011)","journal-title":"Bioinformatics"},{"issue":"2","key":"12_CR14","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1023\/A:1013851611274","volume":"6","author":"A. Caprara","year":"2002","unstructured":"Caprara, A., Rizzi, R.: Improved Approximation for Breakpoint Graph Decomposition and Sorting by Reversals. J. Comb. Optim.\u00a06(2), 157\u2013182 (2002)","journal-title":"J. Comb. Optim."},{"key":"12_CR15","unstructured":"Berman, P., F\u00fcrer, M.: Approximating maximum independent set in bounded degree graphs. In: Proceedings of the 5th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 1994), pp. 365\u2013371 (1994)"},{"key":"12_CR16","unstructured":"Halld\u00f3rsson, M.M.: Approximating discrete collections via local improvements. In: Proceedings of the 6th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 1995), pp. 160\u2013169 (1995)"},{"key":"12_CR17","doi-asserted-by":"crossref","unstructured":"Chen, X., Sun, R., Yu, J.: Approximating the double-cut-and-join distance between unsigned genomes. BMC Bioinformatics 12(suppl. 9), S17 (2011)","DOI":"10.1186\/1471-2105-12-S9-S17"}],"container-title":["Lecture Notes in Computer Science","Frontiers in Algorithmics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-08016-1_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,26]],"date-time":"2019-05-26T19:15:38Z","timestamp":1558898138000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-08016-1_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319080154","9783319080161"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-08016-1_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}