135 search results - page 2 / 27 » String Noninclusion Optimization Problems |
SPIRE
2009
Springer
14 years 5 months ago
2009
Springer
The consensus string problem is finding a representative string (consensus) of a given set S of strings. In this paper we deal with the consensus string problems optimizing both d...
COCOON
2010
Springer
14 years 2 months ago
2010
Springer
Given a set of n strings of length L and a radius d, the closest string problem (CSP for short) asks for a string tsol that is within a Hamming distance of d to each of the given ...
SOFSEM
2010
Springer
14 years 7 months ago
2010
Springer
GECCO
2006
Springer
14 years 2 months ago
2006
Springer
A genetic algorithm for the longest common subsequence problem encodes candidate sequences as binary strings that indicate subsequences of the shortest or first string. Its fitnes...
SPIRE
2010
Springer
13 years 9 months ago
2010
Springer
We initiate the study of the smoothed complexity of the Closest String problem by proposing a semi-random model of Hamming distance. We restrict interest to the optimization versio...