Question: 3. A DNA sequence consists of a string with one of 4 bases (A, T, C, and G) at each position in the string (e.g.

3. A DNA sequence consists of a string with one of 4 bases (A, T, C, and G) at each position in the string (e.g. ATACCAGGCT). You are studying the evolution of two species of Hawaiian honeycreeper birds, and you want to see how closely a DNA sequence from each of them matches the other. Each sequence is 1000 bases long. You line them up side by side and want to find the length of the longest contiguous stretch of bases in which the bases match between the two sequences (i.e. there are no mismatches within this stretch). (a) Write an algorithm that returns the length of the longest contiguous stretch of exactly matching bases between the pair of 1000 base sequences. 10 points] Replace this text with your answer (b) Write an algorithm that returns the length of the longest contiguous stretch where none of the bases match between the two sequences.10 points Replace this text with your
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
