Minimum common string partition problem: hardness and approximations

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

Volumn 3341, Issue , 2004, Pages 484-495

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

^a CHARLES UNIVERSITY   (Czech Republic)

^b University of California Riverside   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION ALGORITHMS; TEXT PROCESSING;

COMMON PARTITION; COMPUTATIONAL BIOLOGY; GENOME REARRANGEMENTS; MINIMUM COMMON STRING PARTITION; PARTITION PROBLEM; PROBLEM HARDNESS; SORTING BY REVERSALS; STRING COMPARISON; TEXT COMPRESSIONS; TEXT-PROCESSING; INPUT STRING; NUMBER OF BLOCKS;

TEXT PROCESSING; APPROXIMATION ALGORITHMS;

EID: 25844508722     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-30551-4_43     Document Type: Article

References (12)

1. A. Avidor and U. Zwick. Approximating MIN k-SAT. In Proc. 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 Proc. of the of 26th International Colloquium on Automata, Languages and Programming (ICALP), pages 200-209, 1999.
3. A. Caprara. Sorting by reversals is difficult. In Proc. of the First International Conference on Computational Molecular Biology, pages 75-83, 1997.
4. X. Chen, J. Zheng, Z. Fu, P. Nan, Y. Zhong, S. Lonardi, and T. Jiang. Assignment of orthologous genes via genome rearrangement. Submitted, 2004.
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 Proc. of the 7th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX), 2004.
7. G. Cormode and S. Muthukrishnan. The string edit distance matching problem with moves. In Proc. 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. S. Hannenhalli and P. A. Pevzner. Transforming cabbage into turnip: polynomial algorithm for sorting signed permutations by reversals. Journal of the ACM, 46(l):l-27, Jan. 1999.
10. 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.
11. D. Shapira and J. A. Storer. Edit distance with move operations. In 13th Symposium on Combinatorial Pattern Matching (CPM), 2002.
12. G. A. Watterson, W. J. Ewens, T. E. Hall, and A. Morgan. The chromosome inversion problem. Journal of Theoretical Biology, 99:1-7, 1982.