A large neighborhood search heuristic for the longest common subsequence problem (Q953288): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: ClustalW / rank | |||
Normal rank | |||
Revision as of 19:49, 29 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A large neighborhood search heuristic for the longest common subsequence problem |
scientific article |
Statements
A large neighborhood search heuristic for the longest common subsequence problem (English)
0 references
17 November 2008
0 references
longest common subsequence
0 references
dynamic programming
0 references
large neighborhood search
0 references
heuristic
0 references
