On the computational complexity of 2-interval pattern matching problems (Q1884946)
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: On the computational complexity of 2-interval pattern matching problems |
scientific article; zbMATH DE number 2111034
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the computational complexity of 2-interval pattern matching problems |
scientific article; zbMATH DE number 2111034 |
Statements
On the computational complexity of 2-interval pattern matching problems (English)
0 references
27 October 2004
0 references
RNA secondary structure
0 references
2-Interval
0 references
Pattern matching
0 references
NP-completeness
0 references
0.9303274
0 references
0.91295433
0 references
0.9042032
0 references
0.9006707
0 references
0.8864134
0 references
