Coevolving solutions to the shortest common superstring problem

BioSystems

Volumn 76, Issue 1-3, 2004, Pages 209-216

  Zaritsky, Assaf ^a   Sipper, Moshe ^a  

^a BEN GURION UNIVERSITY OF THE NEGEV   (Israel)

Author keywords

Coevolutionary algorithms; Cooperative Coevolution; Shortest common superstring

Indexed keywords

COEVOLUTION;

ALGORITHM; COEVOLUTION; CONFERENCE PAPER; GENETIC ALGORITHM; INTERMETHOD COMPARISON; MATHEMATICAL ANALYSIS; MATHEMATICAL MODEL;

EID: 4444363690     PISSN: 03032647     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.biosystems.2004.05.013     Document Type: Conference Paper

References (16)

1. Blum A., Jiang T., Li M., Tromp J., Yannakakis M. Linear approximation of shortest superstrings. Journal of the ACM. 41:1994;634-647
2. Garey, M., Johnson, D., 1979. Computers and Intractability. Freeman, New York.
3. Lesk, A., 1988. Computational Molecular Biology. Sources and Methods for Sequence Analysis. Oxford University Press, Oxford.
4. Paredis J. Coevolutionary computation. Artificial Life. 2(4):1995;355-375
5. Peña-Reyes, C.-A., Sipper, M., 2000. Applying fuzzy CoCo to breast cancer diagnosis. In: Proceedings of the 2000 Congress on Evolutionary Computation (CEC00), vol. 2. IEEE Press, Piscataway, NJ, pp. 1168-1175.
6. Peña-Reyes, C.-A., Sipper, M., 2001a. The flowering of fuzzy CoCo: evolving fuzzy iris classifiers. In: Proceedings of the Fifth International Conference on Artificial Neural Networks and Genetic Algorithms (ICANNGA 2001). Springer-Verlag, Vienna, pp. 304-307.
7. Peña-Reyes C.-A., Sipper M. Fuzzy CoCo: a cooperative- coevolutionary approach to fuzzy modeling. IEEE Trans. Fuzzy Systems. 9(5):2001b;727-737
8. Potter, M.A., 1997. The Design and Analysis of a Computational Model of Cooperative Coevolution. George Mason University.
9. Potter M.A., De Jong K.A. Cooperative coevolution: an architecture for evolving coadapted subcomponents. Evolution. Comput. 8(1):2000;1-29
10. Rosin C.D., Belew R.K. New methods for competitive coevolution. Evolution. Comput. 5(1):1997;1-29
11. Sipper M. A Success story or an old wives' tale? On judging experiments in evolutionary computation. Complexity. 5(4):2000;31-33
12. Sipper, M., 2002. Machine Nature: The Coming Age of Bio-Inspired Computing. McGraw-Hill, New York.
13. Storer, J., Data Compression: Methods and Theory. Computer Science Press.
14. Sweedyk Z. A 2.5-approximation algorithm for shortest superstring. SIAM J. Computing. 29(3):1999;954-986
15. Tarhio J., Ukkonen E. A Greedy Approximation Algorithm for Constructing Shortest Common Superstring Problem. Theoretical Computer Science. 57:1988;131-145
16. Turner J. Approximation algorithms for the shortest common superstring problem. Inform. Comput. 83:1989;1-20