Sorting permutations by block-interchanges

Information Processing Letters

Volumn 60, Issue 4, 1996, Pages 165-169

  Christie, David A ^a  

^a UNIVERSITY OF GLASGOW   (United Kingdom)

Author keywords

Algorithms; Combinatorial problems; Permutations; Sorting; String comparison

Indexed keywords

ALGORITHMS; BIOTECHNOLOGY; COMPUTER SOFTWARE; MUTAGENS; POLYNOMIALS; SORTING;

BLOCK-INTERCHANGE; PERMUTATIONS;

COMBINATORIAL MATHEMATICS;

EID: 0030285740     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0020-0190(96)00155-X     Document Type: Article

References (10)

1. M. Aigner and D.B. West, Sorting by insertion of leading elements, J. Combin. Theory Ser. A 45 (1987) 306-309.
2. V. Bafna and P.A. Pevzner, Sorting by transpositions, in: Proc. 6th Ann. ACM-SIAM Symp. on Discrete Algorithms (1995) 614-623.
3. V. Bafna and P.A. Pevzner, Genome rearrangements and sorting by reversals, SIAM J. Comput. 25 (1996) 272-289.
4. A. Caprara, Sorting by reversals is difficult, April 1996.
5. S. Even and O. Goldreich, The minimum-length generator sequence problem is NP-hard, J. Algorithms 2 (1981) 311-313.
6. W.H. Gates and C.H. Papadimitriou, Bounds for sorting by prefix reversal, Discrete Math. 27 (1979) 47-57.
7. S. Hannenhalli, Polynomial algorithm for computing translocation distance, in: Proc. 6th Ann. Symp. on Combinatorial Pattern Matching (CPM'95), Lecture Notes in Computer Science 937 (Springer, Berlin, 1995) 162-176.
8. M.R. Jerrum, The complexity of finding minimum-length generator sequences, Theoret. Comput. Sci. 36 (1985) 265-289.
9. J. Kececioglu and D. Sankoff, Exact and approximation algorithms for sorting by reversals, with application to genome rearrangement, Algorithmica 13 (1995) 180-210.
10. J.D. Kececioglu and R. Ravi, Of mice and men: Algorithms for evolutionary distances between genomes with translocation, in: Proc. 6th ACM-SIAM Symp. on Discrete Algorithms (1995) 604-613.