... simple, complete and practical Four-Russians algorithm for the basic RNA- folding problem, achieving a worst-case time reduction from O( n3) to O( n3/log(n)) We show that this time-bound can also be obtained ... Also, there is an additional overhead of processing of the one (possible) partial group in any column j only takes O( nq) time Reversing the order of evaluation in the algorithm for i and k would ... not incorporate any additional heuristic ideas or optimizations that might be appropriate for one method but not the other However, we are aware that there are speedup ideas for RNA folding, ...