Canal-U

Mon compte

Résultats de recherche

Nombre de programmes trouvés : 828
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
Label UNT Vidéocours

le (7m40s)

5.5. Differences are not always what they look like

The algorithm we have presented works on an array of distance between sequences. These distances are evaluated on the basis of differences between the sequences. The problem is that behind the differences we observed on the set of sequences, there may beother mutations which cannot be observed and we should modify the distances. We will have a look at some simple cases of these observed differences which may correspond to hidden differences and then we will see how the evaluation, computationof the number of differences may be affected. The simple case is this one, aunique substitution between, in the sequence One we have a Cand it turns out that in ...
Voir la vidéo
Label UNT Vidéocours

le (7m30s)

1.10. Overlapping sliding window

We have made some drawings along a genomic sequence. And we have seen that although the algorithm is quite simple, even if some points of the algorithmare bit trickier than the others, we were able to produce an interesting result that is a prediction of the origin of replication of bacterial genomes. We have seen also that it may work for a large part of bacterial genomes but for some of them it doesn't work and this is the real life of bio informaticians. We have to deal with that. But, our algorithm was very visual. Now, we want to have a more quantitative approach to make apparent the ...
Voir la vidéo

 
FMSH
 
Facebook Twitter
Mon Compte