Mon compte

Résultats de recherche

Nombre de programmes trouvés : 307

le (13m55s)

Transjuicer 2 / Boo Chapple

Transjuicer 2 / Boo Chapple. In "Images & mirages @ nanosciences", colloque international organisé par le Laboratoire Interdisciplinaire Solidarités, Sociétés, Territoires (LISST) de l'Université Toulouse II-Le Mirail, le Centre d'Élaboration de Matériaux et d'Études Structurales (CEMES) rattaché à l'Institut de Physique du CNRS et le Laboratoire de Physique et Chimie de Nano-Objets (LPCNO) de l'INSA Toulouse. Université Toulouse II-Le Mirail / La Fabrique Culturelle, 9-10 décembre 2010. Thématique 4 : Visions et visées artistiques sur les nanos. L’inscription d’une esthétique nanotechnologique dans le contexte scientifique et artistique, 9 décembre 2010. Transjuicer represents the culmination of several years of work on ...
Voir la vidéo
Label UNT Vidéocours

le (9m27s)

4.10. How efficient is this algorithm?

We have seen the principle of an iterative algorithm in two paths for aligning and comparing two sequences of characters, here DNA sequences. And we understoodwhy the iterative version is much more efficient than the recursive version. But, how efficient is reallythis iterative algorithm? You remember that in order to measure the efficiency of algorithms, the computer scientists do not use any mean of measuring the time or any other thing. They evaluate the number of timethe main operation inside the algorithm is executed. In the caseof this Needleman and Wunsch algorithm which has been published 40 years ago, the operation which is critical is the comparisonbetween two letters of ...
Voir la vidéo
Label UNT Vidéocours

le (9m8s)

1.9. Predicting the origin of DNA replication?

We have seen a nice algorithm to draw, let's say, a DNA sequence. We will see that first, we have to correct a little bit this algorithm. And then we will see how such as imple algorithm can provide biological results. Again, this is the aim of bioinformatics: analysing the genomic texts and providing biological results. So, you remember that we had to deal with the problem of the screen size and for that, we decided to change the first version of the algorithm and we introduced a window of fixed length. And we get this algorithm. So, in this algorithm, we repeat the analysis within the window and ...
Voir la vidéo

Facebook Twitter
Mon Compte