Closest String - Fixed-parameter Tractability

Fixed-parameter Tractability

Closest String can be solved in, where k is the number of input strings, L is the length of all strings and d is the desired maximum distance from the solution string to any input string.