{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,29]],"date-time":"2026-05-29T19:22:36Z","timestamp":1780082556612,"version":"3.54.0"},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2010,11,23]],"date-time":"2010-11-23T00:00:00Z","timestamp":1290470400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Sci. China Inf. Sci."],"published-print":{"date-parts":[[2011,2]]},"DOI":"10.1007\/s11432-010-4131-5","type":"journal-article","created":{"date-parts":[[2010,11,23]],"date-time":"2010-11-23T19:34:23Z","timestamp":1290540863000},"page":"279-292","source":"Crossref","is-referenced-by-count":6,"title":["A 14\/11-approximation algorithm for sorting by short block-moves"],"prefix":"10.1007","volume":"54","author":[{"given":"HaiTao","family":"Jiang","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"DaMing","family":"Zhu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2010,11,23]]},"reference":[{"key":"4131_CR1","doi-asserted-by":"crossref","first-page":"9755","DOI":"10.1093\/nar\/14.24.9755","volume":"14","author":"J. D. Palmer","year":"1986","unstructured":"Palmer J D, Herbon L A. Tricicular mitochondrial genomes of Brassica and Raphanus: Reversal of repeat configurations by inversion. Nucl Acids Res, 1986, 14: 9755\u20139764","journal-title":"Nucl Acids Res"},{"key":"4131_CR2","first-page":"274","volume":"38","author":"S. B. Hoot","year":"1994","unstructured":"Hoot S B, Palmer J D. Structural rearrangements, including parallel inversions within the chloroplast genome of anemone and related genera. J Moc Evol, 1994, 38: 274\u2013281","journal-title":"J Moc Evol"},{"key":"4131_CR3","doi-asserted-by":"crossref","first-page":"6575","DOI":"10.1073\/pnas.89.14.6575","volume":"89","author":"D. Sankoff","year":"1992","unstructured":"Sankoff D, Leduc G, Antoine N, et al. Gene order comparisons for phylogenetic inference: Evolution of the mitochondrial genome. Proc Nat Acad Sci USA, 1992, 89: 6575\u20136579","journal-title":"Proc Nat Acad Sci USA"},{"key":"4131_CR4","doi-asserted-by":"crossref","first-page":"272","DOI":"10.1137\/S0097539793250627","volume":"25","author":"V. Bafna","year":"1996","unstructured":"Bafna V, Pevzner P. Genome rearragements and sorting by reversals. SIAM J Comput, 1996, 25: 272\u2013289","journal-title":"SIAM J Comput"},{"key":"4131_CR5","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/300515.300516","volume":"46","author":"S. Hannenhalli","year":"1999","unstructured":"Hannenhalli S, Pevzner P. Transforming cabbage into turnip: Polynomial algorithm for sorting signed sermutations by reversals. J ACM, 1999, 46: 1\u201327","journal-title":"J ACM"},{"key":"4131_CR6","doi-asserted-by":"crossref","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 Disc Math, 1999, 12: 91\u2013110","journal-title":"SIAM J Disc Math"},{"key":"4131_CR7","unstructured":"Christie D A. A 3\/2-approximation algorithm for sorting by reversals. In: SODA 1998, San Francisco, California, 1998. 244\u2013252"},{"key":"4131_CR8","doi-asserted-by":"crossref","unstructured":"Berman P, Hannanhalli S, Karpinski M. 1.375-approximation algorithm for sorting by reversals. In: ESA 2002, Rome, Italy, 2002. 200\u2013210","DOI":"10.1007\/3-540-45749-6_21"},{"key":"4131_CR9","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1016\/S0166-218X(96)00061-3","volume":"71","author":"S. Hannanhalli","year":"1996","unstructured":"Hannanhalli S. Polynomial time algorithm for computing translocation distance between genomes. Disc Appl Math, 1996, 71: 137\u2013151","journal-title":"Disc Appl Math"},{"key":"4131_CR10","doi-asserted-by":"crossref","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, et al. An O(n 2) algorithm for signed translocation. J Comput Syst Sci, 2005, 70: 284\u2013299","journal-title":"J Comput Syst Sci"},{"key":"4131_CR11","doi-asserted-by":"crossref","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, 2006, 352: 322\u2013328","journal-title":"Theor Comput Sci"},{"key":"4131_CR12","doi-asserted-by":"crossref","first-page":"224","DOI":"10.1137\/S089548019528280X","volume":"11","author":"V. Bafna","year":"1998","unstructured":"Bafna V, Pevzner P. Sorting by transpositions. SIAM J Disc Math, 1998, 11: 224\u2013240","journal-title":"SIAM J Disc Math"},{"key":"4131_CR13","doi-asserted-by":"crossref","unstructured":"Hartman T, Shamir R. A simpler 1.5-approximation algorithm for sorting by transpositions. In: CPM 2005, Korea, 2005. 156\u2013169","DOI":"10.1007\/3-540-44888-8_12"},{"key":"4131_CR14","doi-asserted-by":"crossref","unstructured":"Feng J, Zhu D. Faster algorithms for sorting by transpositions and sorting by block-interchanges. In: TAMC 2006, Beijing, China, 2006. 128\u2013137","DOI":"10.1007\/11750321_12"},{"key":"4131_CR15","doi-asserted-by":"crossref","unstructured":"Elias I, Hartman T. A 1.375-approximation algorithm for sorting by transpositions. WABI, 2005, 204\u2013215","DOI":"10.1007\/11557067_17"},{"key":"4131_CR16","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1016\/S0166-218X(98)00072-9","volume":"88","author":"L. S. Heath","year":"1998","unstructured":"Heath L S, Vergara J P C. Sorting by bounded block-moves. Disc Appl Math, 1998, 88: 181\u2013206","journal-title":"Disc Appl Math"},{"key":"4131_CR17","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1007\/s004530010041","volume":"28","author":"L. S. Heath","year":"2000","unstructured":"Heath L S, Vergara J P C. Sorting by short block-moves. Algorithmica, 2000, 28: 323\u2013354","journal-title":"Algorithmica"},{"key":"4131_CR18","doi-asserted-by":"crossref","unstructured":"Jiang H, Zhu D. A (1+e)-approximation algorithm for sorting by short block-moves. In: CSO(1), 2009. 580\u2013583","DOI":"10.1109\/CSO.2009.375"}],"container-title":["Science China Information Sciences"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11432-010-4131-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11432-010-4131-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11432-010-4131-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,6]],"date-time":"2019-06-06T13:37:15Z","timestamp":1559828235000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11432-010-4131-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,11,23]]},"references-count":18,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2011,2]]}},"alternative-id":["4131"],"URL":"https:\/\/doi.org\/10.1007\/s11432-010-4131-5","relation":{},"ISSN":["1674-733X","1869-1919"],"issn-type":[{"value":"1674-733X","type":"print"},{"value":"1869-1919","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,11,23]]}}}