We build a cost model of the sequence alignment and in order to minimize the cost, we propose two approaches to achieve this goal. The First algorithm is based on Divide-and-Conquer Algorithm and the second is based on dynamic programming. The last algorithm calculates the cost more quickly than the first one. The highlight is that by using algorithm based on dynamic programming, we can not only get the minimal cost but also get the aligned sequences.
We build a cost model of the sequence alignment and in order to minimize the cost, we propose two approaches to achieve this goal. The First algorithm is based on Divide-and-Conquer Algorithm and the second is based on dynamic programming. The last algorithm calculates the cost more quickly than the first one. The highlight is that by using algorithm based on dynamic programming, we can not only get the minimal cost but also get the aligned sequences.