Asymptotic enumeration of RNA structures with pseudoknots
From MaRDI portal
Publication:942904
DOI10.1007/s11538-007-9265-2zbMath1152.92007arXiv0706.3137OpenAlexW2095652405WikidataQ51622377 ScholiaQ51622377MaRDI QIDQ942904
Christian M. Reidys, Emma Yu Jin
Publication date: 8 September 2008
Published in: Bulletin of Mathematical Biology (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0706.3137
generating functionasymptotic enumerationHankel contourRNA secondary structurepseudoknotsingular expansiontransfer theorem\(k\)-noncrossing RNA structure
Related Items (11)
Regular simple queues of protein contact maps ⋮ Algebraic dynamic programming for multiple context-free grammars ⋮ Local connectivity of neutral networks ⋮ Transformations of partial matchings ⋮ Asymptotic number of hairpins of saturated RNA secondary structures ⋮ RNA pseudoknot structures with arc-length \(\geq 3\) and stack-length \(\geq \sigma \) ⋮ Neutral networks of sequence to shape maps ⋮ Central and local limit theorems for RNA structures ⋮ Statistics of canonical RNA pseudoknot structures ⋮ Combinatorial design of pseudoknot RNA ⋮ On the decomposition of \(k\)-noncrossing RNA structures
Cites Work
- Unnamed Item
- Unnamed Item
- RNA secondary structures and their prediction
- RNA structures with pseudo-knots: graph-theoretical, combinatorial, and statistical properties
- Rapid dynamic programming algorithms for RNA secondary structure
- Central and local limit theorems applied to asymptotic enumeration. IV: Multivariate generating functions
- Explicit Tauberian estimates for functions with positive coefficients
- Tree adjoining grammars for RNA structure prediction
- Combinatorics of RNA secondary structures
- Singularity analysis and asymptotics of Bernoulli sums
- Spaces of RNA secondary structures
- Mellin transforms and asymptotics: Digital sums
- Linear trees and RNA secondary structure
- Dynamic programming algorithms for RNA secondary structure prediction with pseudoknots
- Singularity analysis, Hadamard products, and tree recurrences
- The method of Darboux
- Combinatorics of RNA structures with pseudoknots
- Crossings and nestings of matchings and partitions
- Computation of Generating Functions for Biological Molecules
- Random Walk in a Weyl Chamber
- Combinatorics of RNA Hairpins and Cloverleaves
- Search for the maximum of a random walk
- On the Vector Representations of Induced Matroids
- AN EXAMPLE IN THE THEORY OF THE SPECTRUM OF A FUNCTION
This page was built for publication: Asymptotic enumeration of RNA structures with pseudoknots
