{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T21:12:41Z","timestamp":1648933961328},"reference-count":8,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2003,1,1]],"date-time":"2003-01-01T00:00:00Z","timestamp":1041379200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J. Comput. Sci. & Technol."],"published-print":{"date-parts":[[2003,1]]},"DOI":"10.1007\/bf02946661","type":"journal-article","created":{"date-parts":[[2008,9,12]],"date-time":"2008-09-12T04:35:28Z","timestamp":1221194128000},"page":"125-130","source":"Crossref","is-referenced-by-count":3,"title":["A new approximation algorithm for sorting of signed permutations"],"prefix":"10.1007","volume":"18","author":[{"given":"Yong","family":"He","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ting","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"BF02946661_CR1","first-page":"239","volume":"12","author":"V Bafna","year":"1995","unstructured":"Bafna V, Pevzner P A. Sorting by reversals: Genome rearrangements in plant organelies and evolutionary history of X chromosome.Molecular Biology Evolution, 1995, 12: 239\u2013246.","journal-title":"Molecular Biology Evolution"},{"key":"BF02946661_CR2","doi-asserted-by":"crossref","unstructured":"Caprara A. Sorting by reversals is difficult. InProc. the 1st Annual International Conference on Computational Molecular Biology, New Mexico, USA, 1997, pp.75\u201383.","DOI":"10.1145\/267521.267531"},{"issue":"1\u20132","key":"BF02946661_CR3","doi-asserted-by":"crossref","first-page":"180","DOI":"10.1007\/BF01188586","volume":"13","author":"S Kececioglu","year":"1995","unstructured":"Kececioglu S, Sankoff D. Exact and approximation algorithms for the inversion distance between two permutations.Algorithmica, 1995, 13(1\u20132): 180\u2013210.","journal-title":"Algorithmica"},{"issue":"2","key":"BF02946661_CR4","doi-asserted-by":"crossref","first-page":"272","DOI":"10.1137\/S0097539793250627","volume":"25","author":"V Bafna","year":"1996","unstructured":"Bafna V, Pevzner P A. Genome rearrangements and sorting by reversals.SIAM Journal on Computing, 1996, 25(2): 272\u2013289.","journal-title":"SIAM Journal on Computing"},{"issue":"2","key":"BF02946661_CR5","doi-asserted-by":"crossref","first-page":"224","DOI":"10.1137\/S089548019528280X","volume":"11","author":"V Bafna","year":"1998","unstructured":"Bafna V, Pevzner P A. Sorting by transpositions.SIAM Journal on Discrete Mathematics, 1998, 11(2): 224\u2013240.","journal-title":"SIAM Journal on Discrete Mathematics"},{"issue":"1","key":"BF02946661_CR6","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 permutations by reversals.Journal of the ACM, 1999, 46(1): 1\u201327.","journal-title":"Journal of the ACM"},{"key":"BF02946661_CR7","doi-asserted-by":"crossref","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 H. A 2-approximation algorithm for genome rearrangements by reversals and transpositions.Theoretical Computer Science, 1999, 210: 327\u2013339.","journal-title":"Theoretical Computer Science"},{"issue":"1\u20132","key":"BF02946661_CR8","doi-asserted-by":"crossref","first-page":"513","DOI":"10.1016\/S0304-3975(00)00038-4","volume":"259","author":"G H Lin","year":"2001","unstructured":"Lin G H, Xue G L. Signed genome rearrangement by reversals and transpositions: Models and approximations.Theoretical Computer Science, 2001, 259(1\u20132): 513\u2013531.","journal-title":"Theoretical Computer Science"}],"container-title":["Journal of Computer Science and Technology"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02946661.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02946661\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02946661","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,21]],"date-time":"2019-05-21T16:17:13Z","timestamp":1558455433000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02946661"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,1]]},"references-count":8,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2003,1]]}},"alternative-id":["BF02946661"],"URL":"https:\/\/doi.org\/10.1007\/bf02946661","relation":{},"ISSN":["1000-9000","1860-4749"],"issn-type":[{"value":"1000-9000","type":"print"},{"value":"1860-4749","type":"electronic"}],"subject":[],"published":{"date-parts":[[2003,1]]}}}