The greedy algorithm for the minimum common string partition problem

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

Volumn 3122, Issue , 2004, Pages 84-95

  Chrobak, Marek ^a   Kolman, Petr ^a,b   Sgall, Jiří ^c  

^a University of California Riverside   (United States)

^b CHARLES UNIVERSITY   (Czech Republic)

^c MATHEMATICAL INSTITUTE   (Czech Republic)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMBINATORIAL OPTIMIZATION; OPTIMIZATION;

APPROXIMATION RATIOS; GREEDY ALGORITHMS; INPUT STRING; LONGEST COMMON SUBSTRING; LOWER BOUNDS; MINIMUM COMMON STRING PARTITION; NP-HARD; SUB-STRINGS;

APPROXIMATION ALGORITHMS;

EID: 35048899253     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-27821-4_8     Document Type: Article

References (8)

1. X. Chen, J. Zheng, Z. Fu, P. Nan, Y. Zhong, S. Lonardi, T. Jiang. Assignment of orthologous genes via genome rearrangement. Submitted. 2004.
2. G. Cormode, J.A. Muthukrishnan, The string edit distance matching with moves. Proc. 13th Annual Symposium on Discrete Algorithms (SODA), pp. 667-676, 2002.
3. A. Goldstein, P. Kolman, and J. Zheng: Minimum common string partitioning problem: Hardness and approximations. Manuscript. 2004.
4. J. B. Kruskal and D. Sankoff. An anthology of algorithms and concepts for sequence comparison. In Time Warps, String Edits, and Macromolecules: The Theory and Practice of Sequence Comparison, Edited by David Sankoff and Joseph B. Kruskal, Addison-Wesley. 1983.
5. V. I. Levenshtein. Binary codes capable of correcting deletions, insertions and reversals (in Russian). Doklady Akademii Nauk SSSR, 163(4):845-848, 1965.
6. D. Lopresti, A. Tomkins. Block edit models for approximate string matching. Theoretical Computer Science 181 (159-179) 1997.
7. D. Shapira, J.A. Storer. Edit distance with move operations. Proc. 13th Annual Symposium on Combinatorial Pattern Matching (CPM), pp. 85-98, 2002.
8. W. F. Tichy. The string-to-string correction problem with block moves. ACM Trans. Computer Systems 2 (309-321) 1984.