Question: 3. Implement the Brute Force Median String Search algorithm [No need to use a tree]. Test the given algorithm for the cases of 4-mer, 5-mer
3. Implement the Brute Force Median String Search algorithm [No need to use a tree]. Test the given algorithm for the cases of 4-mer, 5-mer and 6-mer with the given Sequences.fa file. (60 points] Test Case 1: For sequences in Sequences.fa, the motif of length 4 is GATC Test Case 2: For sequences in Sequences.fa, the motif of length 5 is CCGAA Test Case 3: For sequences in Sequences.fa, the motif of length 6 is TCCGAA 3. Implement the Brute Force Median String Search algorithm [No need to use a tree]. Test the given algorithm for the cases of 4-mer, 5-mer and 6-mer with the given Sequences.fa file. (60 points] Test Case 1: For sequences in Sequences.fa, the motif of length 4 is GATC Test Case 2: For sequences in Sequences.fa, the motif of length 5 is CCGAA Test Case 3: For sequences in Sequences.fa, the motif of length 6 is TCCGAA
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
