Parameterized complexity and approximability of the longest compatible sequence problem (Q456697): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.disopt.2010.08.003 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2027343828 / rank | |||
Normal rank | |||
Revision as of 00:25, 20 March 2024
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
