Abstract
This paper 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 (SBH) 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.
This work is an “in extenso” version of our previous work [11].
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Armen, C., Stein, C.: Improved Length Bounds for the Shortest Superstring problem. In: Sack, J.-R., Akl, S.G., Dehne, F., Santoro, N. (eds.) WADS 1995. LNCS, vol. 955, pp. 494–505. Springer, Heidelberg (1995)
Armen, C., Stein, C.: A 2 2/3 approximation algorithm for the shortest superstring problem. In: Hirschberg, D.S., Meyers, G. (eds.) CPM 1996. LNCS, vol. 1075, pp. 87–101. Springer, Heidelberg (1996)
Blazewicz, J., Kasprzak, M., Kuroczycki, W.: Hybrid Genetic Algorithm for DNA Sequencing with Errors. Journal of Heuristics 8, 495–502 (2002)
Blum, A., Jiang, T., Li, M., Tromp, J., Yannakakis, M.: Linear approximation of shortest superstring. In: Proceedings of the 23rd ACM Symp. on theory of computing (1991)
Bresaluer, D., Jiang, T., Jiang, Z.: Rotations of Periodic String and Short Superstring. Journal of Algorithms 24, 340–353 (1996)
Brizuela, C.A., González, L.C., Romero, H.J.: An Improved Genetic Algorithm for the Sequencing by Hybridization Problem. In: Raidl, G.R., Cagnoni, S., Branke, J., Corne, D.W., Drechsler, R., Jin, Y., Johnson, C.G., Machado, P., Marchiori, E., Rothlauf, F., Smith, G.D., Squillero, G. (eds.) EvoWorkshops 2004. LNCS, vol. 3005, pp. 11–20. Springer, Heidelberg (2004)
Caviani, P.A., Solas, D., Sullivan, E.J., Cronin, M.T., Holmes, C.P., Fodor, S.P.A.: Light-Generated Oligonucleotide Arrays for Rapid DNA Sequence Analysis. In: Proceedings of the National Academy of Sciences of the USA 91, pp. 5022–5026 (1994)
Czumaj, A., Gasieniec, L., Piotrow, M., Rytter, W.: Sequential and Parallel Approximation of Shortest Superstrings. Journal of Algorithms 23, 74–100 (1995)
Garey, M., Johnson, D.: Computers and Intractability: A guide to the theory of NP-Completeness. Freeman, New York (1978)
Goldberg, D.E.: Genetic Algorithms in Search, Optimization, and Machine Learning. Addison-Wesley, Reading (1989)
González, L.C., Romero, H.J., Brizuela, C.A.: A Genetic Algorithm for the Shortest Common Superstring Problem. In: Deb, K., et al. (eds.) GECCO 2004. LNCS, vol. 3103, pp. 1305–1306. Springer, Heidelberg (2004)
Grefenstette, J., Gopal, R., Rosmaita, B., Van Gucht, D.: Genetic algorithms for the travelling salesman problem. In: Proceedings of the first International Conference on Genetic Algorithms and Application, vol. 1, pp. 160–168 (1985)
Held, M., Karp, R.: The traveling salesman problem and minimum spanning trees. Operational Research 18, 1138–1182 (1970)
Johnson, D.S., McGeoch, L.A., Rothberg, E.E.: Asymptotic experimental analysis for the Held-Karp traveling salesman bound. In: Proceedings of the 7th Annual ACM-SIAM Symposium in Discrete Algorithms, pp. 341–350 (1996)
Pevzner, P.A.: Computational Molecular Biology: An Algorithmic Approach. MIT Press, Cambridge (2000)
Sipper, M.: A succes story or an old wives’ tale? On judging experiments in evolutionary computation. Complexity 4(5), 31–33 (2000)
Sweedyk, E.: A 2 1/2 approximation algorithm for the shortest common superstring,University of California, Ph.D. Dissertation (1995)
Teng, S.H., Yao, F.: Approximating shortest superstrings. In: Proceedings of the 34th IEEE Symp. Found. Comp. Science, pp. 158–165 (1993)
Zaritsky, A.: Coevolving Solutions to the Shortest Common Superstring Problem. Master’s thesis, Departament of Computer Science, Ben-Gurion University, Beer- Sheva 84105, Israel (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
González-Gurrola, L.C., Brizuela, C.A., Gutiérrez, E. (2004). A Genetic Algorithm for the Shortest Common Superstring Problem. In: Lemaître, C., Reyes, C.A., González, J.A. (eds) Advances in Artificial Intelligence – IBERAMIA 2004. IBERAMIA 2004. Lecture Notes in Computer Science(), vol 3315. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30498-2_85
Download citation
DOI: https://doi.org/10.1007/978-3-540-30498-2_85
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-23806-5
Online ISBN: 978-3-540-30498-2
eBook Packages: Springer Book Archive