
Rechenmann, François (19..-.... ; informaticien)
Ingénieur et Docteur-Ingénieur en informatique, François Rechenmann est chercheur au centre Inria Grenoble – Rhône-Alpes. Il y exerce ses activités à l’interface de l’informatique et des sciences du vivant en contribuant plus particulièrement au développement de méthodes et de logiciels pour l’analyse des séquences génomiques des microorganismes. Cofondateur de la société Genostar, qui propose des solutions bioinformatiques aux industries pharmaceutiques, agroalimentaires et biotechnologiques, il en est le conseiller scientifique. Très impliqué dans les actions de médiation scientifique, François Rechenmann est le responsable scientifique du site Interstices dont l’objectif est d’expliquer l’informatique en tant que domaine de recherche.
Vidéos
1.1. The cell, atom of the living world
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
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
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
3.5. Making the predictions more reliable
We have got a bacterial gene predictor but the way this predictor works is rather crude and if we want to have more reliable results, we have to inject into this algorithmmore biological knowledge. We
4.6. A path is optimal if all its sub-paths are optimal
A sequence alignment between two sequences is a path in a grid. So that, an optimal sequence alignmentis an optimal path in the same grid. We'll see now that a property of this optimal path provides
5.1. The tree of life
Welcome to this fifth and last week of our course on genomes and algorithms that is the computer analysis of genetic information. During this week, we will firstsee what phylogenetic trees are and how
1.4. What is an algorithm?
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.
2.2. Genes: from Mendel to molecular biology
The notion of gene emerged withthe works of Gregor Mendel. Mendel studied the inheritance on some traits like the shape of pea plant seeds,through generations. He stated the famous laws of inheritance
2.10. How to find genes?
Getting the sequence of the genome is only the beginning, as I explained, once you have the sequence what you want to do is to locate the gene, to predict the function of the gene and maybe study the
3.8. Probabilistic methods
Up to now, to predict our gene,we only rely on the process of searching certain strings or patterns. In order to further improve our gene predictor, the idea is to use, to rely onprobabilistic methods
4.3. Measuring sequence similarity
So we understand why gene orprotein sequences may be similar. It's because they evolve togetherwith the species and they evolve in time, there aremodifications in the sequence and that the sequence
5.3. Building an array of distances
So using the sequences of homologous gene between several species, our aim is to reconstruct phylogenetic tree of the corresponding species. For this, we have to comparesequences and compute distances