Canal-U

Mon compte

Résultats de recherche

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

le (8m22s)

2.8. DNA sequencing

During the last session, I explained several times how it was important to increase the efficiency of sequences processing algorithm because sequences arevery long and there are large volumes of sequences, so it's now the time to ask: but where these sequences come from? This is the process of sequencing. DNA sequencing is a physical operation through which a DNA molecule is read, that is every nucleotide along the strand of the molecule is read and then a text is producedas a succession of the nucleotides as letters. So from the DNA molecule tothe text through what is a sequencer. Sequencers are smaller and smaller and smaller and they ...
Voir la vidéo
Conférences

le (8m55s)

RDV Santé Inserm : Devenir chercheur, chercheur en devenir

Des médecins-chercheurs réunis par l'Inserm engagent la discussion avec des étudiants à la faculté de médecine de Necker. La recherche est-elle ouverte à tout le monde ? Premier ou dernier de la classe, qui a ses chances ? En réalité au-delà du niveau scolaire, la recherche, c'est la conquête de l'inconnu, c'est faire travailler l'imagination. Créativité et originalité sont deux éléments-clé qui dépassent allégrement le critère convenu de sélection des étudiants par le niveau en maths.
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
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

 
FMSH
 
Facebook Twitter
Mon Compte