Prediction of secondary structures in nucleic acids requires both an adequate physical model and powerful calculation algorithms. In our approach, we cut the molecules in sections of which the contributions to the global energy are context-dependent but roughly additive. The structure of minimum energy is obtained by a tree search under constraints of binary incompatibilities. Our algorithm of the "incompatibility islets" is shown to be more powerful than the "bit parallel forward checking" algorithm, well known in Artificial Intelligence. Recurrent algorithms, proposed by other authors are even more rapid, but often miss the correct structures, for they demand a strict additivity of the energetic contributions, physically unjustified. New strategies, required to deal with molecules of more than 200 nucleotides are discussed. Our physical model has been improved by considering the special case of internal loops beginning with a G-A opposition. A bonus of 1.5 kcal. is attributed to such a feature, at each side of an internal loop. To illustrate our programs, we give the computed schemes for the 3' termini of the small subunit ribosomal RNA.
Download full-text PDF |
Source |
---|---|
http://dx.doi.org/10.1016/s0300-9084(85)80272-8 | DOI Listing |
Enter search terms and have AI summaries delivered each week - change queries or unsubscribe any time!