Question: Implement algorithm DivideConquerMatch Outline of implementation: (1) Use the algorithm/method DivideConquerMatch(S[p..q], P[0..m-1]), where S is the test with n symbols and P is the pattern
![Implement algorithm DivideConquerMatch Outline of implementation: (1) Use the algorithm/method DivideConquerMatch(S[p..q],](https://dsd5zvtm8ll6.cloudfront.net/si.experts.images/questions/2024/09/66f3320ed12df_09466f3320e61d25.jpg)
Implement algorithm DivideConquerMatch Outline of implementation: (1) Use the algorithm/method DivideConquerMatch(S[p..q], P[0..m-1]), where S is the test with n symbols and P is the pattern with m symbols, to find the first match in S[p] to S[q]. (ii) Write a main method to (a) randomly generate 100000 symbols of A, C, G, T for text S and 8 symbols of A, C, G, T for pattern P, (b) call the above method to find the first match, (c) calculate the total number of matches by changing the above method. Submission: (i) Show the correctness of your implementation with the text of 100 symbols, (ii) output and running time for 100000 symbols. (iii) code Implement algorithm DivideConquerMatch Outline of implementation: (1) Use the algorithm/method DivideConquerMatch(S[p..q], P[0..m-1]), where S is the test with n symbols and P is the pattern with m symbols, to find the first match in S[p] to S[q]. (ii) Write a main method to (a) randomly generate 100000 symbols of A, C, G, T for text S and 8 symbols of A, C, G, T for pattern P, (b) call the above method to find the first match, (c) calculate the total number of matches by changing the above method. Submission: (i) Show the correctness of your implementation with the text of 100 symbols, (ii) output and running time for 100000 symbols. (iii) code
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
