Sciweavers

ISAAC
2004
Springer
106views Algorithms» more  ISAAC 2004»
14 years 4 months ago
Minimum Common String Partition Problem: Hardness and Approximations
String comparison is a fundamental problem in computer science, with applications in areas such as computational biology, text processing or compression. In this paper we address t...
Avraham Goldstein, Petr Kolman, Jie Zheng
APPROX
2004
Springer
117views Algorithms» more  APPROX 2004»
14 years 4 months ago
The Greedy Algorithm for the Minimum Common String Partition Problem
In the Minimum Common String Partition problem (MCSP) we are given two strings on input, and we wish to partition them into the same collection of substrings, minimizing the numbe...
Marek Chrobak, Petr Kolman, Jiri Sgall