The longest common subsequence problem for sequences with nested arc annotations. (Q1872715): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 11:46, 1 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The longest common subsequence problem for sequences with nested arc annotations. |
scientific article |
Statements
The longest common subsequence problem for sequences with nested arc annotations. (English)
0 references
14 May 2003
0 references
Sequence annotation
0 references
Longest common subsequence
0 references
Book embedding
0 references
NP-hardness
0 references
Approximation algorithm
0 references
Polynomial-time approximation scheme
0 references
