Combinatorial design of pseudoknot RNA
From MaRDI portal
Publication:1004248
DOI10.1016/J.AAM.2008.06.003zbMATH Open1156.92018DBLPjournals/aam/JinR09OpenAlexW2003890447WikidataQ56266973 ScholiaQ56266973MaRDI QIDQ1004248FDOQ1004248
Authors: Christian M. Reidys, Emma Yu Jin 
Publication date: 2 March 2009
Published in: Advances in Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.aam.2008.06.003
Recommendations
- Combinatorics of RNA structures with pseudoknots
- Combinatorial Computational Biology of RNA
- Combinatorial RNA design: designability and structure-approximating algorithm
- RNA structures with pseudo-knots: graph-theoretical, combinatorial, and statistical properties
- Structural Alignment of Pseudoknotted RNA
- Classifying RNA pseudoknotted structures
- scientific article; zbMATH DE number 1953301
Biochemistry, molecular biology (92C40) Asymptotic enumeration (05A16) Computational methods for problems pertaining to biology (92-08)
Cites Work
- Analytic combinatorics
- Differentiably finite power series
- AN EXAMPLE IN THE THEORY OF THE SPECTRUM OF A FUNCTION
- Tree adjoining grammars for RNA structure prediction
- Crossings and nestings of matchings and partitions
- Register Allocation for Unary–Binary Trees
- Dynamic programming algorithms for RNA secondary structure prediction with pseudoknots
- Combinatorics of RNA structures with pseudoknots
- Random walks in Weyl chambers and the decomposition of tensor powers
- RNA structures with pseudo-knots: graph-theoretical, combinatorial, and statistical properties
- Asymptotic enumeration of RNA structures with pseudoknots
- Crossings and nestings in tangled diagrams
- Spaces of RNA secondary structures
- Title not available (Why is that?)
- Linear trees and RNA secondary structure
- Generic properties of combinatory maps: Neutral networks of RNA secondary structures
- Computation of Generating Functions for Biological Molecules
- Combinatorics of RNA Hairpins and Cloverleaves
- Combinatorics of RNA secondary structures
Cited In (22)
- Combinatorial Computational Biology of RNA
- Topological classification and enumeration of RNA structures by genus
- Combinatorial analysis of interacting RNA molecules
- On the decomposition of \(k\)-noncrossing RNA structures
- An integer linear programming problem for RNA structures
- Statistics of canonical RNA pseudoknot structures
- Moduli spaces and macromolecules
- RNA structures with pseudo-knots: graph-theoretical, combinatorial, and statistical properties
- Local connectivity of neutral networks
- Asymptotic enumeration of RNA structures with pseudoknots
- Stacks in canonical RNA pseudoknot structures
- Combinatorics of RNA-RNA interaction
- Properties of RNA secondary structure matching models
- Enumerating RNA structures, including pseudoknots of any topology
- RNA pseudoknot structures with arc-length \(\geq 3\) and stack-length \(\geq \sigma \)
- Conjugacy invariant pseudo-norms, representability and RNA secondary structures
- Pseudoknot-generating operation
- Irreducibility in RNA structures
- On the page number of RNA secondary structures with pseudoknots
- Combinatorics of RNA structures with pseudoknots
- Random \(k\)-noncrossing RNA structures
- Central and local limit theorems for RNA structures
This page was built for publication: Combinatorial design of pseudoknot RNA
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1004248)
