Closest Substring Problem – Results from an Evolutionary Algorithm
The closest substring problem is a formal description of how to find a pattern such that from a given set of strings a subregion of each string is highly similar to that pattern. This problem appears frequently in computational biology and in coding theory. Experimental results suggest that this NP-hard optimization problem can be approached very well with a custom-built evolutionary algorithm using a fixed-length string representation, as in the typical genetic algorithm (GA) concept. Part of this success can be attributed to a novel mutation operator introduced in this paper. For practical purposes, the GA used here seems to be an improvement compared to traditional approximation algorithms. While the time complexity of traditional approximation algorithms can be analyzed precisely, they suffer from poor run-time efficiency or poor accuracy, or both.
KeywordsGenetic Algorithm Closest String Problem Closest Substring Problem Radius of Code
Unable to display preview. Download preview PDF.
- 7.Bäck, T., Fogel, D.B., Michalewicz, Z. (eds.): Evolutionary Computation 1 – Basic Algorithms and Operators. Institute of Physics Publishing, Bristol, UK (2000)Google Scholar
- 9.Holland, J.H.: Adaptation in Natural and Artificial Systems. University of Michigan Press, Ann Arbor (1975)Google Scholar
- 10.Banzhaf, W., Nordin, P., Keller, R.E., Francone, F.D.: Genetic Programming - An Introduction: On the Automatic Evolution of Computer Programs and its Applications. Morgan Kaufmann Publishers, Inc., San Francisco (1998)Google Scholar
- 11.Gen, M., Cheng, R.: Genetic Algorithms and Engineering Design. John Wiley and Sons, Inc., New York (1996)Google Scholar
- 12.Ono, I., Yamamura, M., Kobayashi, S.: A genetic algorithm for job-shop scheduling problems using job-based order crossover. In: Proceedings of IEEE International Conference on Evolutionary Computation (ICEC 1996), pp. 547–552 (1996)Google Scholar