Bounding prefix transposition distance for strings and permutations

Proceedings of the Annual Hawaii International Conference on System Sciences

Volumn , Issue , 2008, Pages

  Chitturi, Bhadrachalam ^a   Sudborough, I Hal ^a  

^a The University of Texas at Dallas   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

INTERNATIONAL CONFERENCES; SUB-STRINGS; SYSTEM SCIENCES;

TERMINOLOGY;

EID: 51449120511     PISSN: 15301605     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/HICSS.2008.75     Document Type: Conference Paper

References (22)

1. W.W. Bein, L. L. Larmore., S. Latifi, I. H. Sudborough. Block sorting is hard. Parallel Architectures, Algorithms and Networks, I-SPAN '02 Proceedings. International Symposium, p. 307-312, 2002.
2. V. Bafna and P. Pevzner, Sorting Permutations by Transpositions, SIAM J. Discrete Mathematics, V.11, No. 2, p. 224-240,1998
3. V. Bafna and P. A. Pevzner. Genome Rearrangements and Sorting by Reversals. Annual Symposium on Foundations of Computer Science, p.148-157,1993.
4. D. Christie and R. Irving, Sorting Strings by reversals and transpositions. SIAM J. Discrete Math, v.14, no.2, p.193-206, 2001.
5. G. Cormode and S Muthukrishnan. The String Edit Distance Matching Problem with Moves. Symposium on Discrete Algorithms; Proceedings of Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms; p.667-676, 2002.
6. B. Chitturi and I. H. Sudborough. Prefix Transpositions on Strings. Dept. of Comp. Sci., University of Texas at Dallas, 11/06.
7. B. Chitturi and I. H. Sudborough. Prefix Reversals on Strings. Dept. of Comp. Sci, University of Texas at Dallas, 11/06.
8. B. Chitturi and I. H. Sudborough. On Complexity of Transforming Strings with Prefix Reversals and Prefix Transpositions. Dept. of Comp. Sci, University of Texas at Dallas, 11/06.
9. D. Cranston, I. H. Sudborough, and D. B. West. Short Proofs for Cut-and-Paste Sorting of Permutations. "arXiv:math/0605084v1" [math.CO].
10. Zanoni Dias and Joao Meidanis, Sorting by Prefix Transpositions, Lecture Notes in Computer Science, Springer Berlin/Heidelberg, v.2476/2002, p. 463-468, 2002.
11. H. Eriksson, K. Eriksson, J. Karlander, L. Svensson, J. Wastlund, "Sorting a bridge hand", Discrete Mathematics, v.241, 2001, p.289-300.
12. A. Goldstein, P. Kolman and J. Zheng. Minimum Common String Partition Problem: Hardness and Approximations. Lecture Notes in Computer Science, Springer Berlin / Heidelberg, ISSN: 0302-9743, Volume 3341, p.484-495, 2004.
13. M. R. Garey and D. S. Johnson, "Strong" NP-Completeness Results: Motivation, Examples, and Implications, J. Assoc. for Comp. Mach., v.25, no.3, July 1978, pp.499-508.
14. W. H. Gates and C. H. Papadimitriou, Bounds for sorting by prefix reversal, Discrete Mathematics, v.27, pp.47-57, 1979
15. L. S. Heath and J. P. C. Vergara, Sorting by bounded block-moves, Discrete Applied Mathematics, v.88, i.1-3, p.181-206, 9 November 1998.
16. C. Hurkens, L. Van Iersel, J. Keijsper, S. Kelk, L. Stougie and John Tromp, Prefix reversals on binary and ternary strings, Arxiv preprint math CO/0602456, 2006 - arxiv.org.
17. T. Hartman and R. Shamir. A simpler and faster 1.5-approximation algorithm for sorting by transpositions. Information and Computation, Elsevier, 2005.
18. M. Heydari and I. H. Sudborough, On the Diameter of the Pancake Network, J. of. Algorithms, v.25, pp.67-94, 1997.
19. L. S. Heath and J. P. C. Vergara. Sorting by Short Swaps. Journal of Computational Biology, Vol. 10, No. 5, p. 775-789, Oct 2003.
20. J. Kececioglu and D. Sankoff, "Exact and Approximation Algorithms for Sorting by Reversals, with Application to Genome Rearrangement". Algorithmica 13, p.180-210, 1995.
21. A. J. Radcliffe, A.D. Scott and E.L. Wilmer, Reversals and transpositions over finite alphabets, SIAM Journal on Discrete Math, v.19, no.1, pp.224-244, Aug 03 2005
22. D. Shapira and J. A. Storer. Edit Distance with Move operations. Lecture Notes in Computer Science, Springer Berlin / Heidelberg, ISSN: 0302-9743, Volume 2373, p.85-98, 2002.