Short proofs for cut-and-paste sorting of permutations

Discrete Mathematics

Volumn 307, Issue 22, 2007, Pages 2866-2870

  Cranston, Daniel W ^a   Sudborough, I Hal ^b   West, Douglas B ^a  

^a UNIVERSITY OF ILLINOIS AT URBANA CHAMPAIGN   (United States)

^b UNIVERSITY OF TEXAS AT DALLAS   (United States)

Author keywords

Cut and paste; Permutation; Reversal; Sorting; Transposition

Indexed keywords

NUMERICAL METHODS; PROBLEM SOLVING;

CUT-AND-PASTE OPERATIONS; PERMUTATION;

SORTING;

EID: 35448935883     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.disc.2007.01.011     Document Type: Article

References (12)

1. Aigner M., and West D.B. Sorting by insertion of leading elements. J. Combin. Theory Ser. A 45 (1987) 306-309
2. Cohen D.S., and Blum M. On the problem of sorting burnt pancakes. Discrete Appl. Math. 61 (1995) 105-120
3. Dweighter H. Elementary problems. Amer. Math. Monthly 82 (1975) 1010
4. Erdo{combining double acute accent}s P., and Szekeres G. A combinatorial problem in geometry. Compositio. Math. 2 (1935) 464-470
5. Eriksson H., Eriksson K., Karlander J., Svensson L., and Wástlund J. Sorting a bridge hand. Discrete Math. 241 (2001) 289-300
6. Gates W.H., and Papadimitriou C.H. Bounds for sorting by prefix reversal. Discrete Math. 27 (1979) 47-57
7. Q.-P. Gu, S. Peng, I.H. Sudborough, Approximating algorithms for genome rearrangements, in: Proceedings of the Seventh Workshop on Genome Informatics, 1996.
8. S. Hannenhalli, P. Pevzner, Transforming cabbage into turnip (polynomial algorithm for sorting signed permutations by reversals), in: Proceedings of the 20th Annual ACM Symposium on Theory of Computing, 1995, pp. 178-189.
9. T. Hartman, R. Shamir, A simpler 1.5-approximation algorithm for sorting by transpositions, in: Proceedings of the Symposium on Combinatorial Pattern Matching, 2003, pp. 156-169.
10. Heydari M.H., and Sudborough I.H. On the diameter of the pancake network. J. Algorithms 25 (1997) 67-94
11. H. Kaplan, R. Shamir, R.E. Tarjan, Faster and simpler algorithm for sorting signed permutations by reversals, in: Proceedings of the Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 1997, pp. 344-351.
12. M.T. Walter, Z. Dias, J. Meidanis, Reversal and transposition distance of linear chromosomes, in: String Processing and Information Retrieval: A South American Symposium, 1998, pp. 96-102.