SPIRE
2004
Springer
13 years 10 months ago
2004
Springer
Given a set of strings U = {T1, T2, . . . , T }, the longest common repeat problem is to find the longest common substring that appears at least twice in each string of U. We als...
APPROX
2004
Springer
13 years 10 months ago
2004
Springer
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...
SPIRE
2005
Springer
13 years 10 months ago
2005
Springer
Given a set of strings U = {T1, T2, . . . , T }, the longest common repeat problem is to find the longest common substring that appears at least twice in each string of U, conside...