A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is
Pseudoknotted secondary structure prediction of nucleic acid molecules is an important problem in computational molecular biology. In this thesis, we introduce a Pseudoknot-Add algorithm for the problem of Predicting Pseudoknot Additions. In this problem, one is given as input a sequence S and pseudoknot free structure G, and the goal is to find the minimum free energy pseudoknotted structure R for S, that contains G. The Pseudoknot-Add algorithm has an overall time complexity of 0(n3), and adoi:10.14288/1.0051636 fatcat:x2ydmptl4ze4djtflgtbl7m5v4