Sciweavers

15 search results - page 1 / 3
» The Trouble with Long-Range Base Pairs in RNA Folding
Sort
View
JCB
2000
129views more  JCB 2000»
13 years 4 months ago
Prediction of RNA Base Pairing Probabilities on Massively Parallel Computers
We present an implementation of McCaskill's algorithm for computing the base pair probabilities of an RNA molecule for massively parallel message passing architectures. The p...
Martin Fekete, Ivo L. Hofacker, Peter F. Stadler
ICASSP
2011
IEEE
12 years 8 months ago
Iterative estimation of structures of multiple RNA homologs: Turbofold
TurboFold, an iterative algorithm for estimating the common secondary structures of multiple RNA homologs, is presented. The algorithm is motivated by and has structure and attrib...
Gaurav Sharma, Arif Ozgun Harmanci, David H. Mathe...
BIOINFORMATICS
2006
130views more  BIOINFORMATICS 2006»
13 years 4 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
ISSPIT
2010
12 years 11 months ago
Accelerating the Nussinov RNA folding algorithm with CUDA/GPU
Graphics processing units (GPU) on commodity video cards have evolved into powerful computational devices. The RNA secondary structure arises from the primary structure and a backb...
Dar-Jen Chang, Christopher Kimmer, Ming Ouyang
CSB
2004
IEEE
208views Bioinformatics» more  CSB 2004»
13 years 8 months ago
Pair Stochastic Tree Adjoining Grammars for Aligning and Predicting Pseudoknot RNA Structures
Motivation: Since the whole genome sequences for many species are currently available, computational predictions of RNA secondary structures and computational identifications of t...
Hiroshi Matsui, Kengo Sato, Yasubumi Sakakibara