A hybrid genetic algorithm for the repetition free longest common subsequence problem (Q2450749): Difference between revisions
From MaRDI portal
Latest revision as of 12:15, 8 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A hybrid genetic algorithm for the repetition free longest common subsequence problem |
scientific article |
Statements
A hybrid genetic algorithm for the repetition free longest common subsequence problem (English)
0 references
15 May 2014
0 references
repetition free longest common subsequence
0 references
heuristics
0 references
genetic algorithms
0 references
estimation of distribution algorithms
0 references
0 references