On the Tightness of the Alternating-Cycle Lower Bound for Sorting by Reversals

Journal of Combinatorial Optimization

Volumn 3, Issue 2-3, 1999, Pages 149-182

  Caprara, Alberto ^a  

^a UNIVERSITY OF BOLOGNA   (Italy)

Author keywords

Alternating cycle relaxation; Counting; Probability; Sorting by reversals; Tightness of lower bounds

Indexed keywords

EID: 0008507968     PISSN: 13826905     EISSN: None     Source Type: Journal    
DOI: 10.1023/a:1009838309166     Document Type: Article

References (13)

1. V. Bafna and P.A. PevznerV. Bafna and P.A. Pevzner, "Genome rearrangements and sorting by reversals," SIAM Journal on Computing, vol. 25, pp. 272-289, 1996.
2. P. Berman and S. Hannenhalli, "Fast sorting by reversal," in Proceedings of 7th Annual Symposium on Combinatorial Pattern Matching, Lecture Notes in Computer Science, Springer Verlag, 1996.
3. A. Caprara, "Sorting permutations by reversals and Eulerian cycle decompositions," SIAM Journal on Discrete Mathematics, vol. 12, pp. 91-110, 1999a.
4. A. Caprara, "Formulations and hardness of multiple sorting by reversals," in Proceedings of the Third Annual International Conference on Computational Molecular Biology (RECOMB'99), ACM Press, 1999b.
5. A. Caprara, G. Lancia, and S.K. Ng, "A column-generation based branch-and-bound algorithm for sorting by reversals," DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol. 47, pp. 213-226, 1998.
6. A. Caprara, G. Lancia, and S.K. Ng, "A Sorting permutations by reversals through branch-and-price," Technical Report OR/99/1, DEIS University of Bologna, 1999.
7. M. Caprara, personal communication.
8. D.A. Christie, "A 3/2 approximation algorithm for sorting by reversals," in Proceedings of the 9th Annual ACM-SIAM Symposium on Discrete Algorithms, ACM Press, 1998, pp. 244-252.
9. S. Hannenhalli and P.A. Pevzner, "Transforming cabbage into turnip (polynomial algorithm for sorting signed permutations by reversals)," in Proceedings of the 27th Annual ACM Symposium on the Theory of Computing, ACM Press, 1995, pp. 178-187.
10. S. Hannenhalli and RA. Pevzner, "To cut . . . or not to cut (applications of comparative physical maps in molecular evolution)," in Proceedings of the 7th Annual ACM-SIAM Symposium on Discrete Algorithms, ACM Press, 1996, pp. 304-313.
11. H. Kaplan, R. Shamir, and R.E. Tarjan, "Faster and simpler algorithm for sorting signed permutations by reversals," in Proceedings of the 8th Annual ACM-SIAM Symposium on Discrete Algorithms, ACM Press, 1997.
12. J. Kececioglu and D. Sankoff, "Efficient bounds for oriented chromosome inversion distance," in Proceedings of 5th Annual Symposium on Combinatorial Pattern Matching, Lecture Notes in Computer Science, Springer Verlag, 1994, vol. 807, pp. 307-325.
13. J. Kececioglu and D. Sankoff, "Exact and approximation algorithms for sorting by reversals, with application to genome rearrangement," Algorithmica, vol. 13, pp. 180-210, 1995.