Exact and kernelization algorithms for Closet String
In this paper we address CLOSEST STRING problem that arises in web searching, coding theory and computational molecular biology.To solve it is to find a string that minimizes the maximum Hamming distance from Measuring Tools a given set of strings.CLOSEST STRING is an NP-hard problem.This paper proposes two linear-time algorithms, one for the gener