期刊
JOURNAL OF MATHEMATICAL BIOLOGY
卷 68, 期 1-2, 页码 341-375出版社
SPRINGER HEIDELBERG
DOI: 10.1007/s00285-012-0631-9
关键词
-
资金
- European project ExploreMaps-ERC StG [208471]
- National Science Foundation [DBI-0543506, DMS-0817971]
- Digiteo Foundation project RNAomics
- Direct For Mathematical & Physical Scien
- Division Of Mathematical Sciences [1016618] Funding Source: National Science Foundation
It is a classical result of Stein and Waterman that the asymptotic number of RNA secondary structures is . Motivated by the kinetics of RNA secondary structure formation, we are interested in determining the asymptotic number of secondary structures that are locally optimal, with respect to a particular energy model. In the Nussinov energy model, where each base pair contributes towards the energy of the structure, locally optimal structures are exactly the saturated structures, for which we have previously shown that asymptotically, there are many saturated structures for a sequence of length . In this paper, we consider the base stacking energy model, a mild variant of the Nussinov model, where each stacked base pair contributes toward the energy of the structure. Locally optimal structures with respect to the base stacking energy model are exactly those secondary structures, whose stems cannot be extended. Such structures were first considered by Evers and Giegerich, who described a dynamic programming algorithm to enumerate all locally optimal structures. In this paper, we apply methods from enumerative combinatorics to compute the asymptotic number of such structures. Additionally, we consider analogous combinatorial problems for secondary structures with annotated single-stranded, stacking nucleotides (dangles).
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据