Abstract
In this paper, we present a new data structure–permutation tree to improve the running time of sorting permutation by transpositions and sorting permutation by block-interchanges. The 1.5-approximation algorithm for sorting permutation by transpositions has time complexity \(O(n^{\frac{3}{2}} \sqrt{log n})\). By the permutation tree, we can improve this algorithm to achieve time complexity O(nlogn). We can also improve the algorithm for sorting permutation by block interchanges to make its time complexity from O(n 2) down to O(nlogn).
Supported by NSFC 60573024.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Palmer, J.D., Herbon, L.A.: Tricircular mitochondrial genomes of brassica and raphanus: reversal of repeat configurations by inversion. Nucleic Acids Research 14(24), 9755–9764 (1986)
Hoot, S.B., Palmer, J.D.: Structural rearrangements, including parallel inversions, within the chloroplast genome of anemone and related genera. Journal of molcular evolution 38(3), 274–281 (1994)
Bafna, V., Pevzner, P.A.: Sorting by transpositions. SIAM Journal on Discrete Mathematics 11(2), 224–240 (1998)
Christie, D.A.: Genome Rearrangement Problems. PhD thesis, University of Glasgow (1999)
Walter, M.E.M., Curado, L.R.A.F., Oliveira, A.G.: Working on the problem of sorting by transpositions on genome rearrangements. In: Baeza-Yates, R., Chávez, E., Crochemore, M. (eds.) CPM 2003. LNCS, vol. 2676, pp. 372–383. Springer, Heidelberg (2003)
Eriksson, H., Eriksson, K., Karlander, J., Svensson, L., Wastlund, J.: Sorting a bridge hand. Discrete Mathematics 241(1-3), 289–300 (2001)
Hartman, T., Shamir, R.: A simpler 1.5-approximation algorithm for sorting by transpositions. In: Baeza-Yates, R., Chávez, E., Crochemore, M. (eds.) CPM 2003. LNCS, vol. 2676, pp. 156–169. Springer, Heidelberg (2003)
Sleator, D.D., Tarjan, R.E.: Self-adjusting binary search trees. Journal of the ACM 32(3), 652–686 (1985)
Hartman, T., Shamir, R.: A simpler and faster 1.5-approximation algorithm for sorting by transpositions. Information and Computation (Article in Press) (2005)
Elias, I., Hartman, T.: A 1.375-approximation algorithm for sorting by transpositions. In: Casadio, R., Myers, G. (eds.) WABI 2005. LNCS (LNBI), vol. 3692, pp. 204–215. Springer, Heidelberg (2005)
Gu, Q.P., Peng, S., Sudborough, H.: A 2-approximation algorithm for genome rearrangements by reversals and transpositions. Theoretical Computer Science 210(2), 327–339 (1999)
Eriksen, N.: 1+ε-proximation of sorting by reversals and transpositions. Theoretical Computer Science 289(1), 517–529 (2002)
Lin, G.H., Xue, G.L.: Signed genome rearrangements by reversals and transpositions: models and approximations. Theoretical Computer Science 259, 513–531 (2001)
Christie, D.A.: Sorting permutation by block-interchanges. Information Processing Letters 60, 165–169 (1996)
Lin, Y.C., Lu, C.L., Chang, H.Y., Tang, C.Y.: An efficient algorithm for sorting by block-interchanges and its application to the evolution of vibrio species. J. Comput. Biol. 12(1), 102–112 (2005)
Hannenhalli, S., Pevzner, P.: Transforming cabbage into turnip: Polynomial algorithm for sorting signed permutations by reversals. Journal of the ACM 46(1), 1–27 (1999)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Feng, J., Zhu, D. (2006). Faster Algorithms for Sorting by Transpositions and Sorting by Block-Interchanges. In: Cai, JY., Cooper, S.B., Li, A. (eds) Theory and Applications of Models of Computation. TAMC 2006. Lecture Notes in Computer Science, vol 3959. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11750321_12
Download citation
DOI: https://doi.org/10.1007/11750321_12
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-34021-8
Online ISBN: 978-3-540-34022-5
eBook Packages: Computer ScienceComputer Science (R0)