78 search results - page 4 / 16 » On The Closest String and Substring Problems |
SIAMDM
1998
13 years 7 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...
ADMA
2005
Springer
2005
Springer
Parallel Genetic Algorithm and Parallel Simulated Annealing Algorithm for the Closest String Problem
14 years 1 months ago
In this paper, we design genetic algorithm and simulated annealing algorithm and their parallel versions to solve the Closest String problem. Our implementation and experiments sho...
PROCEDIA
2011
12 years 10 months ago
2011
We report the first evaluation of Constraint Satisfaction as a computational framework for solving closest string problems. We show that careful consideration of symbol occurrenc...
SOFSEM
2010
Springer
14 years 4 months ago
2010
Springer
SPIRE
2004
Springer
14 years 27 days ago
2004
Springer
Given a set of strings U = {T1, T2, . . . , T }, the longest common repeat problem is to find the longest common substring that appears at least twice in each string of U. We als...