Minimum common string partition problem: Hardness and approximations

Electronic Journal of Combinatorics

Volumn 12, Issue 1 R, 2006, Pages

  Goldstein, Avraham ^a   Kolman, Petr ^b   Zheng, Jie ^c  

^a STONY BROOK UNIVERSITY   (United States)

^b CHARLES UNIVERSITY   (Czech Republic)

^c University of California Riverside   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 25844482680     PISSN: 10778926     EISSN: 10778926     Source Type: Journal    
DOI: 10.37236/1947     Document Type: Article

References (14)

1. A. Avidor and U. Zwick. Approximating MIN k-SAT. In Proceedings of 13th International Symposium on Algorithms and Computation (ISAAC), volume 2518 of Lecture Notes in Computer Science, pages 465-475, 2002.
2. P. Berman and M. Karpinski. On some tighter inapproximability results. In Proceedings of the of 26th International Colloquium on Automata, Languages and Programming (ICALP), volume 1644 of Lecture Notes in Computer Science, pages 200-209, 1999.
3. A. Caprara. Sorting by reversals is difficult. In Proceedings of the First International Conference on Computational Molecular Biology, pages 75-83. ACM Press, 1997.
4. 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 (APBC), pages 363-378, 2005. To appear in IEEE/ACM Transactions on Computational Biology and Bioinformatics.
5. D. A. Christie and R. W. Irving. Sorting strings by reversals and by transpositions. SIAM Journal on Discrete Mathematics, 14(2):193-206, 2001.
6. 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), pages 84-95, 2004. To appear in ACM Transactions on Algorithms.
7. 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.
8. M. R. Garey and D. S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman & Company, San Francisco, 1978.
9. 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), volume 3341 of Lecture Notes in Computer Science, pages 484-495, 2004.
10. 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, 1999.
11. P. Kolman. Approximating reversal distance for strings with bounded number of duplicates. In Proceedings of the 30th International Symposium on Mathematical Foundations of Computer Science (MFCS), volume 3618 of Lecture Notes in Computer Science, pages 580-590, 2005.
12. D. Sankoff and N. El-Mabrouk. Genome rearrangement. In T. Jiang, Y. Xu, and M. Q. Zhang, editors, Current Topics in Computational Molecular Biology, pages 135-155. The MIT Press, 2002.
13. D. Shapira and J. A. Storer. Edit distance with move operations. In 13th Symposium on Combinatorial Pattern Matching (CPM), volume 2373 of Lecture Notes in Computer Science, pages 85-98, 2002.
14. G. A. Watterson, W. J. Ewens, T. E. Hall, and A. Morgan. The chromosome inversion problem. Journal of Theoretical Biology, 99:1-7, 1982.