Finding common RNA pseudoknot structures in polynomial time (Q655437): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
(3 intermediate revisions by 3 users not shown) | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/j.jda.2011.04.002 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W1982134706 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: An Optimal Decomposition Algorithm for Tree Edit Distance / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3024816 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the computational complexity of 2-interval pattern matching problems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3024817 / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 19:59, 4 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Finding common RNA pseudoknot structures in polynomial time |
scientific article |
Statements
Finding common RNA pseudoknot structures in polynomial time (English)
0 references
4 January 2012
0 references
structure comparison
0 references
dynamic programming
0 references