A simple, practical and complete O(n3/log n)-time algorithm for RNA folding using the Four-Russians speedup.

Area of Science:

• Computational Biology
• Bioinformatics
• Molecular Biology

Background:

• RNA secondary structure prediction is a long-standing computational challenge.
• The standard dynamic programming solution for RNA folding has a time complexity of O(n3).
• Existing faster algorithms are often complex and not practically implemented.

Purpose of the Study:

• To develop a simple, complete, and practical algorithm for RNA folding.
• To improve the computational efficiency of predicting RNA secondary structure.
• To apply the Four-Russians technique to the RNA folding problem.

Main Methods:

• Implementation of the Four-Russians technique for RNA folding.
• Development of a novel dynamic programming approach.
• Analysis of worst-case time complexity.

Main Results:

• A practical Four-Russians algorithm for RNA folding was developed.
• The algorithm achieves a worst-case time bound of O(n3/log(n)).
• The method demonstrates consistent speed-ups in practice.

Conclusions:

• The Four-Russians technique offers a significant improvement for RNA folding.
• The O(n3/log(n)) time bound is achievable with richer nucleotide matching schemes.
• This advancement has practical implications for analyzing long RNA molecules, such as in RNA virus genomes.