On the cost of interchange rearrangement in strings

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4698 LNCS, Issue , 2007, Pages 99-110

  Amir, Amihood ^a,b   Hartman, Tzvika ^a   Kapah, Oren ^a   Levy, Avivit ^a   Porat, Ely ^a  

^a BAR ILAN UNIVERSITY   (Israel)

^b Johns Hopkins University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COST ACCOUNTING; MATHEMATICAL MODELS; PROBLEM SOLVING;

INTERCHANGING ELEMENTS; REARRANGEMENT PROBLEMS; SORTING PROBLEM;

ARTIFICIAL INTELLIGENCE;

EID: 38049064030     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-75520-3_11     Document Type: Conference Paper

References (17)

1. Bergeron, A.: A very elementary presentation of the Hannenhalli-Pevzner theory. Discrete Applied Mathematics 146(2), 134-145 (2005)
2. Caprara, A.: Sorting permutations by reversals and Eulerian cycle decompositions. SIAM journal on discrete mathematics 12(1), 91-110 (1999)
3. Hannenhalli, S., Pevzner, P.: Transforming cabbage into turnip: Polynomial algorithm for sorting signed permutations by reversals. Journal of the ACM 46, 1-27 (1999)
4. Bafna, V., Pevzner, P.: Sorting by transpositions. SIAM J. on Disc. Math. 11, 221-240 (1998)
5. Hannenhalli, S.: Polynomial algorithm for computing translocation distance between genomes. Discrete Applied Mathematics 71, 137-151 (1996)
6. Christie, D.A.: Sorting by block-interchanges. Information Processing Letters 60, 165-169 (1996)
7. Heath, L.S., Vergara, P.C.: Sorting by short swaps. J. of Comp. Biology 10(5), 775-789 (2003)
8. Christie, D.A.: Genome Rearrangement Problems. PhD thesis, University of Glasgow (1999)
9. Radcliff, A.J., Scott, A.D., Wilmer, E.L.: Reversals and transpositions over finite alphabets. SIAM journal on discrete mathematics 19, 224-244 (2005)
10. Cayley, A.: Note on the theory of permutations. Philosophical Magazine 34, 527-529 (1849)
11. Jcrrum, M.R.: The complexity of finding minimum-length generator sequences. Theoretical Computer Science 36, 265-289 (1985)
12. Amir, A., Aumann, Y., Benson, G., Levy, A., Lipsky, O., Porat, E., Skiena, S., Vishne, U.: Pattern matching with address errors: Rearrangement distances. In: Proc. 17th SODA, pp. 1221-1229 (2006)
13. Bender, M.A., Ge, D., He, S., Hu, H., Pinter, R.Y., Skiena, S., Swidan, F.: Improved bounds on sorting with length-weighted reversals. In: Proc. 15th SODA, pp. 912-921 (2004)
14. Holyer, I.: The NP-completeness of some edge-partition problems. SIAM Journal of Computing 10(4), 713-717 (1981)
15. Knuth, D.E: The Art of Computer Programming. In: Sorting and Searching, Reading, Mass, vol. 3, Addison-Wesley, London, UK (1973)
16. Edmonds, J., Karp, R.M.: Theoretical improvements in algorithmoc efficiency for network flow problems. Journal of The ACM (JACM) 19(2), 248-264 (1972)
17. Fredman, M.L., Tarjan, R.E.: Fibonacci heaps and their uses in improved network optimization algorithms. Journal of The ACM (JACM) 34(3), 596-615 (1987)