From: A simple, practical and complete O -time Algorithm for RNA folding using the Four-Russians Speedup
Size | O(n ^{3}) Algorithm | O(n ^{3}/log(n)) Algorithm | ratio |
---|---|---|---|
1000 | 3.20 | 1.43 | 2.23 |
2000 | 27.10 | 7.62 | 3.55 |
3000 | 95.49 | 26.90 | 3.55 |
4000 | 241.45 | 55.11 | 4.38 |
5000 | 470.16 | 97.55 | 4.82 |
6000 | 822.79 | 157.16 | 5.24 |