7 citations · 7 across the 1 of their papers we have counts for
1 paper
Michael R. Fellows, Jens Gramm, Rolf Niedermeier
We show that Closest Substring, one of the most important problems in the field of biological sequence analysis, is W[1]-hard when parameterized by the number k of input strings (a…