【24h】

An Agent-Oriented Simulation of RNA Folding and its Application to the Analysis of RNA Conformational Spaces

机译:面向Agent的RNA折叠模拟及其在RNA构象空间分析中的应用

获取原文
获取原文并翻译 | 示例

摘要

We present a stochastic agent-oriented simulation of ribonucleic acid (RNA) folding that enables the analysis of RNA conformational spaces. The simulation implements a heuristic algorithm that models the folding of RNA as the sequential selection of helices for incorporation into a nascent RNA conformation. The algorithm introduces a number of modifications to similar heuristic algorithms, including an "opportunity cost" function that takes into account the ensemble of helices that become incompatible with the nascent conformation due to the selection of a given helix, and a "direction" constraint that drastically reduces the number of selection steps involved in the assembly of new RNA conformations. Each new conformation is assembled in fewer than n selection steps, where n is the length of the folded sequence. This represents a significant improvement over a similar algorithm that performs an average of 5N selection steps, where N, the number of helices, is known to increase quadratically with the length of the folded sequence. Another important feature of the simulation that is implicit in its agent-oriented implementation is its ability to concurrently generate large numbers of probable or suboptimal conformations of a given RNA sequence.
机译:我们提出了一种随机导向的核糖核酸(RNA)折叠定向模拟,它能够分析RNA构象空间。该模拟实现了一种启发式算法,该算法将RNA折叠建模为螺旋的顺序选择,以整合到新生的RNA构象中。该算法对类似的启发式算法进行了许多修改,包括“机会成本”功能,该功能考虑了由于选择了给定的螺旋而变得与新生构型不兼容的螺旋的整体以及“方向”约束,大大减少了新RNA构象装配中涉及的选择步骤。每个新构象的组装步骤少于n个选择步骤,其中n是折叠序列的长度。这代表了对平均执行5N个选择步骤的类似算法的重大改进,其中已知N(螺旋数)随折叠序列的长度成二次方增加。该模拟的另一个重要特征隐含在面向代理的实现中,该能力可以同时生成给定RNA序列的大量可能或次优构象。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号