Abstract
This paper1 presents a genetic algorithm for the shortest common superstring problem. The problem appears in the computational part of a deoxyribonucleic acid (DNA) sequencing procedure as well as in data compression. The proposed genetic algorithm is based on a recently proposed algorithm for the sequencing by hybridization (SEE) problem. The algorithm exploits the crossover operator and modifies the objective function to make the algorithm both more effective and more efficient. Experimental results on real data show the effectiveness of the proposed algorithm. © Springer-Verlag Berlin Heidelberg 2004.
Cite
CITATION STYLE
González-Gurrola, L. C., Brizuela, C. A., & Gutiérrez, E. (2004). A genetic algorithm for the shortest common superstring problem. In Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science) (Vol. 3315, pp. 851–860). Springer Verlag. https://doi.org/10.1007/978-3-540-30498-2_85
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
