Minimum common string partition parameterized

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

Volumn 5251 LNBI, Issue , 2008, Pages 87-98

  Damaschke, Peter ^a  

^a CHALMERS UNIVERSITY OF TECHNOLOGY   (Sweden)

Author keywords

[No Author keywords available]

Indexed keywords

BIOINFORMATICS; NUCLEAR PROPULSION; NUCLEIC ACIDS; ORGANIC ACIDS; TECHNICAL PRESENTATIONS;

COMPARATIVE GENOMICS; DNA FINGERPRINTS; MINIMUM COMMON STRING PARTITIONS; NP-HARD; OPTIMALITY; ORTHOLOG; PARAMETERIZED;

APPROXIMATION ALGORITHMS;

EID: 56649095725     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-87361-7_8     Document Type: Conference Paper

References (12)

1. Braga, M.D.V., Sagot, M.F., Scornavacca, C., Tannier, E,: The solution space of sorting by reversals. In: Mǎndoiu, I.I., Zelikovsky, A. (eds.) ISBRA 2007. LNCS (LNBI), vol. 4463, pp. 293-304. Springer, Heidelberg (2007); journal version to appear in IEEE/ACM Transactions on Computational Biology and Bioinformatics
2. Cai, L., Huang, X., Liu, C., Rosamond, F., Song, Y.: Parameterized complexity and biopolymer sequence comparison. The Computer Journal, Special Issue in Parameterized Complexity 51, 270-291 (2008)
3. Chen, X., Liu, L., Liu, Z., Jiang, T.: On the minimum common integer partition problem. in: Calamoneri, T., Finocchi, I., ltaliano, G.F. (eds.) CIAC 2006. LNCS, vol. 3998, pp. 236-247. Springer, Heidelberg (2006)
4. Chen, X., Zheng, J., Fu, Z., Nan, P., Zhong, Y., Lonardi, S., Jiang, T.: Assignment of orthologous genes via genome rearrangement. IEEE/ACM Transactions on Computational Biology and Bioinformatics 2, 302-315 (2005)
5. Chrobak, M., Kolman, P., Sgall, J.: The greedy algorithm for the minimum common string partition problem. in: Jansen, K., Khanna, S., Rolim, J., Ron, D. (eds.) APPROX 2004. LNCS, vol. 3122, pp. 84-95. Springer, Heidelberg (2004)
6. Downey, R.G., Fellows, M.R.: Parameterized Complexity. Springer, Heidelberg (1999)
7. 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. 484-495. Springer, Heidelberg (2004); also in The Electronic Journal of Combinatorics 12, paper R50 (2005)
8. He, D.: A novel greedy algorithm for the minimum common string partition problem. In: Mǎndoiu, I.I., Zelikovsky, A. (eds.) ISBRA 2007. LNCS (LNBI), vol. 4463, pp. 441-452. Springer, Heidelberg (2007)
9. Hüffner, F., Niedermeier, R., Wernicke, S.: Developing fixed-parameter algorithms to solve combinatorially explosive biological problems. In: Bioinformatics, vol. II: Structure, Function and Applications. Methods in Molecular Biology, vol. 453. Humana Press (2008)
10. Kolman, P.: Approximating reversal distance for strings with bounded number of duplicates in linear time. In: Jedrzejowicz, J., Szepietowski, A. (eds.) MFCS 2005. LNCS, vol. 3618, pp. 580-590. Springer, Heidelberg (2005)
11. Kolman, P., Walén, T.: Reversal distance for strings with duplicates: Linear time approximation using hitting set. The Electronic Journal of Combinatorics 14 (2007); paper R.50, also in: 4th Workshop on Approximation and Online Algorithms WAOA. LNCS, vol. 4368, pp. 281-291. Springer, Heidelberg (2007)
12. Woodruff, D.P.: Better approximations for the minimum common integer partition problem. In: Díaz, J., Jansen, K., Rolim, J., Zwick, U. (eds.) APPROX 2006. LNCS, vol. 4110, pp. 248-259. Springer, Heidelberg (2006)