Analysis of evolutionary algorithms for the longest common subsequence problem

DOI10.1007/S00453-008-9243-6MaRDI QIDQ848642zbMATH OpenOpenAlexFDO

Authors Thomas Jansen, Dennis Weyland

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

CrossoverRun time analysisEvolutionary algorithmsLongest common subsequence problem

Mathematics Subject Classification ID

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

Recommendations

• A hybrid genetic algorithm for the repetition free longest common subsequence problem
• The analysis of evolutionary algorithms on sorting and shortest paths problems
• Analysis of evolutionary algorithms: from computational complexity analysis to algorithm engineering
• Evolutionary optimization of low-discrepancy sequences
• Algorithmic analysis of a basic evolutionary algorithm for continuous optimization
• Performance analysis of some simple heuristics for computing longest common subsequences
• Algorithms for Computing Variants of the Longest Common Subsequence Problem
• Finding the longest common subsequence for multiple biological sequences by ant colony optimization

Cites work

• scientific article; zbMATH DE number 819814 (Why is no real title available?)
• A guided tour of Chernoff bounds
• Expected runtimes of evolutionary algorithms for the Eulerian cycle problem
• How to analyse evolutionary algorithms.
• Introduction to algorithms
• Minimum spanning trees made easier via multi-objective optimization
• The analysis of evolutionary algorithms on sorting and shortest paths problems

Cited in

(1)

• A hyper-heuristic for the longest common subsequence problem

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q848642)