Research Article

[Retracted] An Improved Strategy for Task Scheduling in the Parallel Computational Alignment of Multiple Sequences

Code 2

//compute the total number of tasks
//sorting of all tasks according to their finishing time. The first task must be a //initialize a variable i ( is the part of solution) //part of our optimal solution.
for
//here is the starting time of m and is the finishing time of
then
//we again select activity