Consider the problem of searching for genes in DNA sequences using Boyer-Moore algorithm. A DNA sequence is represented by a text on the alphabet {A, C, G, T}, and the gene segment is the pattern....

Consider the problem of searching for genes in DNA sequences using Boyer-Moore algorithm. A DNA

sequence is represented by a text on the alphabet {A, C, G, T}, and the gene segment is the pattern.

Choose the problem instance for your group. (Choose the text and the pattern for your group.) If you

choose a different problem instance, your answer will not be accepted and you will get zero for your

solution.
Construct the bad-symbol shift (?1) table and the good-suffix shift (?2) table.

Extracted text: Consider the problem of searching for genes in DNA sequences using Boyer-Moore algorithm. A DNA sequence is represented by a text on the alphabet {A, C, G, T}, and the gene segment is the pattern. TEXT PATTERN 6|78 9 10 11 12 13 14 15 16 17 18 19 0 12 3 4 6 7 T|A|A|A CT|CGT|G ACT G|AT GA A|C G A Construct the good-suffix shift (tı) table and the bad-symbol shift (t2) table. Pattern Construct the good-suffix shift (t,) table t1 Character c A G Shift t(c) Construct the bad-symbol shift (t2) table t2 k Pattern d2 1 3 6. 7 What is the total number of comparisons made by the Boyer-Moore algorithm Number of comparisons 012 3 4 567 8 9 10|11|12|13 14 15 16 17 18 19 2o 21 22 23 24 25 26 27 28 29