Sparse RNA folding: Time and space efficient algorithms

Authors:
Rolf Backofen;Dekel Tsur;Shay Zakov;Michal Ziv-Ukelson
Affiliations:
Albert Ludwigs University, Freiburg, Germany;Department of Computer Science, Ben-Gurion University of the Negev, Israel;Department of Computer Science, Ben-Gurion University of the Negev, Israel;Department of Computer Science, Ben-Gurion University of the Negev, Israel
Venue:
Journal of Discrete Algorithms
Year:
2011

Citing 15
Cited 0

New clique and independent set algorithms for circle graphs

Discrete Applied Mathematics
Algorithms for the Longest Common Subsequence Problem

Journal of the ACM (JACM)
An Improved Context-Free Recognizer

ACM Transactions on Programming Languages and Systems (TOPLAS)
A linear space algorithm for computing maximal common subsequences

Communications of the ACM
Pairwise local structural alignment of RNA sequences with sequence similarity less than 40%

Bioinformatics
Programming languages and their compilers: Preliminary notes

Programming languages and their compilers: Preliminary notes
A Faster and More Space-Efficient Algorithm for Inferring Arc-Annotations of RNA Sequences through Alignment

Algorithmica
CONTRAfold

Bioinformatics
Multiple structural alignment and clustering of RNA sequences

Bioinformatics
Efficient parameter estimation for RNA secondary structure prediction

Bioinformatics
A partition function algorithm for interacting nucleic acid strands

Bioinformatics
Sparse RNA Folding: Time and Space Efficient Algorithms

CPM '09 Proceedings of the 20th Annual Symposium on Combinatorial Pattern Matching
A worst-case and practical speedup for the RNA co-folding problem using the four-Russians idea

WABI'10 Proceedings of the 10th international conference on Algorithms in bioinformatics
Reducing the worst case running times of a family of RNA and CFG problems, using Valiant's approach

WABI'10 Proceedings of the 10th international conference on Algorithms in bioinformatics
More Algorithms for All-Pairs Shortest Paths in Weighted Graphs

SIAM Journal on Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

The currently fastest algorithm for RNA Single Strand Folding requires O(nZ) time and @Q(n^2) space, where n denotes the length of the input string and Z is a sparsity parameter satisfying n=