An FPT-algorithm for longest common subsequence parameterized by the maximum number of deletions (Q6496832)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7842467
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An FPT-algorithm for longest common subsequence parameterized by the maximum number of deletions |
scientific article; zbMATH DE number 7842467 |
Statements
An FPT-algorithm for longest common subsequence parameterized by the maximum number of deletions (English)
0 references
6 May 2024
0 references
NP-hard string problems
0 references
multiple sequence alignment
0 references
center string
0 references
parameterized complexity
0 references
search tree algorithms
0 references
enumerative algorithms
0 references
