A hybrid genetic algorithm for the repetition free longest common subsequence problem (Q2450749)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A hybrid genetic algorithm for the repetition free longest common subsequence problem |
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
