Sparse RNA Folding: Time and Space Efficient Algorithms
From MaRDI portal
Publication:3637117
DOI10.1007/978-3-642-02441-2_22zbMath1247.68106MaRDI QIDQ3637117
Shay Zakov, Michal Ziv-Ukelson, Rolf Backofen, Dekel Tsur
Publication date: 7 July 2009
Published in: Combinatorial Pattern Matching (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-02441-2_22
Related Items
A Sparsified Four-Russian Algorithm for RNA Folding, Sparse RNA folding: time and space efficient algorithms
Uses Software
Cites Work
- Unnamed Item
- A faster and more space-efficient algorithm for inferring arc-annotations of RNA sequences through alignment
- RNA secondary structure: a complete mathematical analysis
- Approximation and exact algorithms for RNA secondary structure prediction and recognition of stochastic context-free languages
- More algorithms for all-pairs shortest paths in weighted graphs
- A Study of Accessible Motifs and RNA Folding Complexity
- Simultaneous Solution of the RNA Folding, Alignment and Protosequence Problems
- A linear space algorithm for computing maximal common subsequences
- Algorithms for the Longest Common Subsequence Problem
- Biological Sequence Analysis