首页> 美国卫生研究院文献>Genes >RNA Secondary Structures with Limited Base Pair Span: Exact Backtracking and an Application
【2h】

RNA Secondary Structures with Limited Base Pair Span: Exact Backtracking and an Application

机译:RNA二次结构具有有限的基对跨度:精确的返回和应用程序

代理获取
本网站仅为用户提供外文OA文献查询和代理获取服务,本网站没有原文。下单后我们将采用程序或人工为您竭诚获取高质量的原文,但由于OA文献来源多样且变更频繁,仍可能出现获取不到、文献不完整或与标题不符等情况,如果获取不到我们将提供退款服务。请知悉。

摘要

The accuracy of RNA secondary structure prediction decreases with the span of a base pair, i.e., the number of nucleotides that it encloses. The dynamic programming algorithms for RNA folding can be easily specialized in order to consider only base pairs with a limited span L, reducing the memory requirements to O(nL), and further to O(n) by interleaving backtracking. However, the latter is an approximation that precludes the retrieval of the globally optimal structure. So far, the ViennaRNA package therefore does not provide a tool for computing optimal, span-restricted minimum energy structure. Here, we report on an efficient backtracking algorithm that reconstructs the globally optimal structure from the locally optimal fragments that are produced by the interleaved backtracking implemented in RNALfold. An implementation is integrated into the ViennaRNA package. The forward and the backtracking recursions of RNALfold are both easily constrained to structural components with a sufficiently negative z-scores. This provides a convenient method in order to identify hyper-stable structural elements. A screen of the C. elegans genome shows that such features are more abundant in real genomic sequences when compared to a di-nucleotide shuffled background model.
机译:RNA二级结构预测的准确性随碱基对的跨度降低,即其包围的核苷酸的数量。可以容易地专门用于RNA折叠的动态规划算法,以便仅考虑具有有限跨度L的基对对,通过交织反向特继来将存储器要求降低到O(NL),以及进一步到O(n)。然而,后者是阻止全局最佳结构的检索的近似值。到目前为止,Viennarna包因此不提供用于计算最佳,跨度限制的最小能量结构的工具。这里,我们报告了一种高效的回溯算法,该算法从局部最佳碎片重建全局最佳结构,这些碎片由在rnalfold中实现的交错的回溯产生。实现集成到Viennarna包中。 RNALFOLD的前进和回溯递归既容易被限制为具有足够负Z分数的结构部件。这提供了一种方便的方法,以识别超稳定的结构元件。与二核苷酸混洗背景模型相比,C.杆状杆菌基因组的筛魂表明,这些特征在实际基因组序列中更丰富。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
代理获取

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号