A Meta Heuristic Solution for Closest String Problem Using Ant Colony System

摘要

Suppose ∑ is the alphabet set and S is the set of strings with equal length over alphabet ∑. The closest string problem seeks for a string over ∑ that minimizes the maximum hamming distance with other strings in 5. The closest string problem is NP-complete. This problem has particular importance in computational biology and coding theory. In this paper we present an algorithm based on ant colony system. The proposed algorithm can solve closest string problem with reasonable time complexity. Experimental results have shown the correctness of algorithm. At the end, a comparison with one Meta heuristic algorithm is also given.