Execution time comparisons.

For samples of 30 sequences per length, we averaged the execution times of five folding tools. The empirical time complexity O(L^η) where η is obtained by non-linear regression. RAFFT denotes the naive algorithm whereas RAFFT(50) denotes the algorithm where 50 structures can be saved per stack.