Abstract
We consider the problem of sorting linear and circular permutations and 0/1 sequences by reversals in a length-sensitive cost model. We extend the results on sorting by length-weighted reversals in two directions: we consider the signed case for linear sequences and also the signed and unsigned cases for circular sequences. We give lower and upper bounds as well as guaranteed approximation ratios for these three cases. The main result in this paper is an optimal polynomial-time algorithm for sorting circular 0/1 sequences when the cost function is additive.
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
Nadeau, J.H., Taylor, B.A.: Lengths of chromosomal segments conserved since divergence of man and mouse. Proc. Natl. Acad. Sci. USA 81, 814–818 (1984)
Pinter, R., Skiena, S.: Sorting with length-weighted reversals. In: Proc. 13th International Conference on Genome Informatics (GIW), pp. 173–182 (2002)
Bender, M., Ge, D., He, S., Hu, H., Pinter, R., Skiena, S., Swidan, F.: Improved bounds on sorting with length-weighted reversals. In: Proc. 15th ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 912–921 (2004)
Pevzner, P.A.: Computational Molecular Biology - an Algorithmic Approach. MIT Press, Cambridge (2000)
Bergeron, A.: A very elementary presentation of the hannenhalli-pevzner theory. In: Proc. 12th Symp. Combinatorial Pattern Matching (CPM), pp. 106–117 (2001)
Chen, T., Skiena, S.: Sorting with fixed-length reversals. Discrete Applied Mathematics 71, 269–295 (1996)
Hartman, T.: A simpler 1.5-approximation algorithm for sorting by transpositions. In: Proc. 14th Symp. Combinatorial Pattern Matching (CPM), pp. 156–169 (2003)
Christie, D.A., Irving, R.W.: Sorting strings by reversals and by transpositions. SIAM J. on Discrete Math. 14, 193–206 (2001)
Bafna, V., Pevzner, P.: Genome rearrangements and sorting by reversals. SIAM J. Computing 25, 272–289 (1996)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Swidan, F., Bender, M.A., Ge, D., He, S., Hu, H., Pinter, R.Y. (2004). Sorting by Length-Weighted Reversals: Dealing with Signs and Circularity. In: Sahinalp, S.C., Muthukrishnan, S., Dogrusoz, U. (eds) Combinatorial Pattern Matching. CPM 2004. Lecture Notes in Computer Science, vol 3109. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-27801-6_3
Download citation
DOI: https://doi.org/10.1007/978-3-540-27801-6_3
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-22341-2
Online ISBN: 978-3-540-27801-6
eBook Packages: Springer Book Archive