Abstract
Reversal, transposition and transreversal are common events in genome rearrangement. The genome rearrangement sorting problem is to transform one genome into another using the minimum number of rearrangement operations. Hannenhalli and Pevzner discovered that singleton is the major obstacle for unsigned reversal sorting. They also gave a polynomial algorithm for reversal sorting on those unsigned permutations with O(logn) singletons. This paper involves two aspects. (1) We describe one case for which Hannenhalli and Pevzner’s algorithm may fail, and propose a corrected algorithm for unsigned reversal sorting. (2) We propose a (1 + ε)-approximation algorithm for the weighted sorting problem on unsigned permutations with O(logn) singletons. The weighted sorting means: sorting a permutation by weighted reversals, transpositions and transreversals, where reversal is assigned weight 1 and transposition(including transreversal) is assigned weight 2.
Supported by (1) National Nature Science Foundation of China, 60573024. (2) Chinese National 973 Plan, previous special, 2005cca04500.
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. J. Comput. Biol. 8, 483–491 (2001)
Berman, P., Hannenhalli, S., Karpinki, M.: 1.375-approximation algorithm for sorting by reversals. In: Möhring, R.H., Raman, R. (eds.) ESA 2002. LNCS, vol. 2461, pp. 200–210. Springer, Heidelberg (2002)
Bafna, V., Pevzner, P.A.: Sorting by transpositions. SIAM J. Discrete Math. 11, 272–289 (1998)
Caprara, A.: Sorting by reversals is difficult. In: Proc. 1st Annu. Int. Conf. Res. Comput. Mol. Biol. (RECOMB 1997), pp. 75–83 (1997)
Eriksen, N.: (1 + ε)-approximation of sorting by reversals and transpositions. Theor. Comput. Sci. 289, 517–529 (2002)
Hannenhalli, S., Pevzner, P.A.: Transforming cabbage into turnip (polynomial algorithm for sorting signed permutations by reversals). In: Proc. 27th Annu. ACM Symp. Theory Computing (STOC 1995), pp. 178–189 (1995)
Hannenhalli, S., Pevzner, P.A.: To cut ... or not to cut (applications of comparative physical maps in molecular evolution). In: Proc. 7th Annu. ACM-SIAM Symp. Discrete Algorithms (SODA 1996), pp. 304–313 (1996)
Tannier, E., Sagot, M.-F.: Sorting by Reversals in Subquadratic Time. In: Sahinalp, S.C., Muthukrishnan, S.M., Dogrusoz, U. (eds.) CPM 2004. LNCS, vol. 3109, pp. 1–13. Springer, Heidelberg (2004)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lou, X., Zhu, D. (2008). Genome Rearrangement Algorithms for Unsigned Permutations with O(logn) Singletons. In: Agrawal, M., Du, D., Duan, Z., Li, A. (eds) Theory and Applications of Models of Computation. TAMC 2008. Lecture Notes in Computer Science, vol 4978. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-79228-4_5
Download citation
DOI: https://doi.org/10.1007/978-3-540-79228-4_5
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-79227-7
Online ISBN: 978-3-540-79228-4
eBook Packages: Computer ScienceComputer Science (R0)