Asymptotics of RNA shapes

William Andrew Lorenz 1 Peter Clote 1 Yann Ponty 2, 3
2 AMIB - Algorithms and Models for Integrative Biology
LIX - Laboratoire d'informatique de l'École polytechnique [Palaiseau], LRI - Laboratoire de Recherche en Informatique, UP11 - Université Paris-Sud - Paris 11, Inria Saclay - Ile de France
Abstract : RNA shapes, introduced by Giegerich et al., provide a useful classification of the branching complexity for RNA secondary structures. In this paper, we derive an exact value for the asymptotic number of RNA shapes, by relying on an elegant relation between non-ambiguous, context-free grammars and generating functions. Our results provide a theoretical upper bound on the length of RNA sequences amenable to probabilistic shape analysis, under the assumption that any base can basepair with any other base. Since the relation between context-free grammars and asymptotic enumeration is simple yet not well-known in bioinformatics, we give a self-contained presentation with illustrative examples. Additionally, we prove a surprising 1-to-1 correspondence between Pi-shapes and Motzkin numbers
Complete list of metadatas

https://hal.inria.fr/inria-00548861
Contributor : Yann Ponty <>
Submitted on : Monday, December 20, 2010 - 4:39:42 PM
Last modification on : Wednesday, March 27, 2019 - 4:41:29 PM

Identifiers

Collections

Citation

William Andrew Lorenz, Peter Clote, Yann Ponty. Asymptotics of RNA shapes. Journal of Computational Biology, Mary Ann Liebert, 2008, 15 (1), pp.31--63. ⟨10.1089/cmb.2006.0153⟩. ⟨inria-00548861⟩

Share

Metrics

Record views

196