Applying length-dependent stochastic context-free grammars to RNA secondary structure prediction

DOI10.3390/A4040223zbMATH Open1461.68100OpenAlexW2097508084MaRDI QIDQ1736487FDOQ1736487

Authors: Frank Weinberg, Markus E. Nebel 

Publication date: 26 March 2019

Published in: Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3390/a4040223

Recommendations

• The application of stochastic grammars to RNA secondary structure prediction
• Approximation and exact algorithms for RNA secondary structure prediction and recognition of stochastic context-free languages
• scientific article; zbMATH DE number 1303033
• Predicting protein secondary structure using stochastic tree grammars
• Tree adjoining grammars for RNA structure prediction
• A grammatical approach to RNA-RNA interaction prediction

zbMATH Keywords

RNA secondary structure predictionstochastic context-free grammarlength-dependency

Mathematics Subject Classification ID

Protein sequences, DNA sequences (92D20) Grammars and rewriting systems (68Q42)

Cites Work

• Biological Sequence Analysis
• Title not available (Why is that?)
• Algorithms for Loop Matchings

Cited In (6)

• Predicting protein secondary structure using stochastic tree grammars
• Comparing a Hidden Markov Model and a Stochastic Context-Free Grammar
• Extending stochastic context-free grammars for an application in bioinformatics
• A grammatical approach to RNA-RNA interaction prediction
• Asymptotic distribution of motifs in a stochastic context-free grammar model of RNA folding
• Asymptotic number of hairpins of saturated RNA secondary structures

Uses Software

• KineFold

This page was built for publication: Applying length-dependent stochastic context-free grammars to RNA secondary structure prediction

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1736487)