What Makes the Arc-Preserving Subsequence Problem Hard? (Q5449952): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W4214861388 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 01:19, 20 March 2024
scientific article; zbMATH DE number 5250841
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | What Makes the Arc-Preserving Subsequence Problem Hard? |
scientific article; zbMATH DE number 5250841 |
Statements
What Makes the Arc-Preserving Subsequence Problem Hard? (English)
0 references
19 March 2008
0 references
RNA structures
0 references
Arc-Preserving Subsequence problem
0 references
Computational complexity
0 references
