The preservation of favored building blocks in the struggle for fitness: The puzzle algorithm

IEEE Transactions on Evolutionary Computation

Volumn 8, Issue 5, 2004, Pages 443-455

  Zaritsky, Assaf ^a   Sipper, Moshe ^a  

^a BEN GURION UNIVERSITY OF THE NEGEV   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

BENCHMARKING; BLOCK CODES; COMPUTATIONAL COMPLEXITY; GRAPHIC METHODS; SET THEORY; VECTORS;

BUILDING BLOCKS; COEVOLUTIONARY ALGORITHMS; COOPERATIVE COEVOLUTION; PUZZLE ALGORITHM; RECOMBINATION LOCI; SHORTEST COMMON SUPERSTRING PROBLEM;

GENETIC ALGORITHMS;

EID: 7744229122     PISSN: 1089778X     EISSN: None     Source Type: Journal    
DOI: 10.1109/TEVC.2004.831260     Document Type: Article

References (33)

1. A. Zaritsky and M. Sipper, "Coevolving solutions to the shortest common superstring problem," BioSystems, vol. 76, 2004.
2. M. Sipper, [i Machine Nature: The Coming Age of Bio-Inspired Computing i]. New York: McGraw-Hill, 2002.
3. J. Storer, [i Data Compression: Methods and Theory i]. Rockville, MD: Computer Science, 1988.
4. M. Li, "Toward a DNA sequencing theory," in [i Proc. 31st Annu. IEEE Symp. Foundations Computer Science i], St. Louis, MO, 1990, pp. 125-134.
5. M. Garey and D. Johnson, [i Computers and Intractability i]. New York: Freeman, 1979.
6. A. Blum, T. Jiang, M. Li, J. Tromp, and M. Yannakakis, "Linear approximation of shortest superstrings," [i J. ACM i], vol. 41, pp. 634-647, 1994.
7. S. Teng and F. Yao, "Approximating shortest superstrings," in [i Proc. 34th Annu. IEEE Symp. Foundations Computer Science i], Palo Alto, CA, 1993, pp. 158-165.
8. A. Czumaj, L. Gasieniec, M. Piotrow, and W. Rytter, "Parallel and sequential approximations of shortest superstrings," in [i Lecture Notes in Computer Science i]. Berlin, Germany: Springer-Verlag, 1994, vol. 824, Proc. 1st Scandinavian Workshop Algorithm Theory, pp. 95-106.
9. R. Kosaraju, J. Park, and C. Stein, "Long tours and short superstrings," in [i Proc. 35th Annu. IEEE Symp. Foundations Computer Science i], Santa Fe, NM, 1994, pp. 166-177.
10. C. Armen and C. Stein, "Improved length bounds for the shortest superstring problem," in [i Lecture Notes in Computer Science i]. Berlin, Germany: Springer-Verlag, 1995, vol. 955, Proc. 5th Int. Workshop Algorithms and Data Structures, pp. 494-505.
11. C. Armen, "A 2 2/3 approximation algorithm for the shortest superstring problem," in [i Lecture Notes in Computer Science i]. Berlin, Germany: Springer-Verlag, 1996, vol. 1075, Proc. Combinatorial Pattern Matching, pp. 87-101.
12. D. Breslauer, T. Jiang, and Z. Jiang, "Rotations of periodic strings and short superstrings," [i J. Algorithms i], vol. 24, pp. 340-353, 1997.
13. Z. Sweedyk, "A 2 1/2 approximation algorithm for shortest superstring," [i SIAM J. Comput. i], vol. 29, no. 3, pp. 954-986, Dec. 1999.
14. J. Turner, "Approximation algorithms for the shortest common superstring problem," [i Inform. Comput. i], vol. 83, pp. 1-20, 1989.
15. A. Frieze and W. Szpankowski, "Greedy algorithms for the shortest common superstring that are asymptotically optimal," [i Algorithmica i], vol. 21, pp. 21-26, May 1998.
16. J. Paredis, "Coevolutionary computation," [i Artif. Life i], vol. 2, no. 4, pp. 355-375, 1995.
17. W. D. Hillis, "Co-evolving parasites improve simulated evolution as an optimization procedure," [i Physica D i], vol. 42, pp. 228-234, 1990.
18. C. D. Rosin and R. K. Belew, "New methods for competitive coevolution," [i Evol. Comput. i], vol. 5, no. 1. pp. 1-29, 1997.
19. M. A. Potter, "The design and analysis of a computational model of cooperative coevolution," Ph.D. dissertation, George Mason Univ., Fairfax, VA, 1997.
20. C.-A. Pena-Reyes, "Applying Fuzzy CoCo to breast cancer diagnosis," in [i Proc. Congr. Evolutionary Computation i], vol. 2, La Jolla, CA, 2000, pp. 1168-1175.
21. C.-A. Pena-Reyes, "Fuzzy CoCo: A cooperative-coevolutionary approach to fuzzy modeling," [i IEEE Trans. Fuzzy Syst. i], vol. 9, pp. 727-737, Oct. 2001.
22. C.-A. Pena-Reyes, "The flowering of Fuzzy CoCo: Evolving fuzzy iris classifiers," in [i Proc. 5th Int. Conf. Artificial Neural Networks Genetic Algorithms (ICANNCA 2001) i], V. Kurková, N. C. Steele, R. Neruda, and M. Kárný, Eds., Vienna, 2001, pp. 304-307.
23. R. Eriksson and B. Olsson, "Cooperative coevolution in inventory control optimization," in [i Proc. 3rd Int. Conf. Artificial Neural Networks and Genetic Algorithms (ICANNGA 1997) i], G. D. Smith, N. C. Steele, and R. F. Albrecht, Eds., Norwich, U.K., 1997, pp. 583-587.
24. M. A. Potter and K. A. De Jong, "Cooperative coevolution: An architecture for evolving coadapted subcomponents," [i Evol. Comput. i], vol. 8, no. 1, pp. 1-29, Spring 2000.
25. P. Darwen and X. Yao, "Speciation as automatic categorical modularization," [i IEEE Trans. Evol. Comput. i], vol. 1, pp. 100-108, July 1997.
26. M. Sipper, "A success story or an old wives' tale? On judging experiments in evolutionary computation," [i Complexity i], vol. 5, no. 4, pp. 31-33, Mar./Apr. 2000.
27. S. B. Gabriel [i et al. i], "The structure of haplotype blocks in the human genome," [i Science i], vol. 296, no. 5576, pp. 2225-2229, 2002.
28. L. Helmuth, "Genome research: Map of the human genome 3.0," [i Science i], vol. 293, no. 5530, pp. 583-585, 2001.
29. E. D. de Jong, "Representation development from Pareto-coevolution," in [i Proc. Genetic Evolutionary Computation Conf. i], 2003, pp. 265-276.
30. E. D. de Jong and T. Oates, "A coevolutionary approach to representation development," in [i Proc. Workshop Development Representations i], E. D. de Jong and T. Oates, Eds., Sydney, Australia, 2002, [Online]. Available: http://www.demo.cs.brandeis.edu/icml02ws.
31. D. E. Goldberg, B. Korb, and K. Deb, "Messy genetic algorithms: Motivation, analysis, and first results," [i Complex Syst. i], vol. 3, no. 5, pp. 493-530, 1990.
32. D. E. Goldberg, K. Deb, H. Kargupta, and G. Hank, "Rapid accurate optimization of difficult problems using fast messy genetic algorithms," in [i Proc. 5th Int. Conf. Genetic Algorithms i], S. Forrest, Ed., San Mateo, CA, 1993, pp. 56-64.
33. D. Kujazew and D. E. Golberg, "OMEGA - ordering messy GA: Solving permutation problems with the fast messy genetic algorithm and random keys," in [i Proc. Genetic Evolutionary Computation Conf. i], D. Whitley, D. Goldberg, E. Cantu-Paz, L. Spector, I. Parmee, and H.-G. Beyer, Eds., Las Vegas, NV, July 10-12, 2000, pp. 181-188.