{"id":2636,"date":"2019-07-04T14:16:27","date_gmt":"2019-07-04T13:16:27","guid":{"rendered":"https:\/\/ent2d.ac-bordeaux.fr\/disciplines\/svt\/?page_id=2636"},"modified":"2019-07-05T07:23:39","modified_gmt":"2019-07-05T06:23:39","slug":"lexpression-du-patrimoine-genetique","status":"publish","type":"page","link":"https:\/\/ent2d.ac-bordeaux.fr\/disciplines\/svt\/python\/premiere-specialite\/lexpression-du-patrimoine-genetique\/","title":{"rendered":"L\u2019expression du patrimoine g\u00e9n\u00e9tique"},"content":{"rendered":"\n<h2 class=\"wp-block-heading\" id=\"mce_23\">Capacit\u00e9s :<br><strong>Calculer le nombre de combinaisons possibles de s\u00e9quences de n nucl\u00e9otides de longueur quand n grandit<\/strong><\/h2>\n\n\n<p><span style=\"color: #3366ff\">Fichier <a href=\"https:\/\/drive.google.com\/file\/d\/1ydbuTfaEAoRqVaKgm1ztrz306HZjJsMZ\/view?usp=sharing\"><em>Combi_nucleo.py<\/em><\/a><\/span><\/p>\n<p>\u00c9diteur<\/p>\n<table>\n<tbody>\n<tr>\n<td width=\"778\">\n<p>nbre_nucleo=int(input(\u00ab\u00a0Entrer le nombre de nucl\u00e9otides existants :\u00a0\u00bb))<\/p>\n<p><span style=\"color: #339966\"># demande \u00e0 l&rsquo;\u00e9l\u00e8ve d&rsquo;entrer le nombre de nucl\u00e9otides qui existe pour l&rsquo;ADN&nbsp;<\/span><\/p>\n<p>for n in range(1,101) :<\/p>\n<p><span style=\"color: #339966\"># cette syntaxe correspond \u00e0 une boucle born\u00e9e : ce programme r\u00e9p\u00e8te une ou plusieurs instructions un nombre d\u00e9fini de fois (ici 100 fois)<\/span><\/p>\n<p><span style=\"color: #339966\"># ici la variable n prend les valeurs enti\u00e8res de 1 \u00e0 100 (101-1=100) pour que la boucle se r\u00e9p\u00e8te 100 fois<\/span><\/p>\n<p><span style=\"color: #339966\"># range(x,y) o\u00f9 x et y sont des entiers et fait prendre \u00e0 la variable les valeurs enti\u00e8res de x \u00e0 y-1<\/span><\/p>\n<p style=\"padding-left: 40px\">print(n,nbre_nucleo**n)<\/p>\n<p><span style=\"color: #339966\"># il n&rsquo;existe pas d&rsquo;instruction pour d\u00e9finir la fin de la boucle. C&rsquo;est l&rsquo;indentation (d\u00e9calage vers la droite) d&rsquo;une ou plusieurs lignes qui permet de marquer la fin de la boucle<\/span><\/p>\n<p><span style=\"color: #339966\"># affiche dans la console chaque valeur de n, le r\u00e9sultat du nombre de nucl\u00e9otides existants (4) \u00e9lev\u00e9 \u00e0 la puissance n<\/span><\/p>\n<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n<p><\/p>\n<p>Console<\/p>\n<table>\n<tbody>\n<tr>\n<td width=\"778\">\n<p>&gt;&gt;&gt;&nbsp;<\/p>\n<p>1 4<\/p>\n<p>2 16<\/p>\n<p>3 64<\/p>\n<p>4 256<\/p>\n<p>5 1024<\/p>\n<p>6 4096<\/p>\n<p>7 16384<\/p>\n<p>8 65536<\/p>\n<p>9 262144<\/p>\n<p>10 1048576<\/p>\n<p>11 4194304<\/p>\n<p>12 16777216<\/p>\n<p>13 67108864<\/p>\n<p>14 268435456<\/p>\n<p>15 1073741824<\/p>\n<p>16 4294967296<\/p>\n<p>17 17179869184<\/p>\n<p>18 68719476736<\/p>\n<p>19 274877906944<\/p>\n<p>20 1099511627776<\/p>\n<p>21 4398046511104<\/p>\n<p>22 17592186044416<\/p>\n<p>23 70368744177664<\/p>\n<p>24 281474976710656<\/p>\n<p>25 1125899906842624<\/p>\n<p>26 4503599627370496<\/p>\n<p>27 18014398509481984<\/p>\n<p>28 72057594037927936<\/p>\n<p>29 288230376151711744<\/p>\n<p>30 1152921504606846976<\/p>\n<p>31 4611686018427387904<\/p>\n<p>32 18446744073709551616<\/p>\n<p>33 73786976294838206464<\/p>\n<p>34 295147905179352825856<\/p>\n<p>35 1180591620717411303424<\/p>\n<p>36 4722366482869645213696<\/p>\n<p>37 18889465931478580854784<\/p>\n<p>38 75557863725914323419136<\/p>\n<p>39 302231454903657293676544<\/p>\n<p>40 1208925819614629174706176<\/p>\n<p>41 4835703278458516698824704<\/p>\n<p>42 19342813113834066795298816<\/p>\n<p>43 77371252455336267181195264<\/p>\n<p>44 309485009821345068724781056<\/p>\n<p>45 1237940039285380274899124224<\/p>\n<p>46 4951760157141521099596496896<\/p>\n<p>47 19807040628566084398385987584<\/p>\n<p>48 79228162514264337593543950336<\/p>\n<p>49 316912650057057350374175801344<\/p>\n<p>50 1267650600228229401496703205376<\/p>\n<p>51 5070602400912917605986812821504<\/p>\n<p>52 20282409603651670423947251286016<\/p>\n<p>53 81129638414606681695789005144064<\/p>\n<p>54 324518553658426726783156020576256<\/p>\n<p>55 1298074214633706907132624082305024<\/p>\n<p>56 5192296858534827628530496329220096<\/p>\n<p>57 20769187434139310514121985316880384<\/p>\n<p>58 83076749736557242056487941267521536<\/p>\n<p>59 332306998946228968225951765070086144<\/p>\n<p>60 1329227995784915872903807060280344576<\/p>\n<p>61 5316911983139663491615228241121378304<\/p>\n<p>62 21267647932558653966460912964485513216<\/p>\n<p>63 85070591730234615865843651857942052864<\/p>\n<p>64 340282366920938463463374607431768211456<\/p>\n<p>65 1361129467683753853853498429727072845824<\/p>\n<p>66 5444517870735015415413993718908291383296<\/p>\n<p>67 21778071482940061661655974875633165533184<\/p>\n<p>68 87112285931760246646623899502532662132736<\/p>\n<p>69 348449143727040986586495598010130648530944<\/p>\n<p>70 1393796574908163946345982392040522594123776<\/p>\n<p>71 5575186299632655785383929568162090376495104<\/p>\n<p>72 22300745198530623141535718272648361505980416<\/p>\n<p>73 89202980794122492566142873090593446023921664<\/p>\n<p>74 356811923176489970264571492362373784095686656<\/p>\n<p>75 1427247692705959881058285969449495136382746624<\/p>\n<p>76 5708990770823839524233143877797980545530986496<\/p>\n<p>77 22835963083295358096932575511191922182123945984<\/p>\n<p>78 91343852333181432387730302044767688728495783936<\/p>\n<p>79 365375409332725729550921208179070754913983135744<\/p>\n<p>80 1461501637330902918203684832716283019655932542976<\/p>\n<p>81 5846006549323611672814739330865132078623730171904<\/p>\n<p>82 23384026197294446691258957323460528314494920687616<\/p>\n<p>83 93536104789177786765035829293842113257979682750464<\/p>\n<p>84 374144419156711147060143317175368453031918731001856<\/p>\n<p>85 1496577676626844588240573268701473812127674924007424<\/p>\n<p>86 5986310706507378352962293074805895248510699696029696<\/p>\n<p>87 23945242826029513411849172299223580994042798784118784<\/p>\n<p>88 95780971304118053647396689196894323976171195136475136<\/p>\n<p>89 383123885216472214589586756787577295904684780545900544<\/p>\n<p>90 1532495540865888858358347027150309183618739122183602176<\/p>\n<p>91 6129982163463555433433388108601236734474956488734408704<\/p>\n<p>92 24519928653854221733733552434404946937899825954937634816<\/p>\n<p>93 98079714615416886934934209737619787751599303819750539264<\/p>\n<p>94 392318858461667547739736838950479151006397215279002157056<\/p>\n<p>95 1569275433846670190958947355801916604025588861116008628224<\/p>\n<p>96 6277101735386680763835789423207666416102355444464034512896<\/p>\n<p>97 25108406941546723055343157692830665664409421777856138051584<\/p>\n<p>98 100433627766186892221372630771322662657637687111424552206336<\/p>\n<p>99 401734511064747568885490523085290650630550748445698208825344<\/p>\n<p>100 1606938044258990275541962092341162602522202993782792835301376<\/p>\n<p>&gt;&gt;&gt;&nbsp;<\/p>\n<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n\n\n<h4 class=\"wp-block-heading\">Proposition p\u00e9dagogique pour les d\u00e9butants<\/h4>\n\n\n\n<p><strong>Faire ouvrir le fichier <em>Combi_nucleo.py <\/em>et demander d&rsquo;expliquer les instructions suivantes puis d&rsquo;ex\u00e9cuter le script :<\/strong><\/p>\n\n\n\n<ul class=\"wp-block-list\"><li> for n in range(1,101) : <strong>pour quelle(s)<\/strong> <strong>longueur(s) de s\u00e9quences est-ce que le script va calculer le nombre de combinaisons ?<\/strong><\/li><\/ul>\n\n\n\n<ul class=\"wp-block-list\"><li> print(n,nbre_nucleo**n) <strong>si n=3, calculez ce qu&rsquo;affichera cette instruction.<\/strong><\/li><\/ul>\n\n\n\n<h4 class=\"wp-block-heading\">Proposition p\u00e9dagogique pour les initi\u00e9s<\/h4>\n\n\n\n<p><strong>Faire compl\u00e9ter le script suivant pour calculer le nombre de combinaisons possibles pour une longueur de nucl\u00e9otides n allant de 1 \u00e0 100 et afficher la valeur de n ainsi que le r\u00e9sultat:<\/strong><\/p>\n\n\n<p>nbre_nucleo=int(input(\u00ab\u00a0Entrer le nombre de nucl\u00e9otides existants :\u00a0\u00bb))<\/p>\n<p>for n in range(_ _ _ _ _ _ _) :<\/p>\n<p style=\"padding-left: 40px\">print(_ _ _ _ _ _ _)<\/p>\n\n\n<hr class=\"wp-block-separator\" \/>\n\n\n\n<!--nextpage-->\n\n\n\n<h2 class=\"wp-block-heading\" id=\"mce_1\">Capacit\u00e9s :<br><strong>Calculer le nombre de combinaisons possibles de s\u00e9quences de n acides amin\u00e9s quand n grandit<\/strong><\/h2>\n\n\n<p><span style=\"color: #3366ff\">Fichier <a href=\"https:\/\/drive.google.com\/file\/d\/1jH3MSmCFPSDrDNEkNqIrm8V5O0L-q2yK\/view?usp=sharing\"><em>Combi_aa.py<\/em><\/a><\/span><\/p>\n<p><em>&nbsp;<\/em>\u00c9diteur<\/p>\n<table>\n<tbody>\n<tr>\n<td width=\"778\">\n<p>nbre_aa=int(input(\u00ab\u00a0Entrer le nombre d&rsquo;acides amin\u00e9s existants :\u00a0\u00bb))<\/p>\n<p><span style=\"color: #339966\"># demande \u00e0 l&rsquo;\u00e9l\u00e8ve d&rsquo;entrer le nombre d&rsquo;acides amin\u00e9s qui existe<\/span><\/p>\n<p>for n in range(1,101) :<\/p>\n<p><span style=\"color: #339966\"># cette syntaxe correspond \u00e0 une boucle born\u00e9e : ce programme r\u00e9p\u00e8te une ou plusieurs instructions un nombre d\u00e9fini de fois (ici 100 fois)<\/span><\/p>\n<p><span style=\"color: #339966\"># ici la variable n prend les valeurs enti\u00e8res de 1 \u00e0 100 (101-1=100) pour que la boucle se r\u00e9p\u00e8te 100 fois<\/span><\/p>\n<p><span style=\"color: #339966\"># range(x,y) o\u00f9 x et y sont des entiers et fait prendre \u00e0 la variable les valeurs enti\u00e8res de x \u00e0 y-1<\/span><\/p>\n<p style=\"padding-left: 40px\">print(n,nbre_aa**n)<\/p>\n<p><span style=\"color: #339966\"># il n&rsquo;existe pas d&rsquo;instruction pour d\u00e9finir la fin de la boucle. C&rsquo;est l&rsquo;indentation (d\u00e9calage vers la droite) d&rsquo;une ou plusieurs lignes qui permet de marquer la fin de la boucle<\/span><\/p>\n<p><span style=\"color: #339966\"># affiche dans la console chaque valeur de n, le r\u00e9sultat du nombre d&rsquo;acides amin\u00e9s existants (20) \u00e9lev\u00e9 \u00e0 la puissance n<\/span><\/p>\n<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n<p>Console<\/p>\n<table>\n<tbody>\n<tr>\n<td width=\"778\">&gt;&gt;&gt; <br>1 20<br>2 400<br>3 8000<br>4 160000<br>5 3200000<br>6 64000000<br>7 1280000000<br>8 25600000000<br>9 512000000000<br>10 10240000000000<br>11 204800000000000<br>12 4096000000000000<br>13 81920000000000000<br>14 1638400000000000000<br>15 32768000000000000000<br>16 655360000000000000000<br>17 13107200000000000000000<br>18 262144000000000000000000<br>19 5242880000000000000000000<br>20 104857600000000000000000000<br>21 2097152000000000000000000000<br>22 41943040000000000000000000000<br>23 838860800000000000000000000000<br>24 16777216000000000000000000000000<br>25 335544320000000000000000000000000<br>26 6710886400000000000000000000000000<br>27 134217728000000000000000000000000000<br>28 2684354560000000000000000000000000000<br>29 53687091200000000000000000000000000000<br>30 1073741824000000000000000000000000000000<br>31 21474836480000000000000000000000000000000<br>32 429496729600000000000000000000000000000000<br>33 8589934592000000000000000000000000000000000<br>34 171798691840000000000000000000000000000000000<br>35 3435973836800000000000000000000000000000000000<br>36 68719476736000000000000000000000000000000000000<br>37 1374389534720000000000000000000000000000000000000<br>38 27487790694400000000000000000000000000000000000000<br>39 549755813888000000000000000000000000000000000000000<br>40 10995116277760000000000000000000000000000000000000000<br>41 219902325555200000000000000000000000000000000000000000<br>42 4398046511104000000000000000000000000000000000000000000<br>43 87960930222080000000000000000000000000000000000000000000<br>44 1759218604441600000000000000000000000000000000000000000000<br>45 35184372088832000000000000000000000000000000000000000000000<br>46 703687441776640000000000000000000000000000000000000000000000<br>47 14073748835532800000000000000000000000000000000000000000000000<br>48 281474976710656000000000000000000000000000000000000000000000000<br>49 5629499534213120000000000000000000000000000000000000000000000000<br>50 112589990684262400000000000000000000000000000000000000000000000000<br>51 2251799813685248000000000000000000000000000000000000000000000000000<br>52 45035996273704960000000000000000000000000000000000000000000000000000<br>53 900719925474099200000000000000000000000000000000000000000000000000000<br>54 18014398509481984000000000000000000000000000000000000000000000000000000<br>55 360287970189639680000000000000000000000000000000000000000000000000000000<br>56 7205759403792793600000000000000000000000000000000000000000000000000000000<br>57 144115188075855872000000000000000000000000000000000000000000000000000000000<br>58 2882303761517117440000000000000000000000000000000000000000000000000000000000<br>59 57646075230342348800000000000000000000000000000000000000000000000000000000000<br>60 1152921504606846976000000000000000000000000000000000000000000000000000000000000<br>61 23058430092136939520000000000000000000000000000000000000000000000000000000000000<br>62 461168601842738790400000000000000000000000000000000000000000000000000000000000000<br>63 9223372036854775808000000000000000000000000000000000000000000000000000000000000000<br>64 184467440737095516160000000000000000000000000000000000000000000000000000000000000000<br>65 3689348814741910323200000000000000000000000000000000000000000000000000000000000000000<br>66 73786976294838206464000000000000000000000000000000000000000000000000000000000000000000<br>67 1475739525896764129280000000000000000000000000000000000000000000000000000000000000000000<br>68 29514790517935282585600000000000000000000000000000000000000000000000000000000000000000000<br>69 90295810358705651712000000000000000000000000000000000000000000000000000000000000000000000<br>70 11805916207174113034240000000000000000000000000000000000000000000000000000000000000000000000<br>71 236118324143482260684800000000000000000000000000000000000000000000000000000000000000000000000<br>72 4722366482869645213696000000000000000000000000000000000000000000000000000000000000000000000000<br>73 94447329657392904273920000000000000000000000000000000000000000000000000000000000000000000000000<br>74 1888946593147858085478400000000000000000000000000000000000000000000000000000000000000000000000000<br>75 37778931862957161709568000000000000000000000000000000000000000000000000000000000000000000000000000<br>76 755578637259143234191360000000000000000000000000000000000000000000000000000000000000000000000000000<br>77 15111572745182864683827200000000000000000000000000000000000000000000000000000000000000000000000000000<br>78 302231454903657293676544000000000000000000000000000000000000000000000000000000000000000000000000000000<br>79 6044629098073145873530880000000000000000000000000000000000000000000000000000000000000000000000000000000<br>80 120892581961462917470617600000000000000000000000000000000000000000000000000000000000000000000000000000000<br>81 2417851639229258349412352000000000000000000000000000000000000000000000000000000000000000000000000000000000<br>82 48357032784585166988247040000000000000000000000000000000000000000000000000000000000000000000000000000000000<br>83 967140655691703339764940800000000000000000000000000000000000000000000000000000000000000000000000000000000000<br>84 19342813113834066795298816000000000000000000000000000000000000000000000000000000000000000000000000000000000000<br>85 386856262276681335905976320000000000000000000000000000000000000000000000000000000000000000000000000000000000000<br>86 7737125245533626718119526400000000000000000000000000000000000000000000000000000000000000000000000000000000000000<br>87 154742504910672534362390528000000000000000000000000000000000000000000000000000000000000000000000000000000000000000<br>88 3094850098213450687247810560000000000000000000000000000000000000000000000000000000000000000000000000000000000000000<br>89 61897001964269013744956211200000000000000000000000000000000000000000000000000000000000000000000000000000000000000000<br>90 1237940039285380274899124224000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000<br>91 24758800785707605497982484480000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000<br>92 495176015714152109959649689600000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000<br>93 9903520314283042199192993792000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000<br>94 198070406285660843983859875840000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000<br>95 3961408125713216879677197516800000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000<br>96 79228162514264337593543950336000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000<br>97 1584563250285286751870879006720000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000<br>98 31691265005705735037417580134400000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000<br>99 633825300114114700748351602688000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000<br>100 12676506002282294014967032053760000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000<br>&gt;&gt;&gt;<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n\n\n<h4 class=\"wp-block-heading\">Proposition p\u00e9dagogique pour les d\u00e9butants et les initi\u00e9s<\/h4>\n\n\n\n<p><strong>Faire adapter le script pr\u00e9c\u00e9dent pour calculer le nombre de combinaisons possibles pour une longueur d&rsquo;acides amin\u00e9s n allant de 1 \u00e0 100.<\/strong><\/p>\n\n\n\n<hr class=\"wp-block-separator\" \/>\n\n\n\n<!--nextpage-->\n\n\n\n<h2 class=\"wp-block-heading\" id=\"mce_1\">Capacit\u00e9s :<br><strong>Concevoir un algorithme de traduction d\u2019une s\u00e9quence d\u2019ARN et \u00e9ventuellement le programmer dans un langage informatique (par exemple Python)<\/strong><\/h2>\n\n\n\n<figure class=\"wp-block-pullquote\" style=\"border-color:#ff6900\"><blockquote class=\"has-text-color has-luminous-vivid-orange-color\"><p>Difficult\u00e9 : Niveau 1<\/p><cite>La s\u00e9quence du g\u00e8ne fournie (brin transcrit) commence par le codon d&rsquo;initiation et finit \u00e0 un codon stop.<\/cite><\/blockquote><\/figure>\n\n\n<p><em>\u00c9tape a &#8211; Concevoir un algorithme de <strong>transcription<\/strong> d\u2019une s\u00e9quence d\u2019<strong>ADN<\/strong> et le programmer en Python.<\/em><\/p>\n<p><span style=\"color: #3366ff\">Fichier <a href=\"https:\/\/drive.google.com\/file\/d\/1hfiStDMcg5FqvmI03fmb8IGCzCwC4aWG\/view?usp=sharing\"><em>Transcription_niveau_1.py<\/em><\/a><\/span><\/p>\n<p>\u00c9diteur<\/p>\n<table>\n<tbody>\n<tr>\n<td width=\"778\">\n<p>gene_1=&rsquo;TACAAAAACAAGATT&rsquo; # BRIN TRANSCRIT<\/p>\n<p>def transcription(message) : <span style=\"color: #339966\"># d\u00e9finit un programme appel\u00e9 transcription&nbsp;&nbsp;&nbsp;&nbsp;<\/span><\/p>\n<p style=\"padding-left: 40px\">arn=\u00a0\u00bb <span style=\"color: #339966\"># indique la variable qui va \u00eatre remplie par notre programme<\/span>&nbsp;<\/p>\n<p style=\"padding-left: 40px\">for caractere in message : <span style=\"color: #339966\"># boucle born\u00e9e&nbsp;&nbsp;&nbsp;<\/span>&nbsp;&nbsp;&nbsp;&nbsp;<\/p>\n<p style=\"padding-left: 80px\">if caractere ==&rsquo;A&rsquo; : <span style=\"color: #339966\"># cette ligne teste si le caract\u00e8re est A d&rsquo;o\u00f9 ==&nbsp; &nbsp; <\/span><\/p>\n<p style=\"padding-left: 120px\"><span style=\"color: #339966\"><span style=\"color: #333333\">c<\/span><\/span>aractere=&rsquo;U&rsquo; <span style=\"color: #339966\"># cette ligne est une affectation : on ajoute U comme caract\u00e8re dans arn d&rsquo;o\u00f9 =<\/span>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;<\/p>\n<p style=\"padding-left: 80px\">elif caractere ==&rsquo;T&rsquo; :&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;<\/p>\n<p style=\"padding-left: 120px\">caractere =&rsquo;A&rsquo;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;<\/p>\n<p style=\"padding-left: 80px\">elif caractere ==&rsquo;G&rsquo; :&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;<\/p>\n<p style=\"padding-left: 120px\">caractere =&rsquo;C&rsquo;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;<\/p>\n<p style=\"padding-left: 80px\">else :&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;<\/p>\n<p style=\"padding-left: 120px\">caractere =&rsquo;G&rsquo;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;<\/p>\n<p style=\"padding-left: 80px\">arn=arn+caractere <span style=\"color: #339966\"># \u00e0 chaque tour un caract\u00e8re est ajout\u00e9 dans arn &nbsp;&nbsp;&nbsp;&nbsp;<\/span><\/p>\n<p style=\"padding-left: 40px\">return arn<\/p>\n<p>arn_1=transcription(gene_1) <span style=\"color: #339966\"># \u00ab\u00a0message\u00a0\u00bb de la ligne 2 est remplac\u00e9 par la valeur de la variable (gene_1) de la ligne 1 et le programme est r\u00e9alis\u00e9 sur la valeur de gene_1<\/span><\/p>\n<p>print(arn_1) <span style=\"color: #339966\"># affiche dans la console le r\u00e9sultat du programme \u00ab\u00a0transcription\u00a0\u00bb<\/span><\/p>\n<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n<p>Console<\/p>\n<table>\n<tbody>\n<tr>\n<td width=\"778\">\n<p>&gt;&gt;&gt;&nbsp;<\/p>\n<p>AUGUUUUUGUUCUAA<\/p>\n<p>&gt;&gt;&gt;&nbsp;<\/p>\n<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n<p><em>\u00c9tape b &#8211; Concevoir un algorithme de <strong>traduction<\/strong> d\u2019une s\u00e9quence d\u2019<strong>ARNm<\/strong> et le programmer en Python.<\/em><\/p>\n<p><span style=\"color: #3366ff\">Fichier <a href=\"https:\/\/drive.google.com\/file\/d\/1qQAnAF8c8k41rdUVysSyGCrCrH1SyLQR\/view?usp=sharing\"><em>Transcription_traduction_niveau_1.py<\/em>&nbsp;<\/a><\/span><span style=\"color: #ff9900\">(ndp&nbsp;: seuls les codons et leur acide amin\u00e9 correspondant utiles pour cette s\u00e9quence sont list\u00e9s dans le programme)<\/span><\/p>\n<p>\u00c9diteur <span style=\"color: #ff9900\">(d\u00e9but identique au fichier pr\u00e9c\u00e9dent sans print(arn_1))<\/span><\/p>\n<table>\n<tbody>\n<tr>\n<td width=\"778\">\n<p><span style=\"color: #339966\"># n\u00e9cessit\u00e9 de transformer la cha\u00eene de caract\u00e8res arn_1 en liste pour appliquer la fonction traduction \u00e0 venir plus bas c&rsquo;est-\u00e0-dire de lire la cha\u00eene de caract\u00e8res de 3 en 3<\/span><\/p>\n<p>long_arn_1=len(arn_1) <span style=\"color: #339966\"># calcule le nombre de caract\u00e8res dans arn_1 &nbsp;<\/span><\/p>\n<p>liste_arn_1=arn_1[0:long_arn_1] <span style=\"color: #339966\"># Transformation en liste de la cha\u00eene de caract\u00e8res arn_1 du caract\u00e8re 0 (qui correspond en fait au premier caract\u00e8re de la cha\u00eene) au dernier caract\u00e8re&nbsp;<\/span><\/p>\n<p>def traduction(message): <span style=\"color: #339966\"># d\u00e9finit un programme appel\u00e9 traduction qui s&rsquo;appliquera \u00e0 la liste liste_arn_1<\/span>&nbsp;&nbsp;&nbsp;&nbsp;<\/p>\n<p style=\"padding-left: 40px\">i=0&nbsp;&nbsp;&nbsp;&nbsp;<\/p>\n<p style=\"padding-left: 40px\">protein_1=\u00a0\u00bb <span style=\"color: #339966\"># indique la variable qui va \u00eatre remplie par notre programme&nbsp;&nbsp;&nbsp;&nbsp;<\/span><\/p>\n<p style=\"padding-left: 40px\">for i in range(0,long_arn_1,3): <span style=\"color: #339966\"># boucle born\u00e9e o\u00f9 i prend les valeurs de 0 (premier caract\u00e8re) \u00e0 la valeur de la lg de la liste -1 (dernier caract\u00e8re) avec un pas de 3&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;<\/span><\/p>\n<p style=\"padding-left: 80px\">if liste_arn_1[i:i+3]==\u00a0\u00bbUUU\u00a0\u00bb or liste_arn_1[i:i+3]==\u00a0\u00bbUUC\u00a0\u00bb:&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;<\/p>\n<p style=\"padding-left: 120px\">protein_1=protein_1+\u00a0\u00bbPhe\u00a0\u00bb <span style=\"color: #339966\"># \u00e0 chaque tour le nom de l&rsquo;AA est ajout\u00e9 dans protein_1 si c&rsquo;est le codon correspondant qui est rencontr\u00e9&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;<\/span><\/p>\n<p style=\"padding-left: 80px\">elif liste_arn_1[i:i+3]==\u00a0\u00bbUUG\u00a0\u00bb or liste_arn_1[i:i+3]==\u00a0\u00bbUUA\u00a0\u00bb or liste_arn_1[i:i+3]==\u00a0\u00bbCUU\u00a0\u00bb or liste_arn_1[i:i+3]==\u00a0\u00bbCUC\u00a0\u00bb or liste_arn_1[i:i+3]==\u00a0\u00bbCUA\u00a0\u00bb or liste_arn_1[i:i+3]==\u00a0\u00bbCUG\u00a0\u00bb:&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;<\/p>\n<p style=\"padding-left: 120px\">protein_1=protein_1+\u00a0\u00bbLeu\u00a0\u00bb&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;<\/p>\n<p style=\"padding-left: 80px\">elif liste_arn_1[i:i+3]==\u00a0\u00bbAUG\u00a0\u00bb:&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;<\/p>\n<p style=\"padding-left: 120px\">protein_1=protein_1+\u00a0\u00bbMet\u00a0\u00bb&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;<\/p>\n<p style=\"padding-left: 80px\">elif liste_arn_1[i:i+3]==\u00a0\u00bbUAA\u00a0\u00bb or liste_arn_1[i:i+3]==\u00a0\u00bbUAG\u00a0\u00bb or liste_arn_1[i:i+3]==\u00a0\u00bbUGA\u00a0\u00bb: <span style=\"color: #339966\"># quand la boucle rencontre un des trois codons stop, elle s&rsquo;arr\u00eate et renvoie la cha\u00eene d&rsquo;AA obtenue (ligne suivante return(protein_1)<\/span>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;<\/p>\n<p style=\"padding-left: 120px\">return(protein_1)&nbsp;<\/p>\n<p>protein_1=traduction(liste_arn_1) <span style=\"color: #339966\"># \u00ab\u00a0message\u00a0\u00bb de la ligne 23 est remplac\u00e9 par la valeur de la variable (liste_arn_1) de la ligne 21 et le programme est r\u00e9alis\u00e9 sur la valeur de liste_arn_1<\/span><\/p>\n<p>print(protein_1) <span style=\"color: #339966\"># affiche dans la console le r\u00e9sultat du programme \u00ab\u00a0traduction\u00a0\u00bb<\/span><\/p>\n<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n<p>Console<\/p>\n<table>\n<tbody>\n<tr>\n<td width=\"778\">\n<p>&gt;&gt;&gt;&nbsp;<\/p>\n<p>MetPheLeuPhe<\/p>\n<p>&gt;&gt;&gt;&nbsp;<\/p>\n<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n<p><\/p>\n\n\n<hr class=\"wp-block-separator\" \/>\n\n\n\n<!--nextpage-->\n\n\n\n<h2 class=\"wp-block-heading\" id=\"mce_1\">Capacit\u00e9s :<br><strong>Concevoir un algorithme de traduction d\u2019une s\u00e9quence d\u2019ARN et \u00e9ventuellement le programmer dans un langage informatique (par exemple Python)<\/strong><\/h2>\n\n\n\n<figure class=\"wp-block-pullquote\" style=\"border-color:#ff6900\"><blockquote class=\"has-text-color has-luminous-vivid-orange-color\"><p>Difficult\u00e9 : Niveau 2<\/p><cite>La s\u00e9quence du g\u00e8ne fournie (brin transcrit) comprend les r\u00e9gions non codantes qui encadrent la r\u00e9gion codante en pr\u00e9paration d&rsquo;une traduction plus compliqu\u00e9e \u00e0 concevoir.<\/cite><\/blockquote><\/figure>\n\n\n<p><em>\u00c9tape a &#8211; Concevoir un algorithme de <strong>transcription<\/strong> d\u2019une s\u00e9quence d\u2019<strong>ADN<\/strong> et le programmer en Python.<\/em><\/p>\n<p><span style=\"color: #3366ff\">Fichier <a href=\"https:\/\/drive.google.com\/file\/d\/1tBnUSGGmw7opavnckQbNLlbe_JLH_MgS\/view?usp=sharing\"><em>Transcription_traduction_niveau_2.p<\/em><\/a><\/span><em>y<\/em><\/p>\n<p>\u00c9diteur<\/p>\n<table>\n<tbody>\n<tr>\n<td width=\"778\">\n<p>gene_1=&rsquo;CCCGTTACAAAAACAAGATTTTTTTT&rsquo; <span style=\"color: #339966\"># BRIN TRANSCRIT<\/span><\/p>\n<p>def transcription(message) : <span style=\"color: #339966\"># d\u00e9finit un programme appel\u00e9 transcription&nbsp;&nbsp;&nbsp;&nbsp;<\/span><\/p>\n<p style=\"padding-left: 40px\">arn=\u00a0\u00bb <span style=\"color: #339966\"># indique la variable qui va \u00eatre remplie par notre programme<\/span> &nbsp;&nbsp;&nbsp;&nbsp;<\/p>\n<p style=\"padding-left: 40px\">for caractere in message : <span style=\"color: #339966\"># boucle born\u00e9e&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;<\/span><\/p>\n<p style=\"padding-left: 80px\">if caractere ==&rsquo;A&rsquo; : <span style=\"color: #339966\"># cette ligne teste si le caract\u00e8re est A d&rsquo;o\u00f9 ==&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;<\/span><\/p>\n<p style=\"padding-left: 120px\">caractere=&rsquo;U&rsquo; <span style=\"color: #339966\"># cette ligne est une affectation : on ajoute U comme caract\u00e8re dans arn d&rsquo;o\u00f9 =&nbsp;&nbsp;&nbsp;<\/span>&nbsp;&nbsp;&nbsp;&nbsp;<\/p>\n<p style=\"padding-left: 80px\">elif caractere ==&rsquo;T&rsquo; :&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;<\/p>\n<p style=\"padding-left: 120px\">caractere =&rsquo;A&rsquo;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;<\/p>\n<p style=\"padding-left: 80px\">elif caractere ==&rsquo;G&rsquo; :&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;<\/p>\n<p style=\"padding-left: 120px\">caractere =&rsquo;C&rsquo;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;<\/p>\n<p style=\"padding-left: 80px\">else :&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;<\/p>\n<p style=\"padding-left: 120px\">caractere =&rsquo;G&rsquo;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; &nbsp;<\/p>\n<p style=\"padding-left: 80px\">arn=arn+caractere <span style=\"color: #339966\"># \u00e0 chaque tour un caract\u00e8re est ajout\u00e9 dans arn &nbsp;&nbsp;&nbsp;&nbsp;<\/span><\/p>\n<p style=\"padding-left: 40px\">return arn<\/p>\n<p>arn_1=transcription(gene_1) <span style=\"color: #339966\"># \u00ab\u00a0message\u00a0\u00bb de la ligne 2 est remplac\u00e9 par la valeur de la variable (gene_1) de la ligne 1 et le programme est r\u00e9alis\u00e9 sur la valeur de gene_1<\/span><\/p>\n<p>print(arn_1) <span style=\"color: #339966\"># affiche dans la console le r\u00e9sultat du programme \u00ab\u00a0transcription\u00a0\u00bb<\/span><\/p>\n<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n<p>Console<\/p>\n<table>\n<tbody>\n<tr>\n<td width=\"778\">\n<p>&gt;&gt;&gt;&nbsp;<\/p>\n<p>GGGCAAUGUUUUUGUUCUAAAAAAAA<\/p>\n<p>&gt;&gt;&gt;&nbsp;<\/p>\n<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n<p><em>\u00c9tape b &#8211; Concevoir un algorithme de <strong>traduction<\/strong> d\u2019une s\u00e9quence d\u2019<strong>ARNm<\/strong> et le programmer en Python.<\/em><\/p>\n<p>\u00c9diteur <span style=\"color: #ff9900\">(suite de l\u2019\u00e9tape pr\u00e9c\u00e9dente)<\/span><\/p>\n<table>\n<tbody>\n<tr>\n<td width=\"778\">\n<p>codon_initiation=&rsquo;AUG&rsquo;<\/p>\n<p>position_codon_initiation_arn_1=arn_1.find(codon_initiation) <span style=\"color: #339966\"># cherche la position du codon d&rsquo;initiation&nbsp;&nbsp;<\/span><\/p>\n<p><span style=\"color: #339966\"># n\u00e9cessit\u00e9 de transformer la cha\u00eene de caract\u00e8res arn_1 en liste pour appliquer la fonction traduction \u00e0 venir plus bas c&rsquo;est-\u00e0-dire de lire la cha\u00eene de caract\u00e8res de 3 en 3<\/span><\/p>\n<p>long_arn_1=len(arn_1) <span style=\"color: #339966\"># calcule le nombre de caract\u00e8res dans arn_1 &nbsp;<\/span><\/p>\n<p>liste_arn_1=arn_1[position_codon_initiation_arn_1:long_arn_1] <span style=\"color: #339966\"># Transformation en liste de la cha\u00eene de caract\u00e8res arn_1 du premier caract\u00e8re du codon d&rsquo;initiation au dernier caract\u00e8re&nbsp;<\/span><\/p>\n<p>def traduction(message): <span style=\"color: #339966\"># d\u00e9finit un programme appel\u00e9 traduction qui s&rsquo;appliquera \u00e0 la liste liste_arn_1&nbsp;<\/span>&nbsp;&nbsp;&nbsp;<\/p>\n<p style=\"padding-left: 40px\">i=0&nbsp;&nbsp;&nbsp;&nbsp;<\/p>\n<p style=\"padding-left: 40px\">protein_1=\u00a0\u00bb <span style=\"color: #339966\"># indique la variable qui va \u00eatre remplie par notre programme&nbsp;&nbsp;&nbsp;&nbsp;<\/span><\/p>\n<p style=\"padding-left: 40px\">for i in range(0,long_arn_1,3): <span style=\"color: #339966\"># boucle born\u00e9e o\u00f9 i prend les valeurs de 0 (premier caract\u00e8re) \u00e0 la valeur de la lg de la liste -1 (dernier caract\u00e8re) avec un pas de 3&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;<\/span><\/p>\n<p style=\"padding-left: 80px\">if liste_arn_1[i:i+3]==\u00a0\u00bbUUU\u00a0\u00bb or liste_arn_1[i:i+3]==\u00a0\u00bbUUC\u00a0\u00bb:&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;<\/p>\n<p style=\"padding-left: 120px\">protein_1=protein_1+\u00a0\u00bbPhe\u00a0\u00bb <span style=\"color: #339966\"># \u00e0 chaque tour le nom de l&rsquo;AA est ajout\u00e9 dans protein_1 si c&rsquo;est le codon correspondant qui est rencontr\u00e9&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;<\/span><\/p>\n<p style=\"padding-left: 80px\">elif liste_arn_1[i:i+3]==\u00a0\u00bbUUG\u00a0\u00bb or liste_arn_1[i:i+3]==\u00a0\u00bbUUA\u00a0\u00bb or liste_arn_1[i:i+3]==\u00a0\u00bbCUU\u00a0\u00bb or liste_arn_1[i:i+3]==\u00a0\u00bbCUC\u00a0\u00bb or liste_arn_1[i:i+3]==\u00a0\u00bbCUA\u00a0\u00bb or liste_arn_1[i:i+3]==\u00a0\u00bbCUG\u00a0\u00bb:&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;<\/p>\n<p style=\"padding-left: 120px\">protein_1=protein_1+\u00a0\u00bbLeu\u00a0\u00bb&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;<\/p>\n<p style=\"padding-left: 80px\">elif liste_arn_1[i:i+3]==\u00a0\u00bbAUG\u00a0\u00bb:&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;<\/p>\n<p style=\"padding-left: 120px\">protein_1=protein_1+\u00a0\u00bbMet\u00a0\u00bb&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;<\/p>\n<p style=\"padding-left: 80px\">elif liste_arn_1[i:i+3]==\u00a0\u00bbUAA\u00a0\u00bb or liste_arn_1[i:i+3]==\u00a0\u00bbUAG\u00a0\u00bb or liste_arn_1[i:i+3]==\u00a0\u00bbUGA\u00a0\u00bb: <span style=\"color: #339966\"># quand la boucle rencontre un des trois codons stop, elle s&rsquo;arr\u00eate et renvoie la cha\u00eene d&rsquo;AA obtenue (ligne suivante return(protein_1)&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;<\/span><\/p>\n<p style=\"padding-left: 120px\">return(protein_1)&nbsp;<\/p>\n<p>protein_1=traduction(liste_arn_1) <span style=\"color: #339966\"># \u00ab\u00a0message\u00a0\u00bb de la ligne 44 est remplac\u00e9 par la valeur de la variable (liste_arn_1) de la ligne 42 et le programme est r\u00e9alis\u00e9 sur la valeur de liste_arn_1<\/span><\/p>\n<p>print(protein_1) <span style=\"color: #339966\"># affiche dans la console le r\u00e9sultat du programme \u00ab\u00a0traduction\u00a0\u00bb<\/span><\/p>\n<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n<p>Console<\/p>\n<table>\n<tbody>\n<tr>\n<td width=\"778\">\n<p>&gt;&gt;&gt;&nbsp;<\/p>\n<p>MetPheLeuPhe<\/p>\n<p>&gt;&gt;&gt;&nbsp;<\/p>\n<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n<p><\/p>","protected":false},"excerpt":{"rendered":"<p>Capacit\u00e9s :Calculer le nombre de combinaisons possibles de s\u00e9quences de n nucl\u00e9otides de longueur quand n grandit Fichier Combi_nucleo.py \u00c9diteur nbre_nucleo=int(input(\u00ab\u00a0Entrer le nombre de nucl\u00e9otides existants :\u00a0\u00bb)) # demande \u00e0 l&rsquo;\u00e9l\u00e8ve d&rsquo;entrer le nombre de nucl\u00e9otides qui existe pour l&rsquo;ADN&nbsp; for n in range(1,101) : # cette syntaxe correspond \u00e0 une boucle born\u00e9e : ce &hellip; <\/p>\n<p><a class=\"more-link btn\" href=\"https:\/\/ent2d.ac-bordeaux.fr\/disciplines\/svt\/python\/premiere-specialite\/lexpression-du-patrimoine-genetique\/\">Lire la suite<\/a><\/p>\n","protected":false},"author":8,"featured_media":0,"parent":2592,"menu_order":2,"comment_status":"closed","ping_status":"closed","template":"template-onecolumn.php","meta":{"footnotes":""},"class_list":["post-2636","page","type-page","status-publish","hentry","nodate","item-wrap"],"_links":{"self":[{"href":"https:\/\/ent2d.ac-bordeaux.fr\/disciplines\/svt\/wp-json\/wp\/v2\/pages\/2636","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/ent2d.ac-bordeaux.fr\/disciplines\/svt\/wp-json\/wp\/v2\/pages"}],"about":[{"href":"https:\/\/ent2d.ac-bordeaux.fr\/disciplines\/svt\/wp-json\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"https:\/\/ent2d.ac-bordeaux.fr\/disciplines\/svt\/wp-json\/wp\/v2\/users\/8"}],"replies":[{"embeddable":true,"href":"https:\/\/ent2d.ac-bordeaux.fr\/disciplines\/svt\/wp-json\/wp\/v2\/comments?post=2636"}],"version-history":[{"count":12,"href":"https:\/\/ent2d.ac-bordeaux.fr\/disciplines\/svt\/wp-json\/wp\/v2\/pages\/2636\/revisions"}],"predecessor-version":[{"id":2694,"href":"https:\/\/ent2d.ac-bordeaux.fr\/disciplines\/svt\/wp-json\/wp\/v2\/pages\/2636\/revisions\/2694"}],"up":[{"embeddable":true,"href":"https:\/\/ent2d.ac-bordeaux.fr\/disciplines\/svt\/wp-json\/wp\/v2\/pages\/2592"}],"wp:attachment":[{"href":"https:\/\/ent2d.ac-bordeaux.fr\/disciplines\/svt\/wp-json\/wp\/v2\/media?parent=2636"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}