饱和RNA二级结构的预期顺序

E. Y. Jin, M. Nebel
{"title":"饱和RNA二级结构的预期顺序","authors":"E. Y. Jin, M. Nebel","doi":"10.1137/1.9781611973020.11","DOIUrl":null,"url":null,"abstract":"Regarding so-called hairpin-loops as the building blocks of a RNA secondary structure, the order (as introduced by Waterman as a parameter on graphs in 1978) provides information on the (balanced) nesting-depth of hairpin-loops and thus on the overall complexity of the structure. \n \nSubsequent to Waterman's seminal work, Zucker et al. and Clote introduced a more realistic combinatorial model for RNA secondary structures, the so-called saturated secondary structures. Compared to the traditional model ofWaterman, unpaired nucleotides (vertices) which are in favorable position for a pairing do not exist, i.e. no base pair (edge) can be added without violating at least one restriction for the graphs. That way, one major shortcoming of the traditional model has been cleared. However, the resulting model gets much more challenging from a mathematical point of view. As a consequence, the current state of knowledge concerning saturated structures is limited to (1) their asymptotic number, (2) the expected number of base pairs, (3) the asymptotic normal density of states [4]. Nothing is known about the nature of the branching topology of saturated structures -- a topic that the current paper completely solves. \n \nIn this paper we show how it is possible to attack saturated structures and especially how to analyze their order. This is of special interest since in the past it has been proven to be one of the most demanding parameters to address (for the traditional model it has been an open problem for more than 20 years to find asymptotic results for the number of structures of given order and similar). We show the expected order of RNA saturated secondary structures of size n is log4 n (1 + O (1/log2n)), if we select the saturated secondary structure uniformly at random. Furthermore, the order of saturated secondary structures is sharply concentrated around its mean. As a consequence saturated structures and structures in the traditional model behave the same with respect to the expected order. Thus we may conclude that the traditional model has already drawn the right picture and conclusions inferred from it with respect to the order (the overall shape) of a structure remain valid even if enforcing saturation (at least in expectation).","PeriodicalId":340112,"journal":{"name":"Workshop on Analytic Algorithmics and Combinatorics","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-07-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"The Expected Order of Saturated RNA Secondary Structures\",\"authors\":\"E. Y. Jin, M. Nebel\",\"doi\":\"10.1137/1.9781611973020.11\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Regarding so-called hairpin-loops as the building blocks of a RNA secondary structure, the order (as introduced by Waterman as a parameter on graphs in 1978) provides information on the (balanced) nesting-depth of hairpin-loops and thus on the overall complexity of the structure. \\n \\nSubsequent to Waterman's seminal work, Zucker et al. and Clote introduced a more realistic combinatorial model for RNA secondary structures, the so-called saturated secondary structures. Compared to the traditional model ofWaterman, unpaired nucleotides (vertices) which are in favorable position for a pairing do not exist, i.e. no base pair (edge) can be added without violating at least one restriction for the graphs. That way, one major shortcoming of the traditional model has been cleared. However, the resulting model gets much more challenging from a mathematical point of view. As a consequence, the current state of knowledge concerning saturated structures is limited to (1) their asymptotic number, (2) the expected number of base pairs, (3) the asymptotic normal density of states [4]. Nothing is known about the nature of the branching topology of saturated structures -- a topic that the current paper completely solves. \\n \\nIn this paper we show how it is possible to attack saturated structures and especially how to analyze their order. This is of special interest since in the past it has been proven to be one of the most demanding parameters to address (for the traditional model it has been an open problem for more than 20 years to find asymptotic results for the number of structures of given order and similar). We show the expected order of RNA saturated secondary structures of size n is log4 n (1 + O (1/log2n)), if we select the saturated secondary structure uniformly at random. Furthermore, the order of saturated secondary structures is sharply concentrated around its mean. As a consequence saturated structures and structures in the traditional model behave the same with respect to the expected order. Thus we may conclude that the traditional model has already drawn the right picture and conclusions inferred from it with respect to the order (the overall shape) of a structure remain valid even if enforcing saturation (at least in expectation).\",\"PeriodicalId\":340112,\"journal\":{\"name\":\"Workshop on Analytic Algorithmics and Combinatorics\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2011-07-15\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Workshop on Analytic Algorithmics and Combinatorics\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1137/1.9781611973020.11\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Workshop on Analytic Algorithmics and Combinatorics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1137/1.9781611973020.11","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

将所谓的发夹环作为RNA二级结构的构建块,顺序(由沃特曼在1978年作为图上的参数引入)提供了关于发夹环的(平衡的)嵌套深度的信息,从而提供了结构的总体复杂性。在Waterman的开创性工作之后,Zucker等人和Clote引入了一种更现实的RNA二级结构组合模型,即所谓的饱和二级结构。与传统的waterman模型相比,不存在对配对有利的未配对的核苷酸(顶点),即没有碱基对(边)可以在不违反图的至少一个限制的情况下添加。这样,传统模式的一个主要缺点就被消除了。然而,从数学的角度来看,得到的模型更具挑战性。因此,目前关于饱和结构的知识仅限于(1)它们的渐近数,(2)期望的碱基对数,(3)状态的渐近正态密度[4]。我们对饱和结构的分支拓扑的性质一无所知——这篇论文完全解决了这个问题。在本文中,我们展示了如何攻击饱和结构,特别是如何分析它们的顺序。这是特别有趣的,因为在过去,它已被证明是最需要解决的参数之一(对于传统模型,20多年来一直是一个开放的问题,以找到给定顺序和类似结构的数量的渐近结果)。我们表明,如果我们均匀随机选择饱和二级结构,则大小为n的RNA饱和二级结构的期望阶数为log4n (1 + O (1/log2n))。此外,饱和二级结构的顺序明显集中在其平均值附近。因此,饱和结构和传统模型中的结构对于期望阶的行为是相同的。因此,我们可以得出结论,传统模型已经绘制了正确的图像,并且即使强制饱和(至少在预期中),从它推断出的关于结构的顺序(整体形状)的结论仍然有效。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
The Expected Order of Saturated RNA Secondary Structures
Regarding so-called hairpin-loops as the building blocks of a RNA secondary structure, the order (as introduced by Waterman as a parameter on graphs in 1978) provides information on the (balanced) nesting-depth of hairpin-loops and thus on the overall complexity of the structure. Subsequent to Waterman's seminal work, Zucker et al. and Clote introduced a more realistic combinatorial model for RNA secondary structures, the so-called saturated secondary structures. Compared to the traditional model ofWaterman, unpaired nucleotides (vertices) which are in favorable position for a pairing do not exist, i.e. no base pair (edge) can be added without violating at least one restriction for the graphs. That way, one major shortcoming of the traditional model has been cleared. However, the resulting model gets much more challenging from a mathematical point of view. As a consequence, the current state of knowledge concerning saturated structures is limited to (1) their asymptotic number, (2) the expected number of base pairs, (3) the asymptotic normal density of states [4]. Nothing is known about the nature of the branching topology of saturated structures -- a topic that the current paper completely solves. In this paper we show how it is possible to attack saturated structures and especially how to analyze their order. This is of special interest since in the past it has been proven to be one of the most demanding parameters to address (for the traditional model it has been an open problem for more than 20 years to find asymptotic results for the number of structures of given order and similar). We show the expected order of RNA saturated secondary structures of size n is log4 n (1 + O (1/log2n)), if we select the saturated secondary structure uniformly at random. Furthermore, the order of saturated secondary structures is sharply concentrated around its mean. As a consequence saturated structures and structures in the traditional model behave the same with respect to the expected order. Thus we may conclude that the traditional model has already drawn the right picture and conclusions inferred from it with respect to the order (the overall shape) of a structure remain valid even if enforcing saturation (at least in expectation).
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信