A Study of Accessible Motifs and RNA Folding Complexity

DOI10.1007/11732990_40zbMath1302.92103OpenAlexW2081032809MaRDI QIDQ3596329

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

dynamic programming algorithmsaccessible motifsmicroRNA binding

Mathematics Subject Classification ID

Protein sequences, DNA sequences (92D20)

Related Items (7)

RNA secondary structures in a polymer-zeta model how foldings should be shaped for sparsification to establish a linear speedup ⋮ The rainbow spectrum of RNA secondary structures ⋮ Sparse RNA folding: time and space efficient algorithms ⋮ Unnamed Item ⋮ Fast RNA Structure Alignment for Crossing Input Structures ⋮ Sparse RNA Folding: Time and Space Efficient Algorithms ⋮ The block spectrum of RNA pseudoknot structures

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