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.
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
References
Brizuela, C., González, L., Romero, H.: An Improved Genetic Algorithm for the Sequencing by Hybridization Problem. In: Proceedings of the 2nd European Workshop on Evolutionary Bioinformatics, EvoBIO (2004) (to appear)
Garey, M., Johnson, D.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman, New York (1979)
Goldberg, D.E.: Genetic Algorithms in Search, Optimization, and Machine Learning. Addison-Wesley, Reading (1989)
Held, M., Karp, R.: The Traveling Salesman Problem and Minimum Spanning Trees. Operations Research 18, 1138–1162 (1970)
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, L.C., Romero, H.J., Brizuela, C.A. (2004). A Genetic Algorithm for the Shortest Common Superstring Problem. In: Deb, K. (eds) Genetic and Evolutionary Computation – GECCO 2004. GECCO 2004. Lecture Notes in Computer Science, vol 3103. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24855-2_139
Download citation
DOI: https://doi.org/10.1007/978-3-540-24855-2_139
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-22343-6
Online ISBN: 978-3-540-24855-2
eBook Packages: Springer Book Archive