首页 正文

A hybrid metaheuristic for closest string problem

{{output}}
The Closest String Problem (CSP) is an optimisation problem, which is to obtain a string with the minimum distance from a number of given strings. In this paper, a new metaheuristic algorithm is investigated for the problem, whose main feature is relatively hi... ...