Given a set of DNA sequences, find a set of l-mers, one from each sequence, that maximizes the consensus score.
Input: A t×n matrix of DNA, and l , the length of the pattern to find.
Output: An array of t starting positions s = (s1 , s2 , . . . , st ) maximizing Score(s, DNA).
There is also other tasks in the pdf attached. I need help to sort this out as I don't understand much about biology and my python level is very low/
6 freelancers are bidding on average €44 for this job
hi. I am a python developer and having 2-3 years of experience in developing software. please contact me if you are interested to discuss this with me. thanks,