{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T13:47:22Z","timestamp":1725544042517},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642114397"},{"type":"electronic","value":"9783642114403"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-11440-3_15","type":"book-chapter","created":{"date-parts":[[2010,2,2]],"date-time":"2010-02-02T16:03:36Z","timestamp":1265126616000},"page":"161-166","source":"Crossref","is-referenced-by-count":2,"title":["The 1.375 Approximation Algorithm for Sorting by Transpositions Can Run in O(nlogn) Time"],"prefix":"10.1007","author":[{"given":"Jesun S.","family":"Firoz","sequence":"first","affiliation":[]},{"given":"Masud","family":"Hasan","sequence":"additional","affiliation":[]},{"given":"Ashik Z.","family":"Khan","sequence":"additional","affiliation":[]},{"given":"M. Sohel","family":"Rahman","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"2","key":"15_CR1","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."},{"key":"15_CR2","unstructured":"Christie, D.: Genome rearrangement problem. Ph.D. Thesis, University of Glasgow (1999)"},{"issue":"4","key":"15_CR3","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. Biology Bioinform.\u00a03(4), 369\u2013379 (2006)","journal-title":"IEEE\/ACM Trans. Comput. Biology Bioinform."},{"issue":"1-3","key":"15_CR4","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1016\/S0012-365X(01)00150-9","volume":"241","author":"H. Eriksson","year":"2001","unstructured":"Eriksson, H., Eriksson, K., Karlander, J., Svensson, L.J., W\u00e4stlund, J.: Sorting a bridge hand. Discrete Mathematics\u00a0241(1-3), 289\u2013300 (2001)","journal-title":"Discrete Mathematics"},{"key":"15_CR5","doi-asserted-by":"crossref","unstructured":"Feng, J., Zhu, D.: Faster algorithms for sorting by transpositions and sorting by block interchanges. ACM Transactions on Algorithms\u00a03(3) (2007)","DOI":"10.1145\/1273340.1273341"},{"issue":"2","key":"15_CR6","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., Sudborough, I.H.: A 2-approximation algorithm for genome rearrangements by reversals and transpositions. Theor. Comput. Sci.\u00a0210(2), 327\u2013339 (1999)","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"15_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/300515.300516","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. ACM\u00a046(1), 1\u201327 (1999)","journal-title":"J. ACM"},{"issue":"2","key":"15_CR8","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."},{"issue":"3","key":"15_CR9","doi-asserted-by":"publisher","first-page":"652","DOI":"10.1145\/3828.3835","volume":"32","author":"D.D. Sleator","year":"1985","unstructured":"Sleator, D.D., Tarjan, R.E.: Self-adjusting binary search trees. J. ACM\u00a032(3), 652\u2013686 (1985)","journal-title":"J. ACM"}],"container-title":["Lecture Notes in Computer Science","WALCOM: Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-11440-3_15.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,24]],"date-time":"2020-11-24T02:40:31Z","timestamp":1606185631000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-11440-3_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642114397","9783642114403"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-11440-3_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}