首页> 外文OA文献 >SARNA-predict: A permutation-based simulated annealing algorithm for RNA secondary structure prediction
【2h】

SARNA-predict: A permutation-based simulated annealing algorithm for RNA secondary structure prediction

机译:SARNA预测:用于RNA二级结构预测的基于置换的模拟退火算法

摘要

This dissertation describes and presents SARNA-Predict, a novel algorithm for Ribonucleic Acid (RNA) secondary structure prediction based on Simulated Annealing (SA). SA is known to be effective in solving many different types of minimization problems and for finding the global minimum in the solution space. Based on free energy minimization techniques, SARNA-Predict heuristically searches for the structure with a free energy close to the minimum free energy G for a strand of RNA, within given constraints. Furthermore, SARNA-Predict has also been extended to predict RNA secondary structures with pseudoknots. Although dynamic programming algorithms are guaranteed to give the minimum free energy structure, the lowest free energy structure is not always the correct native structure. This is mostly due to the imperfections in the currently available thermodynamic models. Since SARNA-Predict can incorporate different thermodynamic models (INN-HB, efn2 and HotKnots) during the free energy evaluation, this feature makes SARNA-Predict superior to other algorithms such as mfold. mfold can only predict pseudoknots-free structures and cannot readily be extended to use other thermodynamic models. SARNA-Predict encodes RNA secondary structures as a permutation of helices that are pre-computed. A novel swap mutation operator and differentannealing schedules were incorporated into this original algorithm for RNA Secondary Structure Prediction. An evaluation of the performance of the new algorithm in terms of prediction accuracy is made via comparison with several state-of-the-art prediction algorithms. We measured the sensitivity and specificity using nine prediction algorithms. Four of these are dynamic programming algorithms: mfold, Pseudoknot (pknotsRE), NUPACK, and pknotsRG-mfe. The other five are heuristic algorithms: P-RnaPredict, SARNA-Predict, HotKnots, ILM, and STAR algorithms. An evaluation for the performance of the new algorithm in terms of prediction accuracy was verified with native structures. Experiments on thirty three individual known structures from eleven RNA classes (tRNA, viral RNA, anti-genomic HDV, telomerase RNA, tmRNA, rRNA, RNaseP, 5S rRNA, Group I intron 23S rRNA, Group I intron 16S rRNA, and 16S rRNA) were performed. The results presented in this dissertation demonstrate that SARNA-Predict can out-perform other state-of-the-art algorithms in terms of prediction accuracy.
机译:本文介绍并提出了一种基于模拟退火(SA)的核糖核酸(RNA)二级结构预测新算法SARNA-Predict。众所周知,SA在解决许多不同类型的最小化问题以及在解决方案空间中找到全局最小值方面非常有效。基于自由能最小化技术,SARNA-Predict会在给定的约束下,以接近于一链RNA的最小自由能G的自由能,试探性地搜索结构。此外,SARNA-Predict也已扩展到可预测带有假结的RNA二级结构。尽管保证动态编程算法可以提供最小的自由能结构,但是最低的自由能结构并不总是正确的本机结构。这主要是由于当前可用的热力学模型中的缺陷。由于SARNA-Predict在自由能评估过程中可以合并不同的热力学模型(INN-HB,efn2和HotKnots),因此此功能使SARNA-Predict优于其他算法,例如mfold。 mfold只能预测无假结的结构,不能轻易扩展以使用其他热力学模型。 SARNA-Predict将RNA二级结构编码为预先计算的螺旋序列。一种新颖的交换突变算子和不同的退火时间表已被纳入该原始算法的RNA二级结构预测中。通过与几种最新的预测算法进行比较,对新算法的性能进行了预测精度评估。我们使用九种预测算法测量了敏感性和特异性。其中四个是动态编程算法:mfold,伪结(pknotsRE),NUPACK和pknotsRG-mfe。其他五种是启发式算法:P-RnaPredict,SARNA-Predict,HotKnots,ILM和STAR算法。用本机结构验证了对新算法性能的预测精度评估。对11种RNA类(tRNA,病毒RNA,抗基因组HDV,端粒酶RNA,tmRNA,rRNA,RNaseP,5S rRNA,I组内含子23S rRNA,I组内含子16S rRNA和16S rRNA)的33种已知结构进行了实验被执行。论文的结果表明,SARNA-Predict在预测准确度方面可以优于其他最新算法。

著录项

  • 作者

    Tsang Herbert Ho Pan;

  • 作者单位
  • 年度 2007
  • 总页数
  • 原文格式 PDF
  • 正文语种 English
  • 中图分类

相似文献

  • 外文文献
  • 中文文献
  • 专利

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号