Prefix reversals on binary and ternary strings

SIAM Journal on Discrete Mathematics

Volumn 21, Issue 3, 2007, Pages 592-611

  Hurkens, Cor ^a   Van Iersel, Leo ^a   Keijsper, Judith ^a   Kelk, Steven ^b   Stougie, Leen ^a,b   Tromp, John ^b  

^a EINDHOVEN UNIVERSITY OF TECHNOLOGY   (Netherlands)

^b CWI   (Netherlands)

Author keywords

Algorithms; Genome comparison; Pancake flipping; Prefix reversals; Sorting; Strings

Indexed keywords

ALGORITHMS; GENOME COMPARISON; PANCAKE FLIPPING; PREFIX REVERSALS; SORTING; STRINGS;

TERMINOLOGY;

EID: 49449099388     PISSN: 08954801     EISSN: None     Source Type: Journal    
DOI: 10.1137/060664252     Document Type: Article

References (12)

1. X. CHEN, J. ZHENG, Z. FU, P. NAN, Y. ZHONG, S. LONARDI, AND T. JIANG, Assignment of orthologous genes via genome rearrangement, IEEE/ACM Trans. Comput. Biol. Bioinform., 2 (2005), pp. 302-315.
2. D. A. CHRISTIE AND R. W. IRVING, Sorting strings by reversals and by transpositions, SIAM J. Discrete Math., 14 (2001), pp. 193-206.
3. D. S. COHEN AND M. BLUM, On the problem of sorting burnt pancakes, Discrete Appl. Math., 61 (1995), pp. 105-120.
4. H. ERIKSSON, K. ERIKSSON, J. KARLANDER, L. SVENSSON, AND J. WASTLUND, Sorting a bridge hand, Discrete Math., 241 (2001), pp. 289-300.
5. J. FISCHER AND S. W. GINZINGER, A 2-approximation algorithm for sorting by prefix reversals, in Proceedings of ESA 2005: 13th Annual European Symposium, Lecture Notes in Comput. Sci. 3669, Springer, New York, 2005, pp. 415-425.
6. M. R. GAREY AND D. S. JOHNSON, Computers And Intractability: A Guide To The Theory Of NP-completeness, W. H. Freeman, San Francisco, CA, 1979.
7. W. H. GATES AND C. H. PAPADIMITRIOU, Bounds for sorting by prefix reversal, Discrete Math., 27 (1979), pp. 47-57.
8. A. GOLDSTEIN, P. KOLMAN, AND J. ZHENG, Minimum common string partition problem: Hardness and approximations, Electron. J. Combin., 12 (2005), #R50.
9. M. H. HEYDARI AND I. H. SUDBOROUGH, On the diameter of the pancake network, J. Algorithms, 25 (1997), pp. 67-94.
10. L. MORALES AND I. H. SUDBOROUGH, Comparing star and pancake networks, in The Essence of Computation: Complexity, Analysis, Transformation, T. Mogensen, D. Schmidt, and I. H. Sudborough, eds., Lecture Notes in Comput. Sci. 2566, Springer, New York, 2002, pp. 18-36.
11. A. J. RADCLIFFE, A. D. SCOTT, AND E. L. WILMER, Reversals and transpositions over finite alphabets, SIAM J. Discrete Math., 19 (2005), pp. 224-244.
12. A. D. SCOTT, personal communication, Merton College, Oxford, 2006.