106
Voted
SIAMCOMP
2008
15 years 2 months ago
2008
We study two pattern matching problems that are motivated by applications in computational biology. In the Closest Substring problem k strings s1, . . ., sk are given, and the tas...