Question: Please show all work 4) Sequence alignment. Consider Transition-Transversion matrix for the matching/mismatching score gap penalty 8 G -15 -5 1 a) Complete the following
Please show all work 4) Sequence alignment. Consider Transition-Transversion matrix for the matching/mismatching score gap penalty 8 G -15 -5 1 a) Complete the following matrix for aligning the two DNA sequences GCGC and AGC: empty G 16 24 32 -9 -6 empty 0 -8 -8 -16 7 24 15 -1 b) List one optimal alignment for the two sequences: c) What's the time complexity of the algorithm if both two sequences have n nucleotides (letters)? Justify your
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
