Commit 99360bf6 authored by Blaise Li's avatar Blaise Li
Browse files

Conflict leftovers?

parent a57ca700
Pipeline #58248 passed with stages
in 13 seconds
......@@ -359,15 +359,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``)
| 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)
......
Markdown is supported
0% or .
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment