𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A partition function algorithm for nucleic acid secondary structure including pseudoknots

✍ Scribed by Robert M. Dirks; Niles A. Pierce


Book ID
102301719
Publisher
John Wiley and Sons
Year
2003
Tongue
English
Weight
471 KB
Volume
24
Category
Article
ISSN
0192-8651

No coin nor oath required. For personal study only.

✦ Synopsis


Abstract

Nucleic acid secondary structure models usually exclude pseudoknots due to the difficulty of treating these nonnested structures efficiently in structure prediction and partition function algorithms. Here, the standard secondary structure energy model is extended to include the most physically relevant pseudoknots. We describe an O(N^5^) dynamic programming algorithm, where N is the length of the strand, for computing the partition function and minimum energy structure over this class of secondary structures. Hence, it is possible to determine the probability of sampling the lowest energy structure, or any other structure of particular interest. This capability motivates the use of the partition function for the design of DNA or RNA molecules for bioengineering applications. Β© 2003 Wiley Periodicals, Inc. J Comput Chem 24: 1664–1677, 2003


πŸ“œ SIMILAR VOLUMES


An algorithm for computing nucleic acid
✍ Robert M. Dirks; Niles A. Pierce πŸ“‚ Article πŸ“… 2004 πŸ› John Wiley and Sons 🌐 English βš– 270 KB

## Abstract Given a nucleic acid sequence, a recent algorithm allows the calculation of the partition function over secondary structure space including a class of physically relevant pseudoknots. Here, we present a method for computing base‐pairing probabilities starting from the output of this par

A parallel algorithm for estimating the
✍ Y. Takefuji; C. W. Lin; K. C. Lee πŸ“‚ Article πŸ“… 1990 πŸ› Springer-Verlag 🌐 English βš– 292 KB

A parallel algorithm for estimating the secondary structure of an RNA molecule is presented in this paper. The mathematical problem to compute an optimal folding based on free-energy minimization is mapped onto a graph planarization problem. In the planarization problem we want to maximize the numbe

A Physical Origin for Functional Domain
✍ WAYNE DAWSON; KAZUO SUZUKI; KENJI YAMAMOTO πŸ“‚ Article πŸ“… 2001 πŸ› Elsevier Science 🌐 English βš– 708 KB

A global strategy for estimating the entropy of long sequences of RNA is proposed to help improve the predictive capacity of RNA secondary structure dynamic programming algorithm (DPA) free energy (FE) minimization methods. These DPA strategies only consider the e!ects that occur in the immediate (n

A Physical Origin for Functional Domain
✍ WAYNE DAWSON; KAZUO SUZUKI; KENJI YAMAMOTO πŸ“‚ Article πŸ“… 2001 πŸ› Elsevier Science 🌐 English βš– 648 KB

In Part I, cross-linking entropy (CLE) was proposed as a mechanism that limits the size of functional domains of RNA. To test this hypothesis, the theory is developed into an RNA secondary structure prediction "lter which is applied to nearest-neighbor secondary structure (NNSS) algorithms that util