Commit 150ca035 by Bertrand NÉRON

parent 3d5f313a
 ... ... @@ -38,9 +38,21 @@ The fibonacci suite can be defined as following: a = b b = new_number We will see another way more elegant to implement the fibonacci suite in next chapter. We will see another way more elegant to implement the fibonacci suite in :ref:`Advance Programming Techniques` section. Exercise -------- display the largest element in list (containing float or integer only)?:: l = [1,2,3,4,58,9] for i in l: highest = l[0] if i > highest: highest = i print i Exercise -------- ... ...
 ... ... @@ -3,3 +3,52 @@ ****************************** Creating and Calling Functions ****************************** Exercises ========= Exercice -------- Use the code of the exetrcise 4.5.7 on the kmer. Make a function which compute all kmer of a given lenght in a sequence. Exercise -------- Write a function translate taht have a nucleic sequence as parameter, and return the translate sequence. We give you a genetic code : :: code = { 'ttt': 'F', 'tct': 'S', 'tat': 'Y', 'tgt': 'C', 'ttc': 'F', 'tcc': 'S', 'tac': 'Y', 'tgc': 'C', 'tta': 'L', 'tca': 'S', 'taa': '*', 'tga': '*', 'ttg': 'L', 'tcg': 'S', 'tag': '*', 'tgg': 'W', 'ctt': 'L', 'cct': 'P', 'cat': 'H', 'cgt': 'R', 'ctc': 'L', 'ccc': 'P', 'cac': 'H', 'cgc': 'R', 'cta': 'L', 'cca': 'P', 'caa': 'Q', 'cga': 'R', 'ctg': 'L', 'ccg': 'P', 'cag': 'Q', 'cgg': 'R', 'att': 'I', 'act': 'T', 'aat': 'N', 'agt': 'S', 'atc': 'I', 'acc': 'T', 'aac': 'N', 'agc': 'S', 'ata': 'I', 'aca': 'T', 'aaa': 'K', 'aga': 'R', 'atg': 'M', 'acg': 'T', 'aag': 'K', 'agg': 'R', 'gtt': 'V', 'gct': 'A', 'gat': 'D', 'ggt': 'G', 'gtc': 'V', 'gcc': 'A', 'gac': 'D', 'ggc': 'G', 'gta': 'V', 'gca': 'A', 'gaa': 'E', 'gga': 'G', 'gtg': 'V', 'gcg': 'A', 'gag': 'E', 'ggg': 'G' } bonus """"" This function have to take the phase as parameter bonus """"" This function can take genetique code as default parameter