On the computational complexity of 2-interval pattern matching problems (Q1884946): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.tcs.2003.08.010 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2043274817 / rank | |||
Normal rank | |||
Revision as of 02:40, 20 March 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
