Analysis of evolutionary algorithms for the longest common subsequence problem

DOI10.1007/s00453-008-9243-6zbMath1184.68604OpenAlexW2086513060MaRDI QIDQ848642

Dennis Weyland, Thomas Jansen

Publication date: 4 March 2010

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00453-008-9243-6

zbMATH Keywords

CrossoverEvolutionary algorithmsRun time analysisLongest common subsequence problem

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Learning and adaptive systems in artificial intelligence (68T05)

Cites Work

• Unnamed Item
• Unnamed Item
• Minimum spanning trees made easier via multi-objective optimization
• A guided tour of Chernoff bounds
• The analysis of evolutionary algorithms on sorting and shortest paths problems
• How to analyse evolutionary algorithms.
• Expected runtimes of evolutionary algorithms for the Eulerian cycle problem

This page was built for publication: Analysis of evolutionary algorithms for the longest common subsequence problem