Finding common RNA pseudoknot structures in polynomial time

DOI10.1016/J.JDA.2011.04.002zbMath1228.92024OpenAlexW1982134706MaRDI QIDQ655437

Patricia A. Evans

Publication date: 4 January 2012

Published in: Journal of Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jda.2011.04.002

zbMATH Keywords

dynamic programmingstructure comparison

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Dynamic programming (90C39) Biochemistry, molecular biology (92C40) Computational methods for problems pertaining to biology (92-08) Algorithms on strings (68W32)

Related Items (3)

Psybrackets, pseudoknots and singular knots ⋮ Pseudoknot-generating operation ⋮ Psyquandle coloring quivers

Cites Work

• Unnamed Item
• Unnamed Item
• On the computational complexity of 2-interval pattern matching problems
• An Optimal Decomposition Algorithm for Tree Edit Distance

This page was built for publication: Finding common RNA pseudoknot structures in polynomial time