... 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 evaluat...
Ngày tải lên: 12/08/2014, 17:20