Abstract
Gu et al. gave a 2-approximation for computing the minimal number of inversions and transpositions needed to sort a permutation. There is evidence that, from the point of view of computational molecular biology, a more adequate objective function is obtained, if transpositions are given double weight. We present a (1 + ε)-approximation for this problem, based on the exact algorithm of Hannenhalli and Pevzner, for sorting by reversals only.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bader, D. A., Moret, B. M. E., Yan, M.: A Linear-Time Algorithm for Computing Inversion Distance Between Signed Permutations with an Experimental Study. Preprint
Bafna, V., Pevzner, P.: Genome rearrangements and sorting by reversals. Proceedings of the 34th IEEE symposium of the foundations of computer science (1994), 148–157
Bafna, V., Pevzner, P.: Sorting by Transpositions. SIAM Journal of Discrete Mathematics 11 (1998), 224–240
Caprara, A.: Sorting permutations by reversals and Eulerian cycle decompositions. SIAM Journal of Discrete Mathematics 12 (1999), 91–110
Christie, D. A.: Genome rearrangement problems. Ph. D. thesis (1998)
Gu, Q.-P., Peng, S., Sudborough, H.: A 2-approximation algorithm for genome rearrangements by reversals and transpositions. Theoretical Computer Science 210 (1999), 327–339
Hannenhalli, S., Pevzner, P.: Transforming cabbage into turnip (polynomial algorithm for sorting signed permutations with reversals). Proceedings of the 27th Annual ACM Symposium on the Theory of Computing (1995), 178–189
Kaplan, H., Shamir, R., Tarjan, R. E.: Faster and Simpler Algorithm for Sorting Signed Permutations by Reversals. Proceedings of the Eighth Annual ACM-SIAM Symposium on Discrete Mathematics (1997), 344–351
Palmer, J. D., Herbon, L.A.: Plant mitochondrial DNA evolves rapidly in structure, but slowly in sequence. Journal of Molecular Evolution 28 (1988), 87–97
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Eriksen, N. (2001). (1+ε)-Approximation of Sorting by Reversals and Transpositions. In: Gascuel, O., Moret, B.M.E. (eds) Algorithms in Bioinformatics. WABI 2001. Lecture Notes in Computer Science, vol 2149. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44696-6_18
Download citation
DOI: https://doi.org/10.1007/3-540-44696-6_18
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42516-8
Online ISBN: 978-3-540-44696-5
eBook Packages: Springer Book Archive