Welcome to the new version of CaltechAUTHORS. Login is currently restricted to library staff. If you notice any issues, please email coda@library.caltech.edu
Published June 14, 2009 | Published
Journal Article Open

An O(n^5) algorithm for MFE prediction of kissing hairpins and 4-chains in nucleic acids

Abstract

Efficient methods for prediction of minimum free energy (MFE) nucleic secondary structures are widely used, both to better understand structure and function of biological RNAs and to design novel nano-structures. Here, we present a new algorithm for MFE secondary structure prediction, which significantly expands the class of structures that can be handled in O(n^5) time. Our algorithm can handle H-type pseudoknotted structures, kissing hairpins, and chains of four overlapping stems, as well as nested substructures of these types.

Additional Information

© 2009 Mary Ann Liebert, Inc. Published in Volume: 16 Issue 6: June 14, 2009. We thank Mirela Andronescu for her input on features of pseudoknotted structures in the RNA STRAND database and Takachi Yokomori for explanations of the structures that can be handled by the algorithm of Uemura et al (1999).

Attached Files

Published - Chen2009p4709J_Comput_Biol.pdf

Files

Chen2009p4709J_Comput_Biol.pdf
Files (4.9 MB)
Name Size Download all
md5:5dd48edf298e95bce16b8810dd4ecd64
4.9 MB Preview Download

Additional details

Created:
August 21, 2023
Modified:
October 18, 2023