Sciweavers

10988 search results - page 9 / 2198
» Algorithmic Folding Complexity
Sort
View
CANDC
2006
ACM
13 years 7 months ago
An RNA folding algorithm including pseudoknots based on dynamic weighted matching
On the basis of maximum weighted matching (MWM) algorithm, we introduced a dynamic weight related with stem length and used a recursive algorithm to predict RNA secondary structur...
Haijun Liu, Dong Xu, Jianlin Shao, Yifei Wang
APBC
2004
173views Bioinformatics» more  APBC 2004»
13 years 9 months ago
RNA Secondary Structure Prediction with Simple Pseudoknots
Pseudoknots are widely occurring structural motifs in RNA. Pseudoknots have been shown to be functionally important in different RNAs which play regulatory, catalytic, or structur...
Jitender S. Deogun, Ruben Donts, Olga Komina, Fang...
BIOINFORMATICS
2006
130views more  BIOINFORMATICS 2006»
13 years 7 months ago
Memory efficient folding algorithms for circular RNA secondary structures
A small class of RNA molecules, in particular the tiny genomes of viroids, are circular. Yet most structure prediction algorithms handle only linear RNAs. The most straightforward ...
Ivo L. Hofacker, Peter F. Stadler
CPM
2009
Springer
90views Combinatorics» more  CPM 2009»
13 years 11 months ago
Sparse RNA Folding: Time and Space Efficient Algorithms
Rolf Backofen, Dekel Tsur, Shay Zakov, Michal Ziv-...