Ressource pédagogique : 2.4. A translation algorithm

Informations pratiques sur cette ressource

Description de la ressource pédagogique

Description (résumé)

We have seen that the genetic codeis a correspondence between the DNA or RNA sequences and aminoacid sequences that is proteins. Our aim here is to design atranslation algorithm, we make the hypothesis that the genetic codehas been implemented as an array as presented in the lastslide of the previous session. We have seen transcriptions and translationsfrom DNA to RNA and proteins. An important thing to notice hereis that most of the time computer scientists and bioinformaticiansjust forget about RNA. When they speak about translating,they say translating from DNA to proteins directly becausethe differences between the DNA and RNA is only T and U sowhat they do is this directly, translating from DNA to proteinsand that's exactly what our algorithm will do. You remember,triplets, triplets and the correspondent through the geneticcodes here to do the protein, a sequence of amino acids thatis a sequence written in the letter alphabet. So a translation algorithm,what will it do? It will take every triplets ofa coding DNA sequence and for each of these triplets, it will lookup the genetic code, retrieve the corresponding amino acid andadd it to the sequence of amino acids being synthesized that isthe protein, that is what we want to have is an algorithmwhich takes as an input this, a DNA again, it could be a RNA but againit doesn't make any difference.

"Domaine(s)" et indice(s) Dewey

• biologie application informatique (570.285)

Thème(s)