Finding common RNA pseudoknot structures in polynomial time

DOI10.1016/J.JDA.2011.04.002MaRDI QIDQ655437zbMATH OpenOpenAlexFDO

Authors 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

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

Recommendations

• Finding Common RNA Pseudoknot Structures in Polynomial Time
• Dynamic programming algorithms for RNA secondary structure prediction with pseudoknots
• Computing and Combinatorics
• Rapid ab initio prediction of RNA pseudoknots via graph tree decomposition
• A genetic algorithm for predicting RNA pseudoknot structures

Cites work

• scientific article; zbMATH DE number 2185647 (Why is no real title available?)
• scientific article; zbMATH DE number 2185648 (Why is no real title available?)
• An Optimal Decomposition Algorithm for Tree Edit Distance
• On the computational complexity of 2-interval pattern matching problems

Cited in

(3)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q655437)