The longest common subsequence problem for arc-annotated sequences (Q876717)
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 arc-annotated sequences |
scientific article; zbMATH DE number 5147095
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The longest common subsequence problem for arc-annotated sequences |
scientific article; zbMATH DE number 5147095 |
Statements
The longest common subsequence problem for arc-annotated sequences (English)
0 references
26 April 2007
0 references
RNA structural similarity comparison
0 references
sequence annotation
0 references
longest common subsequence
0 references
maximum independent set
0 references
Max SNP-hard
0 references
approximation algorithm
0 references
dynamic programming
0 references
0.9548739194869996
0 references
0.9452440142631532
0 references
0.931050181388855
0 references
