On the computational complexity of 2-interval pattern matching problems (Q1884946): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Changed an Item |
||
Property / describes a project that uses | |||
Property / describes a project that uses: Palingol / rank | |||
Normal rank |
Revision as of 12:49, 29 February 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | On the computational complexity of 2-interval pattern matching problems |
scientific article |
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