{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,11]],"date-time":"2026-03-11T23:39:41Z","timestamp":1773272381733,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783662447529","type":"print"},{"value":"9783662447536","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-662-44753-6_3","type":"book-chapter","created":{"date-parts":[[2014,8,15]],"date-time":"2014-08-15T08:08:34Z","timestamp":1408090114000},"page":"26-37","source":"Crossref","is-referenced-by-count":2,"title":["A Faster 1.375-Approximation Algorithm for Sorting by Transpositions"],"prefix":"10.1007","author":[{"given":"Lu\u00eds Felipe I.","family":"Cunha","sequence":"first","affiliation":[]},{"given":"Luis Antonio B.","family":"Kowada","sequence":"additional","affiliation":[]},{"given":"Rodrigo","family":"de A. Hausen","sequence":"additional","affiliation":[]},{"given":"Celina M. H.","family":"de Figueiredo","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"3_CR1","unstructured":"http:\/\/compscinet.org\/research\/sbt1375\n                  \n                  \n                 (2014)"},{"issue":"2","key":"3_CR2","doi-asserted-by":"publisher","first-page":"224","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(2), 224\u2013240 (1998)","journal-title":"SIAM J. Discrete Math."},{"issue":"3","key":"3_CR3","doi-asserted-by":"publisher","first-page":"1148","DOI":"10.1137\/110851390","volume":"26","author":"L. Bulteau","year":"2012","unstructured":"Bulteau, L., Fertin, G., Rusu, I.: Sorting by transpositions is difficult. SIAM J. Discrete Math.\u00a026(3), 1148\u20131180 (2012)","journal-title":"SIAM J. Discrete Math."},{"key":"3_CR4","unstructured":"Christie, D.A.: Genome Rearrangement Problems. Ph.D. thesis, University of Glasgow, UK (1999)"},{"key":"3_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1007\/978-3-319-02624-4_12","volume-title":"Advances in Bioinformatics and Computational Biology","author":"L.F.I. Cunha","year":"2013","unstructured":"Cunha, L.F.I., Kowada, L.A.B., de A. Hausen, R., de Figueiredo, C.M.H.: On the 1.375-approximation algorithm for sorting by transpositions in o(n logn) time. In: Setubal, J.C., Almeida, N.F. (eds.) BSB 2013. LNCS, vol.\u00a08213, pp. 126\u2013135. Springer, Heidelberg (2013)"},{"issue":"4","key":"3_CR6","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1109\/TCBB.2006.44","volume":"3","author":"I. Elias","year":"2006","unstructured":"Elias, I., Hartman, T.: A 1.375-approximation algorithm for sorting by transpositions. IEEE\/ACM Trans. Comput. Biol. Bioinformatics\u00a03(4), 369\u2013379 (2006)","journal-title":"IEEE\/ACM Trans. Comput. Biol. Bioinformatics"},{"issue":"3","key":"3_CR7","doi-asserted-by":"publisher","first-page":"1549","DOI":"10.1145\/1273340.1273341","volume":"3","author":"J. Feng","year":"2007","unstructured":"Feng, J., Zhu, D.: Faster algorithms for sorting by transpositions and sorting by block interchanges. ACM Trans. Algorithms\u00a03(3), 1549\u20136325 (2007)","journal-title":"ACM Trans. Algorithms"},{"issue":"8","key":"3_CR8","doi-asserted-by":"publisher","first-page":"1007","DOI":"10.1089\/cmb.2010.0042","volume":"18","author":"J.S. Firoz","year":"2011","unstructured":"Firoz, J.S., Hasan, M., Khan, A.Z., Rahman, M.S.: The 1.375 approximation algorithm for sorting by transpositions can run in \n                  \n                    \n                  \n                  $\\uppercase{O}(n \\log n)$\n                 time. J. Comput. Biol.\u00a018(8), 1007\u20131011 (2011)","journal-title":"J. Comput. Biol."},{"issue":"1","key":"3_CR9","first-page":"1","volume":"46","author":"S. Hannenhalli","year":"1999","unstructured":"Hannenhalli, S., Pevzner, P.A.: Transforming cabbage into turnip: Polynomial algorithm for sorting signed permutations by reversals. J.\u00a0ACM\u00a046(1), 1\u201327 (1999)","journal-title":"J.\u00a0ACM"},{"issue":"2","key":"3_CR10","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1016\/j.ic.2005.09.002","volume":"204","author":"T. Hartman","year":"2006","unstructured":"Hartman, T., Shamir, R.: A simpler and faster 1.5-approximation algorithm for sorting by transpositions. Inf. Comput.\u00a0204(2), 275\u2013290 (2006)","journal-title":"Inf. Comput."}],"container-title":["Lecture Notes in Computer Science","Algorithms in Bioinformatics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-44753-6_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,27]],"date-time":"2019-05-27T12:26:46Z","timestamp":1558960006000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-44753-6_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783662447529","9783662447536"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-44753-6_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014]]}}}