A Combined Greedy-Walk Heuristic and Simulated Annealing Approach for the Closest String Problem