arXivDaily arXiv每日学术速递 周一至周五更新
arXiv physics/0609135physics.bio-phq-bio.BM
收藏

RNA二级结构设计

RNA secondary structure design

Bernd Burghardt, Alexander K. Hartmann

摘要:

我们考虑RNA二级结构的逆折叠问题:对于一个给定的(无伪结)二级结构,找到一个以该结构为基态的序列。如果存在这样的序列,则该结构称为可设计的。我们实现了一个分支定界算法,该算法能够在序列空间内进行穷举搜索,即,给出了一个确切的答案是否存在这样的序列。分支定界算法所需的边界由动态规划算法计算。我们考虑不同的字母大小和一个合奏的随机结构,我们要设计。我们发现,对于两个字母,几乎没有这些结构是可设计的。对于三个字母的情况,可设计性有所改善,但仍然有很大一部分结构是不可设计的。当我们看到自然的四个字母的情况下,两对互补的碱基:不可设计的结构是例外,尽管它们仍然存在。最后,我们还研究了分支定界算法的可设计性与算法复杂度之间的关系。在整体结构中,高的平均不可设计性程度与证明给定结构是(不可)设计的较长时间相关。在四个字母的情况下,可设计性在任何地方都很高,算法复杂性在天然存在的RNA区域最高。

英文摘要:

We consider the inverse-folding problem for RNA secondary structures: for a given (pseudo-knot-free) secondary structure find a sequence that has that structure as its ground state. If such a sequence exists, the structure is called designable. We implemented a branch-and-bound algorithm that is able to do an exhaustive search within the sequence space, i.e., gives an exact answer whether such a sequence exists. The bound required by the branch-and-bound algorithm are calculated by a dynamic programming algorithm. We consider different alphabet sizes and an ensemble of random structures, which we want to design. We find that for two letters almost none of these structures are designable. The designability improves for the three-letter case, but still a significant fraction of structures is undesignable. This changes when we look at the natural four-letter case with two pairs of complementary bases: undesignable structures are the exception, although they still exist. Finally, we also study the relation between designability and the algorithmic complexity of the branch-and-bound algorithm. Within the ensemble of structures, a high average degree of undesignability is correlated to a long time to prove that a given structure is (un-)designable. In the four-letter case, where the designability is high everywhere, the algorithmic complexity is highest in the region of naturally occurring RNA.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑