135 search results - page 1 / 27 » String Noninclusion Optimization Problems |
SIAMDM
1998
13 years 10 months ago
1998
For every string inclusion relation there are two optimization problems: find a longest string included in every string of a given finite language, and find a shortest string in...
ICDE
2012
IEEE
12 years 1 months ago
2012
IEEE
— We consider the approximate string membership checking (ASMC) problem of extracting all the strings or substrings in a document that approximately match some string in a given ...
GECCO
2009
Springer
14 years 3 months ago
2009
Springer
Given a set of strings S of equal lengths over an alphabet Σ, the closest string problem seeks a string over Σ whose maximum Hamming distance to any of the given strings is as s...
CORR
2010
Springer
13 years 11 months ago
2010
Springer
We report (to our knowledge) the first evaluation of Constraint Satisfaction as a computational framework for solving closest string problems. We show that careful consideration o...
APPROX
2005
Springer
14 years 4 months ago
2005
Springer
We resolve two open problems presented in [8]. First, we consider the problem of reconstructing an unknown string T over a fixed alphabet using queries of the form “does the st...