Analysis of evolutionary algorithms for the longest common subsequence problem

Proceedings of GECCO 2007: Genetic and Evolutionary Computation Conference

Volumn , Issue , 2007, Pages 939-946

  Jansen, Thomas ^a   Weyland, Dennis ^b  

^a TU DORTMUND UNIVERSITY   (Germany)

^b UNIVERSITY OF HAGEN   (Germany)

Author keywords

Crossover; Longest common subsequence problem; Run time analysis

Indexed keywords

BIOINFORMATICS; COMPUTATIONAL EFFICIENCY; COMPUTER SCIENCE; FUNCTION EVALUATION; PATTERN RECOGNITION; PROBLEM SOLVING;

LONGEST COMMON SUBSEQUENCE PROBLEM; PROBLEM SPECIFIC ALGORITHMS; RUN TIME ANALYSIS;

EVOLUTIONARY ALGORITHMS;

EID: 34548083123     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1276958.1277148     Document Type: Conference Paper

References (15)

1. H.-G. Beyer, H.-P. Schwefel, and I. Wegener. How to analyze evolutionary algorithms. Theoretical Computer Science, 287(1):101-130, 2002.
2. P. Briest, D. Brockhoff, B. Degener, M. Englert, C. Gunia, O. Heering, T. Jansen, M. Leifhelm, K. Plociennik, H. Röglin, A. Schweer, D. Sudholt, S. Tannenbaum, and I. Wegener. Experimental Supplements to the theoretical analysis of eas on problems from combinatorial optimization. In Proceedings of the 8th International Conference on Parallel Problem Solving from Nature (PPSN VIII), pages 21-30, 2004.
3. T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein. Introduction to Algorithms. MIT Press, 2001.
4. K. DeJong. Evolutionary Computation: A Unified Approach. MIT Press, 2006.
5. O. Giel and I. Wegener. Maximum cardinality matchings on trees by randomized local search. In Proceedings of the 8th Annual Genetic and Evolutionary Computation Conference (GECCO 2006), pages 539-546, 2006.
6. T. Hagerup and C. Rüb. A guided tour of chernoff bounds. Information Processing Letters, 33(6):305-308, 1990.
7. B. Hinkemeyer and B. A. Julstrom. A genetic algorithm for the longest common subsequence problem. In Proceedings of the 8th Annual Genetic and Evolutionary Computation Conference (GECCO 2006), pages 609-610, 2006.
8. T. Jansen and R. P. Wiegand. Bridging the gap between theory and practice. In Proceedings of the 8th International Conference on Parallel Problem Solving From Nature (PPSN VIII), pages 61-71, 2004.
9. B. A. Julstrom and B. Hinkemeyer. Starting from scratch: Growing longest common subsequences with evolution. In Proceedings of the 9th International Conference on Parallel Problem Solving From Nature (PPSN IX), pages 930-938, 2006.
10. R. Motwani and P. Raghavan. Randomized Algorithms. Cambridge University Press, 1995.
11. H. Mühlenbein. How evolutionary algorithms really work: Mutation and hillclimbing. In Proceedings of the 2nd International Conference on Parallel Problem Solving from Nature (PPSN II), pages 15-26, 1992.
12. F. Neumann. Expected runtimes of evolutionary algorithms for the eulerian cycle problem. Computers and Operations Research, 2007. To appear.
13. F. Neumann and I. Wegener. Minimum spanning trees made easier via multi-objective optimization. Natural Computing, 5(3):305-319, 2006.
14. J. Scharnow, K. Tinnefeld, and I. Wegener. The analysis of evolutionary algorithms on sorting and shortest paths problems. Journal of Mathematical Modelling and Algorithms, 3:349-366, 2004.
15. T. Storch. How randomized search heuristics find maximum cliques in planar graphs. In Proceedings of the 8th AnnualGenetic and Evolutionary Computation Conference (GECCO 2006), pages 567-574, 2006.