Mon compte

# Résultats de recherche

Trier par :
Nombre de programmes trouvés : 537
Label UNT Clip pédagogique

le (6m41s)

## Remediation - Vecteurs position, vitesses et accélérations décrits en coordonnées cartésiennes et polaires - VIDEO 04-Passage vecteurs de bases

... vecteur accélération non nulle.Cet élément de remédiation permet d'expliquer cette réponse.Etant donné que les positions, vitesses et accélérations sont décrits par des vecteurs,nous rappellerons quelques propriétés utiles sur la façon de se repérer dans...
Voir la vidéo
Label UNT Vidéocours

le (6m58s)

## 2.7. The algorithm design trade-off

We saw how to increase the efficiencyof our algorithm through the introduction of a data structure. Now let's see if we can do even better. We had a table of index and weexplain how the use of these small arrays allowed us to increase the efficiency that is to reduce the number of comparison to be executed when looking up a triplet in the genetic code. Now what I propose is an alternative to this data structure, it's to compute the indexes. OK. So we have this algorithm which uses here a function. You are now familiar with thisnotion of function, the idea is to fragment the complexity ofan algorithm ...
Voir la vidéo
Label UNT Vidéocours

le (6m59s)

## 4.9. Recursion can be avoided: an iterative version

We have written a recursive function to compute the optimal path that is an optimal alignment between two sequences. Here all the examples I gave were onDNA sequences, four letter alphabet. OK. The writing of this recursive function is very elegant but unfortunately we will see now that it isnot very efficient in execution time. Let's see why. Remember the computing schema weapply during the recursion, for example here, to compute the cost of this node, we saw that it was required to computerecursively the cost of that node, that node and that node. OK but to compute the cost of that node here, you need to compute the cost ...
Voir la vidéo
Label UNT Vidéocours

le (7m7s)

## 3.7. Index and suffix trees

We have seen with the Boyer-Moore algorithm how we can increase the efficiency of spin searching through the pre-processing of the pattern to be searched. Now we will see that an alternative way of improving the performance is to pre-process the text itself,the searchable text itself and we will, for that, study two methods, the construction of indexes of fixed length words and the algorithm which uses prefix trees. An index of fixed lengthword, what does it mean? Imagine you have a text, a searchable text, that is a text in which you want to search a pattern,here is quite a short text, the sequence is 14 correctors. We will ...
Voir la vidéo