Parameterized complexity analysis for the closest string with wildcards problem (Q495996): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 68Q25 / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 68W32 / rank | |||
Normal rank | |||
| Property / zbMATH DE Number | |||
| Property / zbMATH DE Number: 6482878 / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
parameterized complexity | |||
| Property / zbMATH Keywords: parameterized complexity / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
closest string problem | |||
| Property / zbMATH Keywords: closest string problem / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
fixed-parameter algorithms | |||
| Property / zbMATH Keywords: fixed-parameter algorithms / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
computational biology | |||
| Property / zbMATH Keywords: computational biology / rank | |||
Normal rank | |||
Revision as of 23:03, 30 June 2023
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Parameterized complexity analysis for the closest string with wildcards problem |
scientific article |
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
