Canal-U

Mon compte

Résultats de recherche

Nombre de programmes trouvés : 558
Label UNT Vidéocours

le (7m42s)

4.8. A recursive algorithm

We have seen how we can computethe optimal cost, the ending node of our grid if we know the optimal cost of the three adjacent nodes. This is this computation scheme we can see here using the notation of the pseudo code and not the mathematical notation we used in the previous sessions. So again we can compute the cost of this node if we know the cost of that node, that node and that node and we have to add respectively the insertion cost, the substitution cost orthe insertion cost. The substitution cost here depends on the letter at this position in the sequence and this letter ...
Voir la vidéo

 
FMSH
 
Facebook Twitter Google+
Mon Compte