title: A statistical sampling algorithm for RNA secondary structure prediction.
abstract: An RNA molecule, particularly a long-chain mRNA, may exist as a population of structures. Further more, multiple structures have been demonstrated to play important functional roles. Thus, a representation of the ensemble of probable structures is of interest. We present a statistical algorithm to sample rigorously and exactly from the Boltzmann ensemble of secondary structures. The forward step of the algorithm computes the equilibrium partition functions of RNA secondary structures with recent thermodynamic parameters. Using conditional probabilities computed with the partition functions in a recursive sampling process, the backward step of the algorithm quickly generates a statistically representative sample of structures. With cubic run time for the forward step, quadratic run time in the worst case for the sampling step, and quadratic storage, the algorithm is efficient for broad applicability. We demonstrate that, by classifying sampled structures, the algorithm enables a statistical delineation and representation of the Boltzmann ensemble. Applications of the algorithm show that alternative biological structures are revealed through sampling. Statistical sampling provides a means to estimate the probability of any structural motif, with or without constraints. For example, the algorithm enables probability profiling of single-stranded regions in RNA secondary structure. Probability profiling for specific loop types is also illustrated. By overlaying probability profiles, a mutual accessibility plot can be displayed for predicting RNA:RNA interactions. Boltzmann probability-weighted density of states and free energy distributions of sampled structures can be readily computed. We show that a sample of moderate size from the ensemble of an enormous number of possible structures is sufficient to guarantee statistical reproducibility in the estimates of typical sampling statistics. Our applications suggest that the sampling algorithm may be well suited to prediction of mRNA structure and target accessibility. The algorithm is applicable to the rational design of small interfering RNAs (siRNAs), antisense oligonucleotides, and trans-cleaving ribozymes in gene knock-down studies.
authors.affiliation: Bioinformatics Center, Wadsworth Center, New York State Department of Health, 150 New Scotland Avenue, Albany, NY 12208, USA. yding@wadsworth.org
authors.forename: Ye
authors.initials: Y
authors.lastname: Ding
authors.forename: Charles E
authors.initials: CE
authors.lastname: Lawrence
mesh_terms: D000465:Algorithms; D001483:Base Sequence; D019295:Computational Biology / Q000379:methods*; D015195:Drug Design; D008969:Molecular Sequence Data; D009690:Nucleic Acid Conformation; D011336:Probability; D012313:RNA / Q000737:chemistry* / Q000235:genetics; D020871:RNA Stability; D016053:RNA, Protozoan / Q000737:chemistry / Q000235:genetics; D020038:RNA, Spliced Leader / Q000737:chemistry / Q000235:genetics; D016008:Statistical Distributions; D013816:Thermodynamics
chemical_list: D016053:RNA, Protozoan; D020038:RNA, Spliced Leader; D012313:RNA