Finding common RNA pseudoknot structures in polynomial time

DOI10.1016/J.JDA.2011.04.002zbMATH Open1228.92024OpenAlexW1982134706MaRDI QIDQ655437FDOQ655437

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

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

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)

Cites Work

• Title not available (Why is that?)
• An Optimal Decomposition Algorithm for Tree Edit Distance
• Title not available (Why is that?)
• 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)