Sciweavers

SIAMCOMP
2008
121views more  SIAMCOMP 2008»
13 years 4 months ago
Closest Substring Problems with Small Distances
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...
Dániel Marx