Parameterized complexity analysis for the closest string with wildcards problem (Q495996)
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 complexity analysis for the closest string with wildcards problem |
scientific article; zbMATH DE number 6482878
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Parameterized complexity analysis for the closest string with wildcards problem |
scientific article; zbMATH DE number 6482878 |
Statements
Parameterized complexity analysis for the closest string with wildcards problem (English)
0 references
16 September 2015
0 references
parameterized complexity
0 references
closest string problem
0 references
fixed-parameter algorithms
0 references
computational biology
0 references
0 references
0 references
0.970719277858734
0 references
0.8337310552597046
0 references
0.8265369534492493
0 references
0.7872267961502075
0 references
