A Study of Accessible Motifs and RNA Folding Complexity

DOI10.1007/11732990_40MaRDI QIDQ3596329zbMATH OpenOpenAlexFDO

Authors Ydo Wexler, Chaya Ben-Zaken Zilberstein, Michal Ziv-Ukelson

Publication date 30 August 2007

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11732990_40

zbMATH Keywords

accessible motifsdynamic programming algorithmsmicroRNA binding

Mathematics Subject Classification ID

Protein sequences, DNA sequences (92D20)

Recommendations

• Rapid dynamic programming algorithms for RNA secondary structure
• Speeding up the dynamic algorithm for planar RNA folding
• Computational Science – ICCS 2005
• scientific article; zbMATH DE number 4116366
• Computing and Combinatorics

Cited in

(8)

• The rainbow spectrum of RNA secondary structures
• A folding ``framework structure of \textit{Tetrahymena} group I intron
• The block spectrum of RNA pseudoknot structures
• RNA secondary structures in a polymer-zeta model how foldings should be shaped for sparsification to establish a linear speedup
• Fast RNA Structure Alignment for Crossing Input Structures
• Sparse RNA Folding: Time and Space Efficient Algorithms
• scientific article; zbMATH DE number 7205101 (Why is no real title available?)
• Sparse RNA folding: time and space efficient algorithms

This page was built for publication: A Study of Accessible Motifs and RNA Folding Complexity

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