Local connectivity of neutral networks
From MaRDI portal
Publication:841796
DOI10.1007/s11538-008-9356-8zbMath1169.92019OpenAlexW2059816127WikidataQ44371766 ScholiaQ44371766MaRDI QIDQ841796
Publication date: 18 September 2009
Published in: Bulletin of Mathematical Biology (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11538-008-9356-8
Cites Work
- Unnamed Item
- Unnamed Item
- RNA structures with pseudo-knots: graph-theoretical, combinatorial, and statistical properties
- Asymptotic enumeration of RNA structures with pseudoknots
- Combinatorial design of pseudoknot RNA
- Crossings and nestings in tangled diagrams
- Evolution in a flat fitness landscape
- Tree adjoining grammars for RNA structure prediction
- Combinatorics of RNA secondary structures
- Spaces of RNA secondary structures
- Linear trees and RNA secondary structure
- Generic properties of combinatory maps: Neutral networks of RNA secondary structures
- Random induced subgraphs of generalized \(n\)-cubes
- Dynamic programming algorithms for RNA secondary structure prediction with pseudoknots
- Central and local limit theorems for RNA structures
- Statistics of canonical RNA pseudoknot structures
- The method of Darboux
- Combinatorics of RNA structures with pseudoknots
- Computation of Generating Functions for Biological Molecules
- Poisson approximation for large deviations
- Combinatorics of RNA Hairpins and Cloverleaves
