 |
    |
A Genetic Algorithm for the Shortest Common Superstring Problem
Luis C. González, Heidi J. Romero, and Carlos A. Brizuela
Computer Science Department, CICESE Research Center, Km 107 Carr. Tijuana-Ensenada, Ensenada, B.C., Méxicogurrola@cicese.mx
hjromero@cicese.mx
cbrizuel@cicese.mx
Abstract. Many real world problems can be modeled as the shortest common superstring problem. This problem has several important applications in areas such as DNA sequencing and data compression.
LNCS 3103, p. 1305 f.
lncs@springer.de
© Springer-Verlag Berlin Heidelberg 2004