Analysis of evolutionary algorithms for the longest common subsequence problem (Q848642)
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: Analysis of evolutionary algorithms for the longest common subsequence problem |
scientific article; zbMATH DE number 5677432
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Analysis of evolutionary algorithms for the longest common subsequence problem |
scientific article; zbMATH DE number 5677432 |
Statements
Analysis of evolutionary algorithms for the longest common subsequence problem (English)
0 references
4 March 2010
0 references
Evolutionary algorithms
0 references
Longest common subsequence problem
0 references
Run time analysis
0 references
Crossover
0 references
0.88557625
0 references
0.86849916
0 references
0.86722547
0 references
0.8603516
0 references
0.85963297
0 references
0.8545641
0 references
0.85253596
0 references
