Metaheuristic algorithms are employed to solve complex and large‐scale optimization
problems in many different fields, from transportation and smart cities to finance. This paper …

So-called string problems are abundant in bioinformatics and computational biology. New
optimization problems dealing with DNA or protein sequences are constantly arising and …

String variables occur as a natural part of many computationally challenging problems from
different areas, such as computational biology (eg, protein folding, sequence alignment) …

The closest string problem (CSP) that arises in computational molecular biology and coding
theory is to find a string that minimizes the maximum Hamming distance from a given set of …

Abstract The Closest String Problem (CSP) calls for finding an n-string that minimizes its
maximum Hamming distance from m given n-strings. Recently, integer linear programs (ILP) …

Abstract The Closest String Problem (CSP) calls for finding an n-string that minimizes its
maximum distance from m given n-strings. Integer linear programming (ILP) proved to be …

In the modern society, the importance of taking smart decisions is universally acknowledged
in any different context. Companies, nations, individuals aim at being efficient and …