Commit fcff438e by Bertrand NÉRON

### Merge branch 'master' of gitlab.pasteur.fr:hub-courses/python_one_week_4_biologists_solutions

parents c1280456 5cfab960
Pipeline #58630 passed with stages
in 34 seconds
 ... @@ -351,7 +351,6 @@ Compare the pseudocode of each of them and implement the fastest one. :: ... @@ -351,7 +351,6 @@ Compare the pseudocode of each of them and implement the fastest one. :: acggcaacatggctggccagtgggctctgagaggagaaagtccagtggatgctcttggtctggttcgtgagcgcaacaca""" acggcaacatggctggccagtgggctctgagaggagaaagtccagtggatgctcttggtctggttcgtgagcgcaacaca""" <<<<<<< HEAD In the first algorithm. In the first algorithm. | we first compute all kmers we generate 4\ :sup:`kmer length` | we first compute all kmers we generate 4\ :sup:`kmer length` ... @@ -359,15 +358,6 @@ In the first algorithm. ... @@ -359,15 +358,6 @@ In the first algorithm. | so for each kmer we read all the sequence so the algorithm is in O( 4\ :sup:`kmer length` * ``sequence length``) | so for each kmer we read all the sequence so the algorithm is in O( 4\ :sup:`kmer length` * ``sequence length``) | In the second algorithm we read the sequence only once | In the second algorithm we read the sequence only once ======= In the first algorithm. | we first compute all kmers we generate 4\ :sup:`kmer length` | then we count the occurrence of each kmer in the sequence | so for each kmer we read all the sequence so the algorithm is in O( 4\ :sup:`kmer length` * ``sequence length``) | In the secon algorithm we read the sequence only once >>>>>>> e986fb63db27fe063adb907bfb916dbb79c5db9b | So the algorithm is in O(sequence length) | So the algorithm is in O(sequence length) ... @@ -546,6 +536,7 @@ and the 2 dna fragments: :: ... @@ -546,6 +536,7 @@ and the 2 dna fragments: :: :language: python :language: python :: :: from enzyme_1 import * from enzyme_1 import * enzymes = [ecor1, ecor5, bamh1, hind3, taq1, not1, sau3a1, hae3, sma1] enzymes = [ecor1, ecor5, bamh1, hind3, taq1, not1, sau3a1, hae3, sma1] ... ...