Sorting by bounded block-moves

Discrete Applied Mathematics

Volumn 88, Issue 1-3, 1998, Pages 181-206

  Heath, Lenwood S ^a   Vergara, John Paul C ^b  

^a VIRGINIA POLYTECHNIC INSTITUTE AND STATE UNIVERSITY   (United States)

^b ATENEO DE MANILA UNIVERSITY   (Philippines)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0038936403     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0166-218X(98)00072-9     Document Type: Article

References (16)

1. M. Aigner, D.B. West, Sorting by insertion of leading element, J. Combin. Theory A 45 (1987) 306-309.
2. V. Bafna, P.A. Pevzner, Sorting by transpositions, SIAM Journal on Discrete Mathematics 11 (1998) 224-240.
3. V. Bafna, P.A. Pevzner, Genome rearrangements and sorting by reversals, SIAM J. Comput. 25 (1996) 272-289.
4. A. Caprara, Sorting by reversals is difficult, SIAM J. Comput. submitted.
5. T. Chen, S. Skiena, Sorting with fixed-length reversals, Discrete Appl. Math. 71 (1996) 269-295.
6. S. Even, O. Goldreich, The minimum-length generator sequence problem is NP-hard, J. Algorithms 2 (1981) 311-313.
7. S.A. Guyer, L.S. Heath, J.P.C. Vergara, Subsequence and run heuristics for the sorting by transpositions problem, Tech. Rep. TR 97-20, Department of Computer Science, Virginia Polytechnic Institute and State University, 1997.
8. L.S. Heath, J.P.C. Vergara, Some experiments on the sorting by reversals problem, Tech. Rep. TR 95-16, Department of Computer Science, Virginia Polytechnic Institute and State University, 1995.
9. L.S. Heath, J.P.C. Vergara, Sorting by short block-moves, submitted.
10. M.R. Jerrum, The complexity of finding minimum-length generator sequences, Theoret. Comput. Sci. 36 (1985) 265-289.
11. D.B. Johnson, A priority queue in which initialization and queue operations take O(log log D) time, Math. Systems Theory 15 (1982) 295-309.
12. J. Kececioglu, D. Sankoff, Efficient bounds for oriented chromosome inversion distance, in: 5th Annual Symposium on Combinatorial Pattern Matching, Lecture Notes in Computer Science, vol. 807, Springer, Berlin, 1994, pp. 307-325.
13. J. Kececioglu, D. Sankoff, Exact and approximation algorithms for sorting by reversals, with application to genome rearrangement, Algorithmica 13 (1995) 180-210.
14. A. Pnueli, A. Lempel, S. Even, Transitive orientation of graphs and identification of permutation graphs, Can. J. Math. 23 (1971) 160-175.
15. D. Rotem, J. Urrutia, Circular permutation graphs, Networks 12 (1982) 429-437.
16. J.P.C. Vergara, Sorting by bounded permutations, PhD thesis, Virginia Polytechnic Institute and State University, 1997.