Sorting Permutations by Reversals Through Branch-and-Price

INFORMS Journal on Computing

Volumn 13, Issue 3, 2001, Pages 224-244

  Caprara, Alberto ^a   Lancia, Giuseppe ^b   Ng, See Kiong ^c  

^a UNIVERSITY OF BOLOGNA   (Italy)

^b UNIVERSITY OF PADOVA   (Italy)

^c GLAXOSMITHKLINE   (United Kingdom)

Author keywords

Algorithms; Analysis of algorithms; Applications; Integer; Matchings; Networks graphs; Programming

Indexed keywords

EID: 0347712353     PISSN: 10919856     EISSN: None     Source Type: Journal    
DOI: 10.1287/ijoc.13.3.224.12631     Document Type: Article

References (33)

1. Bafna, V., P. A. Pevzner. 1996. Genome rearrangements and sorting by reversals. SIAM Journal on Computing 25 272-289.
2. Barnhart, C., E. L. Johnson, G. L. Nemhauser, M. W. P. Savelsbergh, P. H. Vance. 1998. Branch-and-price: column generation for solving huge integer programs, Operations Research 46 316-329.
3. Berman, P., S. Hannenhalli. 1996. Fast sorting by reversal. Proceedings of 7th Annual Symposium on Combinatorial Pattern Matching, Lecture Notes in Computer Science, Springer Verlag, Berlin, Germany.
4. Berman, P., M. Karpinski. 1998. On some tighter inapproximability results. ECCC Report No. 29, University of Trier, Trier, Germany. http://www.eccc.uni-trier.de/.
5. Blanchette, M. 1999. Personal communication.
6. Caprara, A. 1999a. On the tightness of the alternating-cycle Lower bound for sorting by reversals. Journal of Combinatorial Optimization 3 149-182.
7. Caprara, A. 1999b. Sorting permutations by reversals and Eulerian cycle decompositions. SIAM Journal on Discrete Mathematics 12 91-110.
8. Caprara, A., G. Lancia, S. K. Ng. 1999a. A column-generation based branch-and-bound algorithm for sorting by reversals. M. Farach-Colton, F. S. Roberts, M. Vingron, M. Waterman, eds. Mathematical Support for Molecular Biology; DIMACS Scries in Discrete Mathematics and Theoretical Computer Science 47 213-226, AMS Press, Providence, RI.
9. Caprara, A., G. Lancia, S. K. Ng. 1999b. Sorting permutations by reversals through branch-and-price. Research Report OR/99/1, DEIS, University of Bologna, Bologna, Italy. http://www.or.deis.unibo.it/techrep.html.
10. Caprara, A., R. Rizzi. 2001. Improved approximation for breakpoint graph decomposition and sorting by reversals. to appear in Journal of Combinatorial Optimization.
11. Carpaneto, G., S. Martello, P. Toth. 1988. Algorithms and codes for the assignment problem. Annals of Operations Research 13 193-223.
12. Christie, D. A. 1998. A 3/2 approximation algorithm for sorting by reversals. Proceedings of the 9th Annual ACM-SIAM Symposium on Discrete Algorithms, ACM Press, New York, NY, 244-252.
13. Cook, W. J., A. Rohe. 1999. Computing minimum-weight perfect matchings. INFORMS Journal on Computing 11 138-148.
14. Farach-Colton, M. F. S., Roberts, M. Vingron, M. Waterman, eds. 1999. Mathematical Support for Molecular Biology; DIMACS Series in Discrete Mathematics and Theoretical Computer Science 47, AMS Press, Providence. RI.
15. Farley, A. A. 1990. A note on bounding a class of linear programming problems, including cutting stock problems. Operations Research 38 922-923.
16. Franklin, N. 1985. Conservation of genome form but not sequence in the transcription antitermination determinants of bacterio-phages λ, φ21 and P22. Journal of Molecular Evolution 181 75-84.
17. Gerards, A. M. H. 1995. Matching. M. O. Ball, T. L. Magnanti, C. L. Monma, G. L. Nemhauser, eds. Networks; Handbooks in Operations Research and Management Sciences, North Holland, Amsterdam, The Netherlands.
18. Hannenhalli, S. 1997. Personal communication.
19. Hannenhalli, S., P. A. Pevzner. 1996. To cut ...or not to cut (applications of comparative physical maps in molecular evolution). Proceedings of the 7th Annual ACM-SIAM Symposium on Discrete Algorithms, ACM Press, New York, NY, 304-313.
20. Hannenhalli, S, P. A. Pevzner. 1999. Transforming cabbage into turnip (polynomial algorithm for sorting signed permutations by reversals). Journal of the ACM 48 1-27.
21. Irving, R. W., D. A. Christie. 1995. Sorting by reversals: a conjecture of Kececioglu and Sankoff. Technical Report TR-1995-12, Dept. of Computing Science, University of Glasgow, Glasgow, Scotland, http://www.dcs.gla.ac.uk/tild;christie/.
22. Kaplan, H., R. Shamir, R. E. Tarjan. 2000. Faster and simpler algorithm for sorting signed permutations by reversals. SIAM Journal on Computing 29 880-892.
23. Kececioglu, J., D. Sankoff. 1994. Efficient bounds for oriented chromosome inversion distance. Proceedings of 5th Annual Symposium on Combinatorial Pattern Matching, Lecture Notes in Computer Science 807, Springer Verlag, Berlin, Germany, 307-325.
24. Kececioglu, J., D. Sankoff. 1995. Exact and approximation algorithms for sorting by reversals, with application to genome rearrangement. Algorithmica 13 180-210.
25. Lawler, E. L., J. K. Lenstra, A. H. G. Rinnooy Kan, D. B. Shmoys. 1993. Sequencing and scheduling: algorithms and complexity. S. C. Graves, P. H. Zipkin, A. H. G. Rinnooy Kan, eds. Logistics of Production and Inventory; Handbooks in Operations Research and Management Sciences, North Holland, Amsterdam, The Netherlands.
26. Merhotra, A., M. A. Trick. 1996. A column generation approach for exact graph coloring. INFORMS Journal on Computing 8 344-354.
27. Padberg, M. W., G. Rinaldi. 1991. A branch-and-cut algorithm for the resolution of large-scale symmetric traveling salesman problems. SIAM Review 33 60-100.
28. Sankoff, D. 1993. Analytical approaches to genomic evolution. Biochimie 75 409-413.
29. Sankoff, D., G. Leduc, N. Antoine, B. Paquin, B. F. Lang, R. Cedergren. 1992. Gene order comparisons for phylogenetic inference: evolution of the mitochondrial genome. Proc. Natl. Acad. Sci. USA 89 6575-6579.
30. Sankoff, D., G. Sundaram, J. Kececioglu. 1996. Steiner points in the space of genome rearrangements. International Journal of Foundations of Computer Science 7 1-9.
31. Tran, N. 1997. An easy case of sorting by reversals. Proceedings of the 8th Annual Symposium on Combinatorial Pattern Matching, Lecture Notes in Computer Science 1264, Springer Verlag, Berlin, Germany, 83-89.
32. Vance, P. H., C. Barnhart, E. L. Johnson, G. L. Nemhauser. 1994. Solving binary cutting stock problems by column generation and branch-and-bound. Computational Optimization and Applications 3 111-130.
33. Watterson, G. A., W. J. Ewens, T. E. Hall, A. Morgan. 1982. The chromosome inversion problem Journal of Theoretical Biology 99 1-7.