The longest common subsequence problem for sequences with nested arc annotations. (Q1872715)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: The longest common subsequence problem for sequences with nested arc annotations. |
scientific article; zbMATH DE number 1910844
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The longest common subsequence problem for sequences with nested arc annotations. |
scientific article; zbMATH DE number 1910844 |
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
0.97273725
0 references
0.97273725
0 references
0.91130364
0 references
0.8900913
0 references
0.8812612
0 references
