Parameterized tractability of the maximum-duo preservation string mapping problem (Q306271)
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: Parameterized tractability of the maximum-duo preservation string mapping problem |
scientific article; zbMATH DE number 6620946
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Parameterized tractability of the maximum-duo preservation string mapping problem |
scientific article; zbMATH DE number 6620946 |
Statements
Parameterized tractability of the maximum-duo preservation string mapping problem (English)
0 references
31 August 2016
0 references
computational biology
0 references
common string partition
0 references
parameterized algorithms
0 references
kernelization
0 references
0 references
0 references
0.899732768535614
0 references
0.8983490467071533
0 references
0.8312811851501465
0 references
0.8267268538475037
0 references
0.8145236968994141
0 references
