Interchange rearrangement: The element-cost model

Theoretical Computer Science

Volumn 410, Issue 43, 2009, Pages 4315-4326

  Kapah, Oren ^b   Landau, Gad M ^a,d   Levy, Avivit ^a,c   Oz, Nitsan ^a  

^a UNIVERSITY OF HAIFA   (Israel)

^b BAR ILAN UNIVERSITY   (Israel)

^c SHENKAR COLLEGE OF ENGINEERING AND DESIGN   (Israel)

^d POLYTECHNIC UNIVERSITY   (United States)

Author keywords

Interchange rearrangement; Rearrangement cost models; Strings rearrangement distances

Indexed keywords

COST MODELS; EFFICIENT APPROXIMATION ALGORITHMS; INPUT STRING; MINIMUM COST; NEW MODEL; OPTIMAL ALGORITHM; REARRANGEMENT COST MODELS; STRINGS REARRANGEMENT DISTANCES;

APPROXIMATION ALGORITHMS; GRAPHICAL USER INTERFACES; INTERCHANGES; INTERSECTIONS; LOCAL AREA NETWORKS;

COSTS;

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

References (15)

1. A. Amir, Y. Aumann, G. Benson, A. Levy, O. Lipsky, E. Porat, S. Skiena, U. Vishne, Pattern matching with address errors: Rearrangement distances, in: Proc. of the 17th annual ACM-SIAM Symposium on Discrete Algorithm, SODA, 2006, pp. 1221-1229
2. ∞, in: Proc. of the 14th International Symposium on String Processing and Information Retrieval, SPIRE, 2007, pp. 39-49
3. A. Amir, Y. Aumann, O. Kapah, A. Levy, E. Porat, Approximate string matching with address bit errors, in: Proc. of the 19th Annual Symposium on Combinatorial Pattern Matching, CPM, 2008, pp. 118-130
4. A. Amir, T. Hartman, O. Kapah, A. Levy, E. Porat, On the cost of interchange rearrangement in strings in: Proc. of the 15th Annual European Symposium on Algorithms, ESA, 2007, pp. 99-110
5. S. Angelov, K. Kunal, A. McGregor, Sorting and selection with random costs, in: Proc. of the 8th Latin American Theoretical Informatics, LATIN, 2008
6. Bafna V., and Pevzner P.A. Sorting by transpositions. SIAM Journal on Discrete Mathematics 11 (1998) 224-240
7. Berman P., and Hannenhalli S. Fast sorting by reversal. Proc. 8th Annual Symposium on Combinatorial Pattern Matching, CPM vol. 1075 (1996) 168-185
8. A. Carpara, Sorting by reversals is difficult, in: Proc. 1st Annual Intl. Conf. on Research in Computational Biology, RECOMB, 1997, pp. 75-83
9. Cayley A. Note on the theory of permutations. Philosophical Magazine 34 (1849) 527-529
10. Christie D.A. Sorting by block-interchanges. Information Processing Letters 60 (1996) 165-169
11. I. Elias, T. Hartman, A 1.375-approximation algorithm for sorting by transpositions, in: Proc. of the 5th International Workshop on Algorithms in Bioinformatics, WABI, 2005, pp. 204-214
12. A. Gupta, A. Kumar, Sorting and selection with structured costs, in: Proc. of the 42nd Symposium on Foundations of Computer Science, 2001, pp. 416-425
13. Gusfield D. Algorithms on Strings, Trees, and Sequences: Computer Science and Computational Biology (1997), Cambridge University Press
14. Heath L.S. Vergara. Discrete Applied Mathematics 88 1-3 (1998) 181-206
15. Heath L.S., and Vergara J.P.C. Sorting by short swaps. Journal of Computational Biology 10 5 (2003) 775-789