School of Mathematical Sciences, The Key Laboratory of Pure Mathematics and Combinatorics of Ministry of Education of China (LPMC), Nankai University, Tianjin, P.R. China.
Center for Combinatorics, The Key Laboratory of Pure Mathematics and Combinatories of Ministry of Education of China (LPMC), Nankai University, Tianjin, P.R. China.
J Comput Biol. 2022 May;29(5):425-440. doi: 10.1089/cmb.2021.0421. Epub 2022 Mar 28.
It is known that both RNA secondary structure and protein contact map can be presented using combinatorial diagrams, the combinatorial enumeration and related problems of which have been studied extensively. Motivated by previous enumeration works on saturated RNA secondary structures and extended stack structures of protein contact maps, we are interested in the enumeration problems of saturated and optimal extended stacks in the Nussinov-Jacobson energy model, in which each base pair contributes energy -1. Then optimal structures are those with most arcs, and locally optimal structures are exactly the saturated structures, in which no more arcs can be added without violating the structure definition. For saturated extended 2-regular simple stacks, whose degree configuration is related to the protein fold in two-dimensional honeycomb lattice, we obtain generating function equation and asymptotic formula for its number. Moreover, an explicit formula for the number of optimal extended 2-regular simple stacks is also obtained.
已知 RNA 二级结构和蛋白质接触图都可以使用组合图表示,组合枚举及其相关问题已经得到了广泛的研究。受饱和 RNA 二级结构和蛋白质接触图扩展堆积结构的枚举工作的启发,我们对 Nussinov-Jacobson 能量模型中饱和和最优扩展堆积的枚举问题感兴趣,其中每个碱基对贡献能量-1。最优结构是具有最多弧的结构,局部最优结构恰好是饱和结构,即在不违反结构定义的情况下,不能再添加更多的弧。对于饱和的扩展 2-正则简单堆积,其度配置与二维蜂窝晶格中的蛋白质折叠有关,我们得到了它的数目的生成函数方程和渐近公式。此外,还得到了最优扩展 2-正则简单堆积的数量的显式公式。