<?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>35143</entry>
</identifier>
<title><string language="fre"><![CDATA[4.7. Alignment costs]]></string></title>
<language>ENG</language>
<description>
<string language="fre"><![CDATA[We have seen how we can compute the cost of the path ending on the last node of our grid if we know the cost of the sub-path ending on the three adjacent nodes. It is time now to see more deeply why these costs are used to compute the cost in the last node. So again, we saw how we can compute the cost here of the path ending on that node if we know the cost of the sub-path ending on these three red nodes. Indeed, if we come from that node, the cost on that node will be the cost of that node plus the cost of the gap that is an insertion cost. If we come from that node, the situation is similar, the cost of that node will be the cost of thatone plus the same insertion cost. If we come from that node, thecost here will be the sum of the cost of that node plus the code of the substitution of the letter N of the sequence by letter M of the second sequence. And this cost is known withinthe substitution matrix, here, which tells for each pair of characters, here in the four letter alphabet, the cost of substituting oneletter, one nucleotide by another one. So, now since we want to havehere the minimal cost what we do is we take, we return as the value of the cost here the minimum of these three expressions.]]></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:53
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/4_7_alignment_costs.35143]]></location>
<location><![CDATA[https://streaming-canal-u.fmsh.fr/vod/media/canalu/videos/fuscia/4.1.how.to.predict.gene.protein.functions.copie._35143/c016fr.w4.s7.en.2.mp4]]></location>
<size>147578822</size>
<duration><duration>PT0H6M39S</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/4.0</entry>
</identifier>
<description>
<string language="fre"><![CDATA[4. Sequences comparison]]></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>