58 résultats : CELIS

Recherche en cours

Par mots-clef = CELIS

Attention : l'accès aux ressources peut être restreint, soit pour des raisons juridiques, soit par la volonté de l'auteur.

58 résultats

page 5 sur 6

résultats 41 à 50

4.10. How efficient is this algorithm?

Description : 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 ...

Mots clés : DNA, Genome, algorithm, cell, bioinformatics

Date : 05-02-2015

Droits : Droits réservés à l'éditeur et aux auteurs. 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 ...

4.10. How efficient is this algorithm?

Ajouter à mon panier

Accéder aux documents

4.9. Recursion can be avoided: an iterative version

Description : 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 ...

Mots clés : DNA, Genome, algorithm, cell, bioinformatics

Date : 05-02-2015

4.9. Recursion can be avoided: an iterative version

Ajouter à mon panier

Accéder aux documents

5.1. The tree of life

Description : 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 we can reconstruct these trees from the available data. Then to conclude this week and this course, ...

Mots clés : DNA, Genome, algorithm, cell, bioinformatics

Date : 05-02-2015

5.1. The tree of life

Ajouter à mon panier

Accéder aux documents

5.5. Differences are not always what they look like

Description : The algorithm we have presented works on an array of distance between sequences. These distances are evaluated on the basis of differences between the sequences. The problem is that behind the differences we observed on the set of sequences, there may beother mutations which cannot be observed and ...

Mots clés : DNA, Genome, algorithm, cell, bioinformatics

Date : 05-02-2015

5.5. Differences are not always what they look like

Ajouter à mon panier

Accéder aux documents

5.2. The tree, an abstract object

Description : 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. Here is what we call an edge or a branch. We have nodes, a particular nodeis the root and other no ...

Mots clés : DNA, Genome, algorithm, cell, bioinformatics

Date : 05-02-2015

5.2. The tree, an abstract object

Ajouter à mon panier

Accéder aux documents

5.3. Building an array of distances

Description : 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 between these sequences and we have seen last week how we were able to measure the similarity between ...

Mots clés : DNA, Genome, algorithm, cell, bioinformatics

Date : 05-02-2015

5.3. Building an array of distances

Ajouter à mon panier

Accéder aux documents

5.4. The UPGMA algorithm

Description : We know how to fill an array with the values of the distances between sequences, pairs of sequences which are available in the file. This array of distances will be the input of our algorithm for reconstructing phylogenetic trees. The name of this algorithm israther complicated but the method itself ...

Mots clés : DNA, Genome, algorithm, cell, bioinformatics

Date : 05-02-2015

5.4. The UPGMA algorithm

Ajouter à mon panier

Accéder aux documents

5.6. The diversity of bioinformatics algorithms

Description : In this course, we have seen a very little set of bioinformatic algorithms. There exist numerous various algorithms in bioinformatics which deal with a large span of classes of problems. For example, read assembly. We have seen how NGS sequencers produce large sets of reads, small sequences which ...

Mots clés : DNA, Genome, algorithm, cell, bioinformatics

Date : 05-02-2015

5.6. The diversity of bioinformatics algorithms

Ajouter à mon panier

Accéder aux documents

5.7. The application domains in microbiology

Description : Bioinformatics relies on many domains of mathematics and computer science. Of course, algorithms themselves on character strings are important in bioinformatics, we have seen them. Algorithms and trees, for example,for reconstructing phylogenetic trees, algorithms on networks toreconstruct gene ...

Mots clés : DNA, Genome, algorithm, cell, bioinformatics

Date : 05-02-2015

5.7. The application domains in microbiology

Ajouter à mon panier

Accéder aux documents

Les rencontres de la BUL : Tunisie, la révolution deux ans après

Description : Amor Cherni, enseignant-chercheur au Département de philosophie de l’Université Blaise Pascal et membre du CELIS. Auteur de La révolution tunisienne : s’emparer de l’histoire paru chez l’éditeur Albouraq en 2011. Il présentera son livre et échangera sur le contexte politique particulier de la Tunisie.

Mots clés : Tunisie, histoire, Rencontres de la BUL, Amor Cherni, CELIS

Date : 23-05-2013

Droits : Droits réservés à l'éditeur et aux auteurs.

Les rencontres de la BUL : Tunisie, la révolution deux ans après

Ajouter à mon panier

Accéder aux documents

Rebondir