Ressource pédagogique : 5.6. The diversity of bioinformatics algorithms
Présentation de: 5.6. The diversity of bioinformatics algorithms
Informations pratiques sur cette ressource
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 originale.
Description de la ressource pédagogique
Description (résumé)
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 overlap. And the problem of assembly isto use the overlap in order to ordering this read and reconstructing the whole genomic sequence. This is the overlapping and you see that you can use this overlap to get a longer sequence. Of course, here the example issimple: you have to imagine a set of millions of reads to beassembled into genomic sequences of millions or billions of bases. A second class of problems issequence mapping and comparison. We have seen sequence comparison. What about sequence mapping? You remember this situation in which biologists get what they call "cDNA". Experimentally, this is a sequence of DNA and they want to map this sequence of DNA on the sequence of the genome in order to say: well, this is an exon, this i an exon and so on.
"Domaine(s)" et indice(s) Dewey
- biologie application informatique (570.285)
Thème(s)
Document(s) annexe(s) - 5.6. The diversity of bioinformatics algorithms
- Cette ressource fait partie de
AUTEUR(S)
-
Francois RECHENMANN
EN SAVOIR PLUS
-
Identifiant de la fiche
35271 -
Identifiant
oai:canal-u.fr:35271 -
Schéma de la métadonnée
- LOMv1.0
- LOMFRv1.0
- Voir la fiche XML
-
Entrepôt d'origine