Finding Common Sequence and Structure Motifs in a Set of RNA Sequences
Proceedings of the 5th International Conference on Intelligent Systems for Molecular Biology
A Faster Algorithm for RNA Co-folding
WABI '08 Proceedings of the 8th international workshop on Algorithms in Bioinformatics
Fast RNA Structure Alignment for Crossing Input Structures
CPM '09 Proceedings of the 20th Annual Symposium on Combinatorial Pattern Matching
Sparse RNA Folding: Time and Space Efficient Algorithms
CPM '09 Proceedings of the 20th Annual Symposium on Combinatorial Pattern Matching
WABI'09 Proceedings of the 9th international conference on Algorithms in bioinformatics
Sparse RNA folding: Time and space efficient algorithms
Journal of Discrete Algorithms
| Hi-index | 0.00 |
The computational formulation for finding the optimal simultaneous alignment and fold (optimal Co-fold) of RNA sequences was first introduced by Sankoff in 1985. Since then the importance of Co-Folding has grown as conservation of structure and its relationship to function have been widely observed in RNA. For two sequences, the computation time of Sankoff's Algorithm is θ(N6). Existing literature on cofolding attempts to improve efficiency through simplifying the original problem formulation. We present here a practical and worst-case speed up using the Four-Russians method, without placing any added constraints on the types of alignments or folds allowed. Our algorithm, Fast Cofold, finds the optimal Co-fold in O(N6/ log(N2))-time, a speedup which is observed in practice. Because the solution matrix produced by our algorithm is identical to the one produced by the Sankoff algorithm, the contribution of the algorithm lays not only in its standalone practicality but also in the ability to implement it alongside heuristic speed ups leading to even greater reductions in time.