Sorting by short block-moves

Algorithmica (New York)

Volumn 28, Issue 3, 2000, Pages 323-352

  Heath, L S ^a   Vergara, J P C ^b  

^a State University   (United States)

^b ATENEO DE MANILA UNIVERSITY   (Philippines)

Author keywords

Approximation algorithms; Computational biology; Genome rearrangement; Maximum matching; Permutations

Indexed keywords

EID: 0242575352     PISSN: 01784617     EISSN: None     Source Type: Journal    
DOI: 10.1007/s004530010041     Document Type: Article

References (24)

1. M. Aigner and D. B. West, Sorting by insertion of leading element, Journal of Combinatorial Theory, A, 45 (1987), 306-309.
2. S. B. Akers and B. Krishnamurthy, A group-theoretic model for symmetric interconnection networks, IEEE Transactions on Computers, 38 (1989), 555-566.
3. F. Annexstein, M. Baumslag, and A. L. Rosenberg, Group action graphs and parallel architectures, SIAM Journal on Computing, 19 (1990), 544-569.
4. V. Bafna and P. A. Pevzner, Sorting permutations by transpositions, in Proceedings of the Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 1995, pp. 614-623.
5. V. Bafna and P. A. Pevzner, Genome rearrangements and sorting by reversals, SIAM Journal on Computing, 25 (1996), 272-289.
6. M. Bousquet-Melou, Polyominoes and polygons. Contemporary Mathematics, 178 (1994), 55-70.
7. A. Caprara, Sorting permutations by reversals and eulerian cycle decompositions, SIAM Journal on Discrete Mathematics, 12 (1999), 91-110.
8. T. Chen and S. Skiena, Sorting with fixed-length reversals, Discrete Applied Mathematics, 71 (1996), 269-295.
9. D. A. Christie, Sorting permutations by block-interchanges, Information Processing Letters, 60 (1996), 165-169.
10. J. H. Conway and J. C. Lagarias, Tiling with polyominoes and combinatorial group theory, Journal of Combinatorial Theory, Series A, 53 (1990), 183-208.
11. B. A. Davey and H. A. Priestley, Introduction to Lattices and Order, Cambridge University Press, Cambridge, 1990.
12. S. Even and O. Goldreich, The minimum-length generator sequence problem is NP-hard, Journal of Algorithms, 2 (1981), 311-313.
13. W. H. Gates and C. H. Papadimitriou, Bounds for sorting by prefix reversal, Discrete Mathematics, 27 (1979), 47-57.
14. E. Gyori and G. Turan, Stack of pancakes, Studia Scientarium Mathematicarum Hungarica, 13 (1978), 133-137.
15. L. S. Heath and J. P. C. Vergara, Sorting by bounded block-moves, Discrete Applied Mathematics, 88 (1998), 181-206.
16. L. S. Heath and J. P. C. Vergara, Sorting by Short Block-Moves, Tech. Report TR 98-03, Department of Computer Science, Virginia Polytechnic Institute and State University, 1998.
17. M. H. Heydari and I. H. Sudborough, On sorting by prefix reversals and the diameter of pancake networks, in Parallel Architectures and Their Efficient Use (F. Meyer auf der Heide, B. Monien, and A. L. Rosenberg, eds.), Lecture Notes in Computer Science, vol. 678, Springer-Verlag, Berlin, 1992.
18. M. R. Jerrum, The complexity of finding minimum-length generator sequences, Theoretical Computer Science, 36 (1985), 265-289.
19. J. Kececioglu and D. Sankoff, Efficient bounds for oriented chromosome inversion distance, in Proceedings of the Fifth Annual Symposium on Combinatorial Pattern Matching, Lecture Notes in Computer Science, vol. 807, Springer-Verlag, Berlin, 1994, pp. 307-325.
20. J. Kececioglu and D. Sankoff, Exact and approximation algorithms for sorting by reversals, with application to genome rearrangement, Algorithmica, 13 (1995), 180-210.
21. P. A. Peterson and M. C. Loui, The general maximum matching algorithm of Micali and Vazirani, Algorithmica, 3 (1988), 511-533.
22. A. Pnueli, A. Lempel, and S. Even, Transitive orientation of graphs and identification of permutation graphs, Canadian Journal of Mathematics, 23 (1971), 160-175.
23. D. Rotem and J. Urrutia, Circular permutation graphs, Networks, 12 (1982), 429-437.
24. J. P. C. Vergara, Sorting by Bounded Permutations, Ph.D. thesis, Virginia Polytechnic Institute and State University, 1997.