Minimum common string partition revisited

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

Volumn 6213 LNCS, Issue , 2010, Pages 45-52

  Jiang, Haitao ^a,b   Zhu, Binhai ^a   Zhu, Daming ^b   Zhu, Hong ^c  

^a Montana State University   (United States)

^b SHANDONG UNIVERSITY   (China)

^c EAST CHINA NORMAL UNIVERSITY   (China)

Author keywords

[No Author keywords available]

Indexed keywords

AVERAGE LENGTH; FPT ALGORITHMS; GENOME REARRANGEMENTS; MINIMUM COMMON STRING PARTITION; NP-HARD; PARAMETERIZED;

APPROXIMATION ALGORITHMS;

EID: 77955901692     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-14553-7_7     Document Type: Conference Paper

References (13)

1. Chen, X., Zheng, J., Fu, Z., Nan, P., Zhong, Y., Lonardi, S., Jiang, T.: Computing the assignment of orthologous genes via genome rearrangement. In: Proc. of the 3rd Asia-Pacific Bioinformatics Conf. (APBC 2005), pp. 363-378 (2005)
2. Christie, D.A., Irving, R.W.: Sorting strings by reversals and by transpositions. SIAM Journal on Discrete Mathematics 14(2), 193-206 (2001)
3. Chrobak, M., Kolman, P., Sgall, J.: The greedy algorithm for the minimum common string partition problem. In: Jansen, K., Khanna, S., Rolim, J.D.P., Ron, D. (eds.) RANDOM 2004 and APPROX 2004. LNCS, vol.3122, pp. 84-95. Springer, Heidelberg (2004)
4. Damaschke, P.: Minimum Common String Partition Parameterized. In: Crandall, K.A., Lagergren, J. (eds.) WABI 2008. LNCS (LNBI), vol.5251, pp. 87-98. Springer, Heidelberg (2008)
5. Downey, R., Fellows, M.: Parameterized Complexity. Springer, Heidelberg (1999)
6. Flum, J., Grohe, M.: Parameterized Complexity Theory. Springer, Heidelberg (2006)
7. Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman, New York (1979)
8. Goldstein, A., Kolman, P., Zheng, J.: Minimum common string partitioning problem: Hardness and approximations. In: Fleischer, R., Trippen, G. (eds.) ISAAC 2004. LNCS, vol.3341, pp. 473-484. Springer, Heidelberg (2004)
9. also in: The Electronic Journal of Combinatorics 12 (2005), paper R50
10. Kaplan, H., Shafrir, N.: The greedy algorithm for edit distance with moves. Inf. Process. Lett. 97(1), 23-27 (2006)
11. Kolman, P., Walen, T.: Reversal Distance for Strings with Duplicates: Linear Time Approximation Using Hitting Set. In: Erlebach, T., Kaklamanis, C. (eds.) WAOA 2006. LNCS, vol.4368, pp. 279-289. Springer, Heidelberg (2007)
12. Kolman, P.: Approximating reversal distance for strings with bounded number of duplicates. In: Jedrzejowicz, J., Szepietowski, A. (eds.) MFCS 2005. LNCS, vol.3618, pp. 580-590. Springer, Heidelberg (2005)
13. Kolman, P., Walen, T.: Approximating reversal distance for strings with bounded number of duplicates. Discrete Applied Mathematics 155(3), 327-336 (2007)