Approximating reversal distance for strings with bounded number of duplicates

Lecture Notes in Computer Science

Volumn 3618, Issue , 2005, Pages 580-590

  Kolman, Petr ^a  

^a CHARLES UNIVERSITY   (Czech Republic)

Author keywords

Approximation algorithms; Edit distance; Minimum common string partition; Sorting by reversals; String comparison

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMPUTER SCIENCE; PROBLEM SOLVING;

APPROXIMATION ALGORITHMS; EDIT DISTANCE; MINIMUM COMMON STRING PARTITION; SORTING BY REVERSALS; STRING COMPARISON;

NUMBER THEORY;

EID: 25844492762     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11549345_50     Document Type: Conference Paper

References (15)

1. A. Bergeron, J. Mixtacki, and J. Stoye. Reversal distance without hurdles and fortresses. In Proceedings of 15th Annual Combinatorial Pattern Matching Symposium (CPM), volume 3109 of LNCS, pages 388-399, 2004.
2. P. Berman, S. Hannenhalli, and M. Karpinski. 1.375-approximation algorithm for sorting by reversals. In Proceedings of the 10th Annual European Symposium on Algorithms (ESA), volume 2461 of LNCS, pages 200-210, 2002.
3. P. Berman and M. Karpinski. On some tighter inapproximability results. In Proceedings of the 26th International Colloquium on Automata, Languages and Programming (ICALP), volume 1644 of LNCS, pages 200-209, 1999.
4. A. Caprara. Sorting by reversals is difficult. In Proceedings of the First International Conference on Computational Molecular Biology, pages 75-83, 1997.
5. X. Chen, J. Zheng, Z. Fu, P. Nan, Y. Zhong, S. Lonardi, and T. Jiang. Computing the assignment of orthologous genes via genome rearrangement. In Proceedings of 3rd Asia-Pacific Bioinformatics Conference, pages 363-378, 2005.
6. D. A. Christie and R. W. Irving. Sorting strings by reversals and by transpositions. SIAM Journal on Discrete Mathematics, 14(2): 193-206, 2001.
7. M. Chrobak, P. Kolman, and J. Sgall. The greedy algorithm for the minimum common string partition problem. In Proceedings of the 7th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX), volume 3122 of LNCS, pages 84-95, 2004.
8. G. Cormode and S. Muthukrishnan. The string edit distance matching problem with moves. In Proceedings of the 13th Annual ACM-SIAM Symposium On Discrete Mathematics (SODA), pages 667-676, 2002.
9. N. El-Mabrouk. Reconstructing an ancestral genome using minimum segments duplications and reversals. Journal of Computer and System Sciences, 65(3):442-464, 2002.
10. F. Ergun, S. Muthukrishnan, and S. C. Sahinalp. Comparing sequences with segment rearrangements. In Proceedings of the 23rd Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS), volume 2914 of LNCS, pages 183-194, 2003.
11. A. Goldstein, P. Kolman, and J. Zheng. Minimum Common String Partition Problem: Hardness and Approximations. In Proceedings of the 15th International Symposium on Algorithms and Computation (ISAAC), LNCS, pages 473-484, 2004.
12. S. Hannenhalli and P. A. Pevzner. Transforming cabbage into turnip: polynomial algorithm for sorting signed permutations by reversals. Journal of the ACM, 46(1):1-27, Jan. 1999.
13. D. Sankoff and N. El-Mabrouk. Genome rearrangement. In T. Jiang, Y. Xu, and M. Q. Zhang, editors, Current Topics in Computational Molecular Biology. The MIT Press, 2002.
14. D. Shapira and J. A. Storer. Edit distance with move operations. In Proceedings of the 13th Symposium on Combinatorial Pattern Matching (CPM), volume 2373 of LNCS, pages 85-98, 2002.
15. T. Walen. Personal communication, 2005.