Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

14

CPM
2009
Springer

favoriteEmaildiscussreport

90views Combinatorics» more CPM 2009»

Sparse RNA Folding: Time and Space Efficient Algorithms

13 years 8 months ago

Sparse RNA Folding: Time and Space Efficient Algorithms

Download www.cs.bgu.ac.il

Rolf Backofen, Dekel Tsur, Shay Zakov, Michal Ziv-

Real-time Traffic

Combinatorics | CPM 2009 |

claim paper

Related Content

» Design implementation and evaluation of a practical pseudoknot folding algorithm based on ...

» Time and Space Efficient RNARNA Interaction Prediction via Sparse Folding

» RNA Secondary Structure Prediction with Simple Pseudoknots

» A method for aligning RNA secondary structures and its application to RNA motif detection

» Memory efficient alignment between RNA sequences and stochastic grammar models of pseudokn...

» Identification of consensus RNA secondary structures using suffix arrays

» Efficient pairwise RNA structure prediction using probabilistic alignment constraints in D...

» Lifting Prediction to Alignment of RNA Pseudoknots

» Structator fast indexbased search for RNA sequencestructure patterns

Post Info
More Details (n/a)

Added	14 Aug 2010
Updated	14 Aug 2010
Type	Conference
Year	2009
Where	CPM
Authors	Rolf Backofen, Dekel Tsur, Shay Zakov, Michal Ziv-Ukelson

Comments (0)