Analysis of evolutionary algorithms for the longest common subsequence problem

Algorithmica (New York)

Volumn 57, Issue 1, 2010, Pages 170-186

  Jansen, Thomas ^a   Weyland, Dennis ^b  

^a TU DORTMUND UNIVERSITY   (Germany)

^b DALLE MOLLE INSTITUTE FOR ARTIFICIAL INTELLIGENCE IDSIA   (Switzerland)

Author keywords

Crossover; Evolutionary algorithms; Longest common subsequence problem; Run time analysis

Indexed keywords

ALGORITHMIC FRAMEWORK; APPROXIMATION FACTOR; FINITE SET; FUNDAMENTAL PROBLEM; LONGEST COMMON SUBSEQUENCE PROBLEM; OPTIMALITY; PROBLEM-SPECIFIC ALGORITHMS; RUN-TIME ANALYSIS; STEADY STATE;

APPROXIMATION ALGORITHMS; BIOINFORMATICS; SET THEORY;

EVOLUTIONARY ALGORITHMS;

EID: 74849108894     PISSN: 01784617     EISSN: 14320541     Source Type: Journal    
DOI: 10.1007/s00453-008-9243-6     Document Type: Conference Paper

References (17)

1. Bergroth, L., Hakonen, H., Raita, T.: (2002): A survey of longest common subsequence algorithms. In: Proceedings of the Seventh International Symposium on String Processing Information Retrieval (SPIRE 2000), pp. 39-48 (2000)
2. H.-G. Beyer H.-P. Schwefel I. Wegener 2002 How to analyze evolutionary algorithms Theor. Comput. Sci. 287 1 101 130 1061.90119 10.1016/S0304-3975(02) 00137-8 1934040 (Pubitemid 35019162)
3. Briest, P., Brockhoff, D., Degener, B., Englert, M., Gunia, C., Heering, O., Jansen, T., Leifhelm, M., Plociennik, K., Röglin, H., Schweer, A., Sudholt, D., Tannenbaum, S., Wegener, I.: 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), pp. 21-30 (2004)
4. Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms. MIT Press, Cambridge (2001)
5. DeJong, K.: Evolutionary Computation: A Unified Approach. MIT Press, Cambridge (2006)
6. Giel, O., Wegener, I.: Maximum cardinality matchings on trees by randomized local search. In: Proceedings of the 8th Annual Genetic and Evolutionary Computation Conference (GECCO 2006), pp. 539-546 (2006)
7. T. Hagerup C. Rüb 1990 A guided tour of Chernoff bounds Inf. Process. Lett. 33 6 305 308 0702.60021 10.1016/0020-0190(90)90214-I (Pubitemid 20660206)
8. Hinkemeyer, B., Julstrom, B.A.: A genetic algorithm for the longest common subsequence problem. In: Proceedings of the 8th Annual Genetic and Evolutionary Computation Conference (GECCO 2006), pp. 609-610 (2006)
9. Jansen, T., Wegener, I.: On the choice of the mutation probability for the (1+1) EA. In: Proceedings of the 6th International Conference on Parallel Problem Solving From Nature (PPSN VI), pp. 89-98 (2000)
10. Jansen, T., Wiegand, R.P.: Bridging the gap between theory and practice. In: Proceedings of the 8th International Conference on Parallel Problem Solving From Nature (PPSN VIII), pp. 61-71 (2004)
11. Julstrom, B.A., Hinkemeyer, B.: Starting from scratch: Growing longest common subsequences with evolution. In: Proceedings of the 9th International Conference on Parallel Problem Solving From Nature (PPSN IX), pp. 930-938 (2006)
12. Motwani, R., Raghavan, P.: Randomized Algorithms. Cambridge University Press, Cambridge (1995)
13. Mühlenbein, H.: How evolutionary algorithms really work: Mutation and hillclimbing. In: Proceedings of the 2nd International Conference on Parallel Problem Solving from Nature (PPSN II), pp. 15-26 (1992)
14. F. Neumann 2008 Expected runtimes of evolutionary algorithms for the Eulerian cycle problem Comput. Oper. Res. 35 9 2750 2759 1144.90502 10.1016/j.cor.2006.12.009 (Pubitemid 351193082)
15. F. Neumann I. Wegener 2006 Minimum spanning trees made easier via multi-objective optimization Nat. Comput. 5 3 305 319 1173.90535 10.1007/s11047-006-9004-x 2265483 (Pubitemid 44304903)
16. J. Scharnow K. Tinnefeld I. Wegener 2004 The analysis of evolutionary algorithms on sorting and shortest paths problems J. Math. Model. Algorithms 3 349 366 1073.68080 10.1023/B:JMMA.0000049379.14872.f5 2231455
17. Storch, T.: How randomized search heuristics find maximum cliques in planar graphs. In: Proceedings of the 8th AnnualGenetic and Evolutionary Computation Conference (GECCO 2006), pp. 567-574 (2006)