当前位置: X-MOL 学术Theor. Comput. Sci. › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
An infinite class of unsaturated rooted trees corresponding to designable RNA secondary structures
Theoretical Computer Science ( IF 0.9 ) Pub Date : 2020-06-02 , DOI: 10.1016/j.tcs.2020.05.046
Jonathan Jedwab , Tara Petrie , Samuel Simon

An RNA secondary structure is designable if there is an RNA sequence which can attain its maximum number of base pairs only by adopting that structure. The combinatorial RNA design problem, introduced by Haleš et al. in 2016, is to determine whether or not a given RNA secondary structure is designable. Haleš et al. identified certain classes of designable and non-designable secondary structures by reference to their corresponding rooted trees. We introduce an infinite class of rooted trees containing unpaired nucleotides at the greatest depth, and prove constructively that their corresponding secondary structures are designable. This complements previous results for the combinatorial RNA design problem.



中文翻译:

对应于可设计的RNA二级结构的无限类不饱和根树

如果存在仅通过采用该结构即可达到其最大碱基对数目的RNA序列,则可以设计RNA二级结构。Haleš等人介绍的组合RNA设计问题。在2016年,将确定给定的RNA二级结构是否可设计。Haleš等。通过参考它们对应的根树,确定了某些类别的可设计和不可设计的二级结构。我们引入了无限种类的生根树,它们在最大深度处包含未配对的核苷酸,并建设性地证明了其相应的二级结构是可设计的。这补充了组合RNA设计问题的先前结果。

更新日期:2020-06-02
down
wechat
bug