Polynomial-time approximation algorithms for weighted LCS problem (Q266804)
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: Polynomial-time approximation algorithms for weighted LCS problem |
scientific article; zbMATH DE number 6566285
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Polynomial-time approximation algorithms for weighted LCS problem |
scientific article; zbMATH DE number 6566285 |
Statements
Polynomial-time approximation algorithms for weighted LCS problem (English)
0 references
7 April 2016
0 references
longest common subsequence
0 references
weighted sequence
0 references
polynomial-time approximation scheme
0 references
0 references
0.9969173669815063
0 references
0.8987905383110046
0 references
0.8107786774635315
0 references
0.7961305975914001
0 references
