Assaf Zaritsky
Senior Academic
Coevolving solutions to the shortest common superstring problem
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.
| Publication language | English |
| Pages | 209-216 |
| Journal | BioSystems |
| Volume | 76 |
| Issue number | 1-3 |
| Publication status | Published - 01.01.2004 |
Keywords
Coevolutionary algorithms
Cooperative Coevolution
Shortest common superstring
ASJC Scopus subject areas
Statistics and Probability
Modeling and Simulation
General Biochemistry, Genetics and Molecular Biology
Applied Mathematics
