{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T00:14:28Z","timestamp":1773274468107,"version":"3.50.1"},"reference-count":15,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2002,10,1]],"date-time":"2002-10-01T00:00:00Z","timestamp":1033430400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":3942,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2002,10]]},"DOI":"10.1016\/s0304-3975(01)00338-3","type":"journal-article","created":{"date-parts":[[2002,10,7]],"date-time":"2002-10-07T20:25:18Z","timestamp":1034022318000},"page":"517-529","source":"Crossref","is-referenced-by-count":42,"title":["(1+\u03b5)-Approximation of sorting by reversals and transpositions"],"prefix":"10.1016","volume":"289","author":[{"given":"Niklas","family":"Eriksen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(01)00338-3_BIB1","doi-asserted-by":"crossref","first-page":"483","DOI":"10.1089\/106652701753216503","article-title":"A linear-time algorithm for computing inversion distance between signed permutations with an experimental study","volume":"8","author":"Bader","year":"2001","journal-title":"J. Comput. Biol."},{"key":"10.1016\/S0304-3975(01)00338-3_BIB2","doi-asserted-by":"crossref","unstructured":"V. Bafna, P. Pevzner, Genome rearrangements and sorting by reversals, Proc. 34th IEEE Symp. of the Foundations of Computer Science, 1994, pp. 148\u2013157.","DOI":"10.1109\/SFCS.1993.366872"},{"key":"10.1016\/S0304-3975(01)00338-3_BIB3","doi-asserted-by":"crossref","first-page":"224","DOI":"10.1137\/S089548019528280X","article-title":"Sorting by transpositions","volume":"11","author":"Bafna","year":"1998","journal-title":"SIAM J. Discrete Math."},{"key":"10.1016\/S0304-3975(01)00338-3_BIB4","doi-asserted-by":"crossref","unstructured":"A. Bergeron, A very elementary presentation of the Hannenhalli\u2013Pevzner Theory, Proc. 12th Annu. Symp. on Combinatorial Pattern Matching, 2001, pp. 106\u2013117.","DOI":"10.1007\/3-540-48194-X_9"},{"key":"10.1016\/S0304-3975(01)00338-3_BIB5","doi-asserted-by":"crossref","unstructured":"P. Berman, S. Hannenhalli, Fast sorting by reversals, Proc. 7th Annu. Symp. on Combinatorial Pattern Matching, 1996, pp. 168\u2013185.","DOI":"10.1007\/3-540-61258-0_14"},{"key":"10.1016\/S0304-3975(01)00338-3_BIB6","doi-asserted-by":"crossref","unstructured":"P. Berman, S. Hannenhalli, M. Karpinki, 1.375-approximation algorithm for sorting by reversals, Electronic Colloquium for Computational Complexity TR01-047, 2001.","DOI":"10.1007\/3-540-45749-6_21"},{"key":"10.1016\/S0304-3975(01)00338-3_BIB7","unstructured":"P. Berman, M. Karpinski, On some tighter inapproximability results, Proc. 26th Internat. Colloq. on Automata, Languages and Programming, Lecture Notes in Computer Science, Vol. 1644, Springer, Berlin, 1999, pp. 200\u2013209."},{"key":"10.1016\/S0304-3975(01)00338-3_BIB8","doi-asserted-by":"crossref","first-page":"GC11","DOI":"10.1016\/0378-1119(95)00878-0","article-title":"Parametric genome rearrangement","volume":"172","author":"Blanchette","year":"1996","journal-title":"Gene"},{"key":"10.1016\/S0304-3975(01)00338-3_BIB9","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1137\/S089548019731994X","article-title":"Sorting permutations by reversals and Eulerian cycle decompositions","volume":"12","author":"Caprara","year":"1999","journal-title":"SIAM J. Discrete Math."},{"key":"10.1016\/S0304-3975(01)00338-3_BIB10","unstructured":"D.A. Christie, Genome rearrangement problems, Ph.D. Thesis, 1998."},{"key":"10.1016\/S0304-3975(01)00338-3_BIB11","unstructured":"N. Eriksen, D. Dalevi, S.G.E. Andersson, K. Eriksson, Gene order rearrangements with Derange: weights and reliability, preprint."},{"key":"10.1016\/S0304-3975(01)00338-3_BIB12","doi-asserted-by":"crossref","first-page":"327","DOI":"10.1016\/S0304-3975(98)00092-9","article-title":"A 2-approximation algorithm for genome rearrangements by reversals and transpositions","volume":"210","author":"Gu","year":"1999","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(01)00338-3_BIB13","doi-asserted-by":"crossref","unstructured":"S. Hannenhalli, P. Pevzner, Transforming cabbage into turnip (polynomial algorithm for sorting signed permutations with reversals), Proc. 27th Annu. ACM Symp. on the Theory of Computing, 1995, pp. 178\u2013189.","DOI":"10.1145\/225058.225112"},{"key":"10.1016\/S0304-3975(01)00338-3_BIB14","doi-asserted-by":"crossref","unstructured":"H. Kaplan, R. Shamir, R.E. Tarjan, Faster and simpler algorithm for sorting signed permutations by reversals, Proc. 8th Annu. ACM-SIAM Symp. on Discrete Mathematics, 1997, pp. 344\u2013351.","DOI":"10.1145\/267521.267544"},{"key":"10.1016\/S0304-3975(01)00338-3_BIB15","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1007\/BF02143500","article-title":"Plant mitochondrial DNA evolves rapidly in structure, but slowly in sequence","volume":"28","author":"Palmer","year":"1988","journal-title":"J. Molecular Evolution"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397501003383?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397501003383?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2024,12,10]],"date-time":"2024-12-10T08:17:39Z","timestamp":1733818659000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397501003383"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,10]]},"references-count":15,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2002,10]]}},"alternative-id":["S0304397501003383"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(01)00338-3","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2002,10]]}}}