Coevolving solutions to the shortest common superstring problem |
| |
Authors: | Zaritsky Assaf Sipper Moshe |
| |
Institution: | Department of Computer Science, Ben-Gurion University, P.O. Box 653, Beer-Sheva 84105, Israel. assafza@cs.bgu.ac.il |
| |
Abstract: | The shortest common superstring (SCS) problem, known to be NP-Complete, seeks the shortest string that contains all strings from a given set. In this paper we compare four approaches for finding solutions to the SCS problem: a standard genetic algorithm, a novel cooperative-coevolutionary algorithm, a benchmark greedy algorithm, and a parallel coevolutionary-greedy approach. We show the coevolutionary approach produces the best results, and discuss directions for future research. |
| |
Keywords: | |
本文献已被 PubMed 等数据库收录! |
|