skip to main content
10.1145/1276958.1277148acmconferencesArticle/Chapter ViewAbstractPublication PagesgeccoConference Proceedingsconference-collections
Article

Analysis of evolutionary algorithms for the longest common subsequence problem

Published: 07 July 2007 Publication History

Abstract

In the longest common subsequence problem the task is to find the longest sequence of letters that can be found as subsequence in all members of a given finite set of sequences. The problem is one of the fundamental problems in computer science with the task of finding a given pattern in a text as an important special case. It has applications in bioinformatics, problem-specific algorithms and facts about its complexity are known. Motivated by reports about good performance of evolutionary algorithms for some instances of this problem a theoretical analysis of a generic evolutionary algorithm is performed. The general algorithmic framework encompasses EAs as different as steady state GAs with uniform crossover and randomized hill-climbers. For all these algorithms it is proved that even rather simple special cases of the longest common subsequence problem can neither be solved to optimality nor approximately solved up to an approximation factor arbitrarily close to 2.

References

[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.

Cited By

View all
  • (2019)Chemical reaction optimization for solving longest common subsequence problem for multiple stringSoft Computing - A Fusion of Foundations, Methodologies and Applications10.1007/s00500-018-3200-323:14(5485-5509)Online publication date: 1-Jul-2019
  • (2013)Using statistical tools to determine the significance and relative importance of the main parameters of an evolutionary algorithmIntelligent Data Analysis10.5555/2595588.259559217:5(771-789)Online publication date: 1-Sep-2013
  • (2012)Determining the significance and relative importance of parameters of a simulated quenching algorithm using statistical toolsApplied Intelligence10.1007/s10489-011-0324-x37:2(239-254)Online publication date: 1-Sep-2012
  • Show More Cited By

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences
GECCO '07: Proceedings of the 9th annual conference on Genetic and evolutionary computation
July 2007
2313 pages
ISBN:9781595936974
DOI:10.1145/1276958
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 07 July 2007

Permissions

Request permissions for this article.

Check for updates

Author Tags

  1. crossover
  2. longest common subsequence problem
  3. run time analysis

Qualifiers

  • Article

Conference

GECCO07
Sponsor:

Acceptance Rates

GECCO '07 Paper Acceptance Rate 266 of 577 submissions, 46%;
Overall Acceptance Rate 1,669 of 4,410 submissions, 38%

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)2
  • Downloads (Last 6 weeks)1
Reflects downloads up to 16 Feb 2025

Other Metrics

Citations

Cited By

View all
  • (2019)Chemical reaction optimization for solving longest common subsequence problem for multiple stringSoft Computing - A Fusion of Foundations, Methodologies and Applications10.1007/s00500-018-3200-323:14(5485-5509)Online publication date: 1-Jul-2019
  • (2013)Using statistical tools to determine the significance and relative importance of the main parameters of an evolutionary algorithmIntelligent Data Analysis10.5555/2595588.259559217:5(771-789)Online publication date: 1-Sep-2013
  • (2012)Determining the significance and relative importance of parameters of a simulated quenching algorithm using statistical toolsApplied Intelligence10.1007/s10489-011-0324-x37:2(239-254)Online publication date: 1-Sep-2012
  • (2011)Mining unstructured log files for recurrent fault diagnosis12th IFIP/IEEE International Symposium on Integrated Network Management (IM 2011) and Workshops10.1109/INM.2011.5990536(377-384)Online publication date: May-2011
  • (2010)Statistical analysis of parameter setting in real-coded evolutionary algorithmsProceedings of the 11th international conference on Parallel problem solving from nature: Part II10.5555/1887255.1887305(452-461)Online publication date: 11-Sep-2010
  • (2010)Computational complexity and evolutionary computationProceedings of the 12th annual conference companion on Genetic and evolutionary computation10.1145/1830761.1830914(2683-2710)Online publication date: 7-Jul-2010
  • (2010)Statistical analysis of the parameters of the simulated annealing algorithmIEEE Congress on Evolutionary Computation10.1109/CEC.2010.5586160(1-8)Online publication date: Jul-2010
  • (2010)Statistical Analysis of Parameter Setting in Real-Coded Evolutionary AlgorithmsParallel Problem Solving from Nature, PPSN XI10.1007/978-3-642-15871-1_46(452-461)Online publication date: 2010
  • (2009)Computational complexity and evolutionary computationProceedings of the 11th Annual Conference Companion on Genetic and Evolutionary Computation Conference: Late Breaking Papers10.1145/1570256.1570416(3157-3184)Online publication date: 8-Jul-2009
  • (2008)Simulated annealing, its parameter settings and the longest common subsequence problemProceedings of the 10th annual conference on Genetic and evolutionary computation10.1145/1389095.1389253(803-810)Online publication date: 13-Jul-2008
  • Show More Cited By

View Options

Login options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Figures

Tables

Media

Share

Share

Share this Publication link

Share on social media