<?xml version="1.0" encoding="UTF-8"?><lom xmlns="http://ltsc.ieee.org/xsd/LOM" xmlns:lomfr="http://www.lom-fr.fr/xsd/LOMFR" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://ltsc.ieee.org/xsd/LOM http://www.lom-fr.fr/xsd/lomfrv1.0/std/lomfr.xsd">
<general>
<identifier>
<catalog>Canal-U_Ocms</catalog>
<entry>35057</entry>
</identifier>
<title><string language="fre"><![CDATA[2.5. Implementing the genetic code]]></string></title>
<language>ENG</language>
<description>
<string language="fre"><![CDATA[Remember we were designing our translation algorithm and since we are a bit lazy, we decided to make the hypothesis that there was the adequate function forimplementing the genetic code. It's now time to see this lookupfunction but just before that come back on this condition herewhich is a bit more complex than the first attempt in writing the algorithm. Here you see the keyword OR, itmeans that this condition is true if this one is true or thisone is true or this one is true. Why do we need this morecomplex condition? Imagine our sequence and there washere the last triplet we translated. Now we increase our index fromthat position to that one. In the first version of the algorithm, we made the hypothesis that there was a star symbol hereand that was the end of the sequence but imagine that we havehere for example C and T and the star symbol is here. So the condition test is the starsymbol here or here or here and then we have to stop. In either of the three cases:that one, that one or that one. That's why we had thismore complex condition. OK. So lookup genetic code is afunction that we have to write now, so for that we come back to the implementation of the genetic code. For the matter of convenience,for this function, we now see the genetic code as an array again,array of 64 rows because there are 64 combinations of threeletters but four columns.]]></string></description>
<keyword><string language="fre"><![CDATA[DNA]]></string></keyword><keyword><string language="fre"><![CDATA[Genome]]></string></keyword><keyword><string language="fre"><![CDATA[algorithm]]></string></keyword><keyword><string language="fre"><![CDATA[cell]]></string></keyword><keyword><string language="fre"><![CDATA[bioinformatics]]></string></keyword>
<lomfr:documentType>
<lomfr:source>LOMFRv1.0</lomfr:source>
<lomfr:value>image en mouvement</lomfr:value>
</lomfr:documentType>
</general><lifeCycle>
<contribute>
<role>
<source>LOMv1.0</source>
<value>author</value>
</role>
<entity><![CDATA[BEGIN:VCARD
VERSION:3.0
CLASS:PUBLIC
REV:2021-07-06 18:14:31
FN:Francois RECHENMANN
N:RECHENMANN;Francois;;;
URL;TYPE=work:https://www.canal-u.tv/auteurs/rechenmann_francois
ROLE:author
NOTE: 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. 
TZ:+0200
END:VCARD
]]></entity>
<date><dateTime>2015-02-05</dateTime></date>
</contribute>
</lifeCycle>
<metaMetadata>
<metadataSchema>LOMv1.0</metadataSchema>
<metadataSchema>LOMFRv1.0</metadataSchema>
</metaMetadata>
<technical>
<format>video/mp4</format>
<location><![CDATA[https://www.canal-u.tv/video/inria/2_5_implementing_the_genetic_code.35057]]></location>
<location><![CDATA[https://streaming-canal-u.fmsh.fr/vod/media/canalu/videos/fuscia/2.2.genes.from.mendel.to.molecular.biology.copie._35057/c016fr.w2.s5.en.mp4]]></location>
<size>173715211</size>
<duration><duration>PT0H5M51S</duration></duration>
</technical>
<educational>
<learningResourceType>
<source>LOMv1.0</source>
<value>lecture</value>
</learningResourceType>
<context>
<source>LOMv1.0</source>
<value>licence</value>
</context>
<context>
<source>LOMv1.0</source>
<value>master</value>
</context>
</educational>
<rights>
<cost>
<source>LOMv1.0</source>
<value>no</value>
</cost>
<copyrightAndOtherRestrictions>
<source>LOMv1.0</source>
<value>no</value>
</copyrightAndOtherRestrictions>
<description>
<string language="fre"><![CDATA[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.]]></string>
</description>
</rights>
<relation>
<kind>
<source>LOMv1.0</source>
<value>ispartof</value>
</kind>
<resource>
<identifier>
<catalog>URI</catalog>
<entry>https://www.canal-u.tv/producteurs/inria/cours_en_ligne/bioinformatics_genomes_and_algorithms/2.0</entry>
</identifier>
<description>
<string language="fre"><![CDATA[2. Genes and proteins]]></string>
</description>
</resource>
</relation>
<classification>
<purpose>
<source>LOMv1.0</source>
<value>discipline</value>
</purpose>
<taxonPath>
<source>
<string language="fre"><![CDATA[Universités Numériques Thématiques 2009 http://www.universites-numeriques.fr]]></string>
</source>
<taxon>
<id/>
<entry>
<string language="fre"/>
</entry>
</taxon>
</taxonPath>
</classification>
<classification>
<purpose>
<source>LOMv1.0</source>
<value>discipline</value>
</purpose>
<taxonPath>
<source>
<string language="fre">CDD 22e éd.</string>
<string language="eng">DDC 22nd ed.</string>
</source>
<taxon>
<id>570.285</id>
<entry>
<string language="fre"><![CDATA[biologie application informatique]]></string>
</entry>
</taxon>
</taxonPath>
</classification> </lom>