Vidéo pédagogique
Notice
Lieu de réalisation
Grenoble
Sous-titrage
Sous-titre
Langue :
Anglais
Crédits
François Rechenmann (Intervention)
Conditions d'utilisation
Ces ressources de cours sont, sauf mention contraire, diffusées sous Licence Creative Commons. L’utilisateur doit mentionner le nom de l’auteur, il peut exploiter l’œuvre sauf dans un contexte commercial et il ne peut apporter de modifications à l’œuvre originale.
DOI : 10.60527/xa28-xd58
Citer cette ressource :
François Rechenmann. Inria. (2015, 5 février). 1.9. Predicting the origin of DNA replication? , in 1. Genomic texts. [Vidéo]. Canal-U. https://doi.org/10.60527/xa28-xd58. (Consultée le 14 août 2024)

# 1.9. Predicting the origin of DNA replication?

Réalisation : 5 février 2015 - Mise en ligne : 9 mai 2017
• document 1 document 2 document 3
• niveau 1 niveau 2 niveau 3
Descriptif

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 we make the window progress along the sequence. A problem we didn't deal within this first version is that there is no reason why the lengthof the sequence would be a multiple of the length of the window. It means that it is possible we arrive at this situation. You see here that the window islonger than the last part of the sequence we have to take into account. So, we have to modify a little bit a condition here to take care of the fact that, if we have this case, we have to stop there because here, we don't have any character to take into account in the lastpart of the window.

Intervention
Thème
Documentation

## Dans la même collection

• Vidéo pédagogique
00:04:52

### 1.2. At the heart of the cell: the DNA macromolecule

Rechenmann
François

During the last session, we saw how at the heart of the cell there's DNA in the nucleus, sometimes of cells, or directly in the cytoplasm of the bacteria. The DNA is what we call a macromolecule, that

• Vidéo pédagogique
00:05:10

### 1.5. Counting nucleotides

Rechenmann
François

In this session, don't panic. We will design our first algorithm. This algorithm is forcounting nucleotides. The idea here is that as an input,you have a sequence of nucleotides, of bases, of letters,

• Vidéo pédagogique
00:06:24

### 1.8. Compressing the DNA walk

Rechenmann
François

We have written the algorithm for the circle DNA walk. Just a precision here: the kind of drawing we get has nothing to do with the physical drawing of the DNA molecule. It is a symbolic

• Vidéo pédagogique
00:07:21

### 1.3. DNA codes for genetic information

Rechenmann
François

Remember at the heart of any cell,there is this very long molecule which is called a macromolecule for this reason, which is the DNA molecule. Now we will see that DNA molecules support what is called

• Vidéo pédagogique
00:04:28

### 1.6. GC and AT contents of DNA sequence

Rechenmann
François

We have designed our first algorithmfor counting nucleotides. Remember, what we have writtenin pseudo code is first declaration of variables. We have several integer variables that are variables which

• Vidéo pédagogique
00:05:24

### 1.1. The cell, atom of the living world

Rechenmann
François

Welcome to this introduction to bioinformatics. We will speak of genomes and algorithms. More specifically, we will see how genetic information can be analysed by algorithms. In these five weeks to

• Vidéo pédagogique
00:07:29

### 1.10. Overlapping sliding window

Rechenmann
François

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

• Vidéo pédagogique
00:05:48

### 1.4. What is an algorithm?

Rechenmann
François

We have seen that a genomic textcan be indeed a very long sequence of characters. And to interpret this sequence of characters, we will need to use computers. Using computers means writing program.

• Vidéo pédagogique
00:06:06

### 1.7. DNA walk

Rechenmann
François

We will now design a more graphical algorithm which is called "the DNA walk". We shall see what does it mean "DNA walk". Walk on to DNA. Something like that, yes. But first, just have a look again at

## Avec les mêmes intervenants et intervenantes

• Vidéo pédagogique
00:06:06

### 1.7. DNA walk

Rechenmann
François

We will now design a more graphical algorithm which is called "the DNA walk". We shall see what does it mean "DNA walk". Walk on to DNA. Something like that, yes. But first, just have a look again at

• Vidéo pédagogique
00:06:57

### 2.7. The algorithm design trade-off

Rechenmann
François

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

• Vidéo pédagogique
00:06:22

### 3.4. Predicting all the genes in a sequence

Rechenmann
François

We have written an algorithm whichis able to locate potential genes on a sequence but only on one phase because we are looking triplets after triplets. Now remember that the genes maybe located on

• Vidéo pédagogique
00:06:38

### 4.7. Alignment costs

Rechenmann
François

We have seen how we can compute the cost of the path ending on the last node of our grid if we know the cost of the sub-path ending on the three adjacent nodes. It is time now to see more deeply why

• Vidéo pédagogique
00:06:58

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

Rechenmann
François

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

• Vidéo pédagogique
00:04:52

### 1.2. At the heart of the cell: the DNA macromolecule

Rechenmann
François

During the last session, we saw how at the heart of the cell there's DNA in the nucleus, sometimes of cells, or directly in the cytoplasm of the bacteria. The DNA is what we call a macromolecule, that

• Vidéo pédagogique
00:05:41

### 2.1. The sequence as a model of DNA

Rechenmann
François

Welcome back to our course on genomes and algorithms that is a computer analysis ofgenetic information. Last week we introduced the very basic concept in biology that is cell, DNA, genome, genes

• Vidéo pédagogique
00:04:54

### 2.9. Whole genome sequencing

Rechenmann
François

Sequencing is anexponential technology. The progresses in this technologyallow now to a sequence whole genome, complete genome. What does it mean? Well let'stake two examples: some twenty years ago,

• Vidéo pédagogique
00:07:06

### 3.7. Index and suffix trees

Rechenmann
François

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

• Vidéo pédagogique
00:04:22

### 4.4. Aligning sequences is an optimization problem

Rechenmann
François

We have seen a nice and a quitesimple solution for measuring the similarity between two sequences. It relied on the so-called hammingdistance that is counting the number of differencesbetween two

• Vidéo pédagogique
00:04:45

### 5.2. The tree, an abstract object

Rechenmann
François

When we speak of trees, of species,of phylogenetic trees, of course, it's a metaphoric view of a real tree. Our trees are abstract objects. Here is a tree and the different components of this tree.

• Vidéo pédagogique
00:05:10

### 1.5. Counting nucleotides

Rechenmann
François

In this session, don't panic. We will design our first algorithm. This algorithm is forcounting nucleotides. The idea here is that as an input,you have a sequence of nucleotides, of bases, of letters,