{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T06:13:19Z","timestamp":1725516799218},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540697329"},{"type":"electronic","value":"9783540697336"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-69733-6_33","type":"book-chapter","created":{"date-parts":[[2008,8,12]],"date-time":"2008-08-12T16:07:43Z","timestamp":1218557263000},"page":"331-341","source":"Crossref","is-referenced-by-count":1,"title":["A 2.25-Approximation Algorithm for Cut-and-Paste Sorting of Unsigned Circular Permutations"],"prefix":"10.1007","author":[{"given":"Xiaowen","family":"Lou","sequence":"first","affiliation":[]},{"given":"Daming","family":"Zhu","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"33_CR1","doi-asserted-by":"publisher","first-page":"272","DOI":"10.1137\/S089548019528280X","volume":"11","author":"V. Bafna","year":"1998","unstructured":"Bafna, V., Pevzner, P.A.: Sorting by Transpositions. SIAM J. Discrete Math.\u00a011, 272\u2013289 (1998)","journal-title":"SIAM J. Discrete Math."},{"key":"33_CR2","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., Karpinki, 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)"},{"key":"33_CR3","doi-asserted-by":"crossref","unstructured":"Caprara, A.: Sorting by Reversals is Difficult. In: Proc. of 1th Annual International Conference on Research in Computational Molecular Biology (RECOMB 1997), pp. 75\u201383 (1997)","DOI":"10.1145\/267521.267531"},{"key":"33_CR4","doi-asserted-by":"publisher","first-page":"2866","DOI":"10.1016\/j.disc.2007.01.011","volume":"307","author":"D.W. Cranston","year":"2007","unstructured":"Cranston, D.W., Sudborough, I.H., West, D.B.: Short Proofs for Cut-and-Paste Sorting of Permutations. Discrete Mathematics\u00a0307, 2866\u20132870 (2007)","journal-title":"Discrete Mathematics"},{"key":"33_CR5","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1016\/S0304-3975(98)00092-9","volume":"210","author":"Q.P. Gu","year":"1999","unstructured":"Gu, Q.P., Peng, S.P., Sudborough, H.: A 2-Approximation Algorithm for Genome Rearrangements by Reversals and Transpositions. Theoretical Computer Science\u00a0210, 327\u2013339 (1999)","journal-title":"Theoretical Computer Science"},{"key":"33_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"156","DOI":"10.1007\/3-540-44888-8_12","volume-title":"Combinatorial Pattern Matching","author":"T. Hartman","year":"2003","unstructured":"Hartman, T., Shamir, R.: A Simpler 1.5-Approximation Algorithm for Sorting by Transpositions. In: Baeza-Yates, R., Ch\u00e1vez, E., Crochemore, M. (eds.) CPM 2003. LNCS, vol.\u00a02676, pp. 156\u2013169. Springer, Heidelberg (2003)"},{"key":"33_CR7","doi-asserted-by":"publisher","first-page":"300","DOI":"10.1016\/j.jcss.2004.12.006","volume":"70","author":"T. Hartman","year":"2005","unstructured":"Hartman, T., Sharan, R.: A 1.5-Approximation Algorithm for Sorting by Transpositions and Transreversals. J. Computer and System Sciences\u00a070, 300\u2013320 (2005)","journal-title":"J. Computer and System Sciences"},{"key":"33_CR8","doi-asserted-by":"crossref","unstructured":"Hannenhalli, S., Pevzner, P.A.: Transforming Cabbage into Turnip (Polynomial Algorithm for Sorting Signed Permutations by Reversals). In: Proc. of 27th Annual ACM Symposium on Theory of Computing (STOC 1995), pp. 178\u2013189 (1995)","DOI":"10.1145\/225058.225112"},{"key":"33_CR9","doi-asserted-by":"crossref","unstructured":"Rahman, A., Shatabda, S., Hasan, M.: An Approximation Algorithm for Sorting by Reversals and Transpositions. J. Discrete Algorithms (in press) doi:10.1016\/j.jda.2007.09.002","DOI":"10.1016\/j.jda.2007.09.002"},{"key":"33_CR10","series-title":"Lecture Notes in Computer Science","first-page":"1","volume-title":"Combinatorial Pattern Matching","author":"E. Tannier","year":"2004","unstructured":"Tannier, E., Sagot, M.-F.: Sorting by Reversals in Subquadratic Time. In: Sahinalp, S.C., Muthukrishnan, S.M., Dogrusoz, U. (eds.) CPM 2004. LNCS, vol.\u00a03109, pp. 1\u201313. Springer, Heidelberg (2004)"},{"key":"33_CR11","doi-asserted-by":"crossref","unstructured":"Walter, M.E.M.T., Dias, Z., Meidanis, J.: Reversal and Transposition Distance of Linear Chromosomes. In: Proc. of String Processing and Information Retrieval (SPIRE 1998), pp. 96\u2013102 (1998)","DOI":"10.1109\/SPIRE.1998.712988"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-69733-6_33.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T05:02:16Z","timestamp":1605762136000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-69733-6_33"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540697329","9783540697336"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-69733-6_33","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}