The longest common subsequence problem for sequences with nested arc annotations. (Q1872715): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/s0022-0000(02)00004-1 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2067194564 / rank | |||
Normal rank | |||
Latest revision as of 08:21, 30 July 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
0 references
