Bounding prefix transposition distance for strings and permutations

Theoretical Computer Science

Volumn 421, Issue , 2012, Pages 15-24

  Chitturi, Bhadrachalam ^a   Sudborough, I Hal ^b  

^a AMRITA UNIVERSITY   (India)

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

Author keywords

Approximation; Bounds; Complexity; Prefix transpositions

Indexed keywords

APPROXIMATION; BINARY STRING; BOUNDS; COMPLEXITY; GENOME REARRANGEMENTS; NP COMPLETE; PREFIX TRANSPOSITIONS; SUB-STRINGS; UPPER AND LOWER BOUNDS; UPPER BOUND;

COMPUTER SCIENCE;

EID: 84856610853     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2011.11.018     Document Type: Article

References (33)

1. V. Bafna, P.A. Pevzner, Genome rearrangements and sorting by reversals, in: FOCS, 1993, pp. 148157.
2. V. Bafna, and P. Pevzner Sorting permutations by transpositions SIAM Journal of Discrete Mathematics 11 2 1998 224 240
3. W.W. Bein, L.L. Larmore, S. Latifi, and I.H. Sudborough Block sorting is hard International Journal of Foundations of Computer Science 14 3 2003 425 437
4. Laurent Bulteau, Guillaume Fertin, and Irena Rusu Sorting by Transpositions Is Difficult ICALP 1 2011 654 665
5. B. Chitturi, On transforming sequences, Ph.D. Thesis, Department of Computer Science, University of Texas at Dallas, 2007.
6. B. Chitturi A note on complexity of genetic mutations Discrete Mathematics Algorithms and Applications 3 3 2011 269 286
7. B. Chitturi, I.H. Sudborough, Bounding prefix transposition distance for strings and permutations, in: HICSS 2008, 2008, pp. 469478.
8. B. Chitturi, H. Sudborough, W. Voit, and X. Feng Adjacent Swaps on Strings LNCS vol. 5092 2008 Springer-Verlag 299 308
9. B. Chitturi, W. Fahle, Z. Meng, L. Morales, C. Shields, H. Sudborough, and W. Voit An (18 n 11) upper bound for sorting by prefix reversals Theoretical Computer Science 410 36 2009 3372 3390
10. B. Chitturi, I.H. Sudborough, Prefix reversals on strings, in: Proceedings of International Conference in Bioinformatics and Computational Biology, BIOCOMP 2010, pp. 591598.
11. B. Chitturi, I.H. Sudborough, On complexity of transforming strings, in: Proceedings of International Conference in Bioinformatics and Computational Biology, BIOCOMP 2010, pp. 591598.
12. D. Christie, and R. Irving Sorting Strings by reversals and transpositions SIAM Journal on Discrete Mathematics 14 2 2001 193 206
13. G. Cormode, and S. Muthukrishnan The string edit distance matching problem with moves ACM Transactions on Algorithms 3 1 2007
14. D. Cranston, I.H. Sudborough, and D.B. West Short proofs for cut-and-paste sorting of permutations Discrete Mathematics 307 22 2007 2866 2870 (Pubitemid 47625372)
15. Ulisses Dias, and Zanoni Dias An improved 1.375-approximation algorithm for the transposition distance problem 2010 ACM BCB 334337
16. Zanoni Dias, and Joao Meidanis Sorting by prefix transpositions LNCS vol. 2476 2002 Springer-Verlag 463 468
17. I. Elias, and T.A Hartman 1.375-approximation algorithm for sorting by transpositions IEEE/ACM TCBB 3 4 2006 369 379
18. H. Eriksson, K. Eriksson, J. Karlander, L. Svensson, and J. Wastlund Sorting a bridge hand Discrete Mathematics 241 2001 289 300 (Pubitemid 33673697)
19. Xuerong Feng, Bhadrachalam Chitturi, Hal Sudborough, Sorting circular permutations by bounded transpositions, in: Advances in Computational Biology, in: Advances in Experimental Medicine and Biology, Springer-Verlag, vol. 680, Part 7, pp. 725736. doi:10.1007/978-1-4419-5913-381.
20. Guillaume Fertin, Anthony Labarre, Irena Rusu, and Eric Tannier Stphane Vialette Combinatorics of Genome Rearrangements first ed. 2009 MIT Press
21. V.J. Fortuna, Distncias de transposio entre genomas. Master's Thesis, Institute of Computing, University of Campinas, 2005.
22. Avraham Goldstein, Petr Kolman, and Jie Zheng Minimum common string partition problem: hardness and approximations The Electronic Journal of Combinatorics 12 2005 R50 http://www.combinatorics.org/Volume12/PDF/v12i1r50.pdf
23. M.R. Garey, and D.S. Johnson Strong NP-completeness results: motivation, examples, and implications Journal of the ACM 25 3 1978 499 508
24. T. Hartman, and R. Shamir A simpler and faster 1.5-approximation algorithm for sorting by transpositions Information and Computation 204 2 2006 275 290 (Pubitemid 43082823)
25. W.H. Gates, and C.H. Papadimitriou Bounds for sorting by prefix reversal Discrete Mathematics 27 1979 47 57
26. L.S. Heath, and J.P.C. Vergara Sorting by bounded block-moves Discrete Applied Mathematics 88 13 1998 181 206 (Pubitemid 128379053)
27. L.S. Heath, and J.P.C. Vergara Sorting by short swaps Journal of Computational Biology 10 5 2003 775 789 (Pubitemid 37392980)
28. M. Heydari, and I.H. Sudborough Journal of Algorithm 25 1997 67 94
29. C. Hurkens, L. Van Iersel, J. Keijsper, S. Kelk, L. Stougie, and John Tromp Prefix reversals on binary and ternary strings SIAM Journal on Discrete Mathematics 21 3 2007 592 611
30. J. Kececioglu, and D. Sankoff Exact and approximation algorithms for sorting by reversals, with application to genome rearrangement Algorithmica 13 1995 180 210
31. A. Labarre Edit Distances and Factorisations of Even Permutations LNCS vol. 5193 2008 Springer-Verlag 635 646
32. A.J. Radcliffe, A.D. Scott, and E.L. Wilmer Reversals and transpositions over finite alphabets SIAM Journal on Discrete Mathematics 19 1 2005 224 244
33. D. Shapira, and J.A. Storer Edit Distance with Move operations LNCS vol. 2373 2002 Springer-Verlag 85 98