https://www.dropbox.com/s/x7ugtmjmet0dvkn/dna.py Modify this code so that it fin

Question

https://www.dropbox.com/s/x7ugtmjmet0dvkn/dna.py

Modify this code so that it finds the optimal (highest) score and prints only the alignments that have that score. (link above)

AAGGTAGCCTAACGTCCACTTTACCC

AGTAAGGTACCTACCTCAACTTCA

How much work does the algorithm do on these sequences? Explain your answer.

*Note: If you modify this program and you are doing it in a version of Python that is not 3.3.2 then it will not work for me. If the program or code you post as an answer does not run in Python VERSION 3.3.2 then I will not award any points. Thanks.

Explanation / Answer

This is for full part1 and 2

https://www.dropbox.com/s/nwtqoyhk1b79516/chegg.py

Related Questions

Navigate

• Browse (All)
• Browse H
• Subjects

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.