Algorithms for Loop Matchings
From MaRDI portal
Publication:4198373
DOI10.1137/0135006zbMath0411.92008OpenAlexW2054931730MaRDI QIDQ4198373
Ruth Nussinov, George Pieczenik, Jerrold R. Griggs, Daniel J. Kleitman
Publication date: 1978
Published in: SIAM Journal on Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0135006
algorithmsdynamic programming algorithmRnaDna biomoleculesloop matchingsplanar folding of long chains
Dynamic programming (90C39) Genetics and epigenetics (92D10) Physiological, cellular and medical topics (92Cxx)
Related Items (41)
On topological indices for small RNA graphs ⋮ A Sparsified Four-Russian Algorithm for RNA Folding ⋮ Rapid dynamic programming algorithms for RNA secondary structure ⋮ Dynamic Linear Model for the Identification of miRNAs in Next-Generation Sequencing Data ⋮ Watson-Crick pairing, the Heisenberg group and Milnor invariants ⋮ RNA multiple structural alignment with longest common subsequences ⋮ On the Structure of RNA Branching Polytopes ⋮ Generic properties of combinatory maps: Neutral networks of RNA secondary structures ⋮ A computational model for RNA multiple structural alignment ⋮ Topological language for RNA ⋮ Secondary structure ensemble analysis via community detection ⋮ A Faster Algorithm for Maximum Induced Matchings on Circle Graphs ⋮ New approximation algorithms for RNA secondary structures prediction problems by local search ⋮ The Bounded and Precise Word Problems for Presentations of Groups ⋮ Generation of RNA pseudoknot structures with topological genus filtration ⋮ Speeding up the dynamic algorithm for planar RNA folding ⋮ A circular order on edge-coloured trees and RNA \(m\)-diagrams ⋮ A parallel algorithm for estimating the secondary structure in ribonucleic acids ⋮ A Maximum Weight Clique Algorithm For Dense Circle Graphs With Many Shared Endpoints ⋮ Approximation of RNA multiple structural alignment ⋮ Symmetric circular matchings and RNA folding ⋮ Modeling RNA secondary structures. I: Mathematical structural model for predicting RNA secondary structures ⋮ Computational methods in noncoding RNA research ⋮ Rapid ab initio prediction of RNA pseudoknots via graph tree decomposition ⋮ Predicting RNA secondary structures with pseudoknots by MCMC sampling ⋮ Applying length-dependent stochastic context-free grammars to RNA secondary structure prediction ⋮ Modeling dynamic programming problems over sequences and trees with inverse coupled rewrite systems ⋮ A fuzzy model of predicting RNA secondary structure ⋮ A phase transition for the minimum free energy of secondary structures of a random RNA ⋮ Fatgraph models of RNA structure ⋮ Fine-grained parallel RNA secondary structure prediction using SCFGs on FPGA ⋮ Chance and necessity in evolution: lessons from RNA ⋮ Random k -noncrossing RNA structures ⋮ An RNA secondary structure prediction method based on minimum and suboptimal free energy structures ⋮ Prediction and statistics of pseudoknots in RNA structures using exactly clustered stochastic simulations ⋮ A grammatical approach to RNA-RNA interaction prediction ⋮ A new method for prediction of RNA secondary structure with pseudoknots, based on helix removal and refinement ⋮ Combinatorics of RNA secondary structures ⋮ Effects of secondary structures in RNA on interlocking probabilities ⋮ RNA secondary structures and their prediction ⋮ On RNA-RNA interaction structures of fixed topological genus
This page was built for publication: Algorithms for Loop Matchings
