Parameterized complexity and approximability of the longest compatible sequence problem (Q456697): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 90C27 / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 90C60 / rank | |||
Normal rank | |||
| Property / zbMATH DE Number | |||
| Property / zbMATH DE Number: 6094032 / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
parameterized complexity | |||
| Property / zbMATH Keywords: parameterized complexity / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
sequence comparison | |||
| Property / zbMATH Keywords: sequence comparison / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
longest common subsequence | |||
| Property / zbMATH Keywords: longest common subsequence / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
longest compatible sequence | |||
| Property / zbMATH Keywords: longest compatible sequence / rank | |||
Normal rank | |||
Revision as of 12:47, 30 June 2023
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Parameterized complexity and approximability of the longest compatible sequence problem |
scientific article |
Statements
Parameterized complexity and approximability of the longest compatible sequence problem (English)
0 references
16 October 2012
0 references
parameterized complexity
0 references
sequence comparison
0 references
longest common subsequence
0 references
longest compatible sequence
0 references
