Commit 331d5485 by Bertrand NÉRON

### fix typos

parent c5581f23
Pipeline #58157 passed with stages
in 12 seconds
 ... @@ -360,11 +360,11 @@ In the first algorithm. ... @@ -360,11 +360,11 @@ In the first algorithm. | In the second algorithm we read the sequence only once | In the second algorithm we read the sequence only once ======= ======= In the first alogrithm. 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` | then we count the occurence of each kmer in the sequence | then we count the occurrence of each kmer in the sequence | so for each kmer we read all the sequence so the algorith 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 secon algorithm we read the sequence only once | In the secon algorithm we read the sequence only once >>>>>>> e986fb63db27fe063adb907bfb916dbb79c5db9b >>>>>>> e986fb63db27fe063adb907bfb916dbb79c5db9b ... @@ -448,7 +448,7 @@ pseudocode: ... @@ -448,7 +448,7 @@ pseudocode: """"""""""" """"""""""" | *function reverse_comp(sequence)* | *function reverse_comp(sequence)* | *complement <- establish a correpondance and each base and its complement* | *complement <- establish a correspondance and each base and its complement* | *rev_seq <- revert the sequence* | *rev_seq <- revert the sequence* | *rev_comp <- empty* | *rev_comp <- empty* | *for each nt of rev_seq* | *for each nt of rev_seq* ... ...
Markdown is supported
0% or .
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!