Combinatorics of RNA secondary structures
From MaRDI portal
Publication:1281771
DOI10.1016/S0166-218X(98)00073-0zbMath0918.05004WikidataQ56991982 ScholiaQ56991982MaRDI QIDQ1281771
Ivo L. Hofacker, Peter Schuster, Peter F. Stadler
Publication date: 22 March 1999
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Exact enumeration problems, generating functions (05A15) Enumeration in graph theory (05C30) Planar graphs; geometric and topological aspects of graph theory (05C10) Biochemistry, molecular biology (92C40) Asymptotic enumeration (05A16)
Related Items (48)
Statistics of topological RNA structures ⋮ Enumerative aspects of secondary structures ⋮ Improved bounds for colouring circle graphs ⋮ Large deviations for random trees and the branching of RNA secondary structures ⋮ Local connectivity of neutral networks ⋮ Generic properties of combinatory maps: Neutral networks of RNA secondary structures ⋮ NEUTRAL EVOLUTION AND MUTATION RATES OF SEQUENTIAL DYNAMICAL SYSTEMS ⋮ Enumerating secondary structures and structural moieties for circular RNAs ⋮ The rainbow spectrum of RNA secondary structures ⋮ Asymptotic expected number of base pairs in optimal secondary structure for random RNA using the Nussinov--Jacobson energy model ⋮ RNA structures with pseudo-knots: graph-theoretical, combinatorial, and statistical properties ⋮ Valid Plane Trees: Combinatorial Models for RNA Secondary Structures with Watson--Crick Base Pairs ⋮ Enumeration of symmetric arc diagrams ⋮ An asymptotic expansion for the number of two-connected chord diagrams ⋮ Combinatorics of RNA structures with pseudoknots ⋮ RNA secondary structures with given motif specification: combinatorics and algorithms ⋮ The combinatorics of a tree-like functional equation for connected chord diagrams ⋮ Combinatorics of locally optimal RNA secondary structures ⋮ A circular order on edge-coloured trees and RNA \(m\)-diagrams ⋮ Connected Chord Diagrams and the Combinatorics of Asymptotic Expansions ⋮ Combinatorial analysis of interacting RNA molecules ⋮ Expected distance between terminal nucleotides of RNA secondary structures ⋮ Asymptotic number of hairpins of saturated RNA secondary structures ⋮ Symmetric circular matchings and RNA folding ⋮ Asymptotic distribution of motifs in a stochastic context-free grammar model of RNA folding ⋮ Asymptotic enumeration of RNA structures with pseudoknots ⋮ Efficient pattern matching for RNA secondary structures ⋮ Narayana number, Chebyshev polynomial and Motzkin path on RNA abstract shapes ⋮ Asymptotic enumeration of RNA secondary structure ⋮ Logarithmic behavior of some combinatorial sequences ⋮ Reduction of \(m\)-regular noncrossing partitions ⋮ Unnamed Item ⋮ Asymptotics for local maximal stack scores with general loop penalty function ⋮ Asymptotic enumeration of some RNA secondary structures ⋮ Controlled non-uniform random generation of decomposable structures ⋮ Loop homology of bi-secondary structures ⋮ Unnamed Item ⋮ The end-to-end distance of RNA as a randomly self-paired polymer ⋮ Motif frequency and evolutionary search times in RNA populations ⋮ Connected chord diagrams and bridgeless maps ⋮ 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 ⋮ Loop homology of bi-secondary structures. II ⋮ General combinatorics of RNA secondary structure ⋮ Some statistics on generalized Motzkin paths with vertical steps ⋮ Fast Fourier transform for fitness landscapes
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- RNA secondary structures and their prediction
- Remarks on an asymptotic method in combinatorics
- On a class of linked diagrams. I: Enumeration
- On a class of linked diagrams. II: Asymptotics
- RNA secondary structure: a complete mathematical analysis
- On some new sequences generalizing the Catalan and Motzkin numbers
- Spaces of RNA secondary structures
- Minimal cycle bases of outerplanar graphs
- On an asymptotic method in enumeration
- Proportions of Irreducible Diagrams
- Computation of Generating Functions for Biological Molecules
- Asymptotic Methods in Enumeration
- Combinatorics of RNA Hairpins and Cloverleaves
- Algorithms for Loop Matchings
- Proportions of Irreducible Diagrams
- Sur Un Problème De Configurations Et Sur Les Fractions Continues
- Motzkin numbers
This page was built for publication: Combinatorics of RNA secondary structures