{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:46:11Z","timestamp":1725558371674},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540405450"},{"type":"electronic","value":"9783540450788"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/978-3-540-45078-8_28","type":"book-chapter","created":{"date-parts":[[2010,6,22]],"date-time":"2010-06-22T21:23:52Z","timestamp":1277241832000},"page":"319-328","source":"Crossref","is-referenced-by-count":7,"title":["Sorting Circular Permutations by Reversal"],"prefix":"10.1007","author":[{"given":"Andrew","family":"Solomon","sequence":"first","affiliation":[]},{"given":"Paul","family":"Sutcliffe","sequence":"additional","affiliation":[]},{"given":"Raymond","family":"Lister","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"5","key":"28_CR1","doi-asserted-by":"publisher","first-page":"483","DOI":"10.1089\/106652701753216503","volume":"8","author":"D.A. Bader","year":"2001","unstructured":"Bader, D.A., Moret, B.M.E., Yan, M.: A linear time algorithm for computing inversion distance between signed permutations with an experimental study. Journal of Computational Biology\u00a08(5), 483\u2013491 (2001)","journal-title":"Journal of Computational Biology"},{"key":"28_CR2","doi-asserted-by":"publisher","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\u00a025, 272\u2013289 (1996)","journal-title":"SIAM Journal on Computing"},{"key":"28_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"200","DOI":"10.1007\/3-540-48523-6_17","volume-title":"Automata, Languages and Programming","author":"P. Berman","year":"1999","unstructured":"Berman, P., Karpinski, M.: On some tighter inapproximability results (extended abstract). In: Wiedermann, J., Van Emde Boas, P., Nielsen, M. (eds.) ICALP 1999. LNCS, vol.\u00a01644, pp. 200\u2013209. Springer, Heidelberg (1999)"},{"key":"28_CR4","unstructured":"Boese, K.D.: Cost Versus Distance In the Traveling Salesman Problem, Technical Report CSD-950018, UCLA Computer Science Department (May 1995)"},{"issue":"1","key":"28_CR5","doi-asserted-by":"publisher","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 Journal on Discrete Mathematics\u00a012(1), 91\u2013110 (1999)","journal-title":"SIAM Journal on Discrete Mathematics"},{"key":"28_CR6","unstructured":"Christie, D.A.: A 3\/2-approximation algorithm for sorting by reversals. In: Proceedings of the Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, San Francisco, California, pp. 244\u2013252, January 25-27 (1998)"},{"key":"28_CR7","volume-title":"Computers and Intractability","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability. W. H. Freeman, New York (1979)"},{"key":"28_CR8","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: a polynomial algorithm for sorting signed permutations by reversals. Journal of ACM\u00a046, 1\u201327 (1999)","journal-title":"Journal of ACM"},{"key":"28_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1007\/3-540-58094-8_26","volume-title":"Proceedings of the 5th Symposium on Combinatorial Pattern Matching","author":"J. Kececioglu","year":"1994","unstructured":"Kececioglu, J., Sankoff, D.: Efficient bounds for oriented chromosome inversion distance. In: Kececioglu, J., Sankoff, D. (eds.) Proceedings of the 5th Symposium on Combinatorial Pattern Matching. LNCS, vol.\u00a0807, pp. 307\u2013325. Springer, Heidelberg (1994)"},{"key":"28_CR10","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1007\/BF01188586","volume":"13","author":"J. Kececioglu","year":"1995","unstructured":"Kececioglu, J., Sankoff, D.: Exact and approximation algorithms for sorting by reversals, with application to genome rearrangement. Algorithmica\u00a013, 180\u2013210 (1995)","journal-title":"Algorithmica"},{"issue":"2","key":"28_CR11","doi-asserted-by":"publisher","first-page":"498","DOI":"10.1287\/opre.21.2.498","volume":"21","author":"S. Lin","year":"1973","unstructured":"Lin, S., Kernighan, B.: An efficient heuristic for the traveling salesman problem. Operations Research\u00a021(2), 498\u2013516 (1973)","journal-title":"Operations Research"},{"key":"28_CR12","unstructured":"Meidanis, J., Walter, M.E.M.T., Dias, Z.: Reversal distance of signed circular chromosomes, Technical Report IC-00-23 (December 2000), Instituto de Computa\u00e7\u00e3o, Universidade Estadual de Campinas, http:\/\/www.ic.unicamp.br\/ic-tr-ftp\/2000\/Abstracts.html"},{"key":"28_CR13","doi-asserted-by":"crossref","unstructured":"Micali, S., Vazirani, V.: An $O(\\sqrt{|V|}|E|)$ algorithm for finding maximum matchings in general gaphs. In: Proceedings of the 21st Symposium on Foundations of Computer Science, pp. 17\u201327 (1980) (cited in [10])","DOI":"10.1109\/SFCS.1980.12"},{"key":"28_CR14","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0022-5193(82)90384-8","volume":"99","author":"G. Watterson","year":"1982","unstructured":"Watterson, G., Ewens, W., Hall, T., Morgan, A.: The chromosome inversion problem. J. Theor. Biol.\u00a099, 1\u20137 (1982)","journal-title":"J. Theor. Biol."}],"container-title":["Lecture Notes in Computer Science","Algorithms and Data Structures"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-45078-8_28","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T09:48:44Z","timestamp":1559209724000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-45078-8_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540405450","9783540450788"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-45078-8_28","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2003]]}}}